Skip to main content

Feature Selection for Analogy-Based Learning to Rank

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11828))

Abstract

Learning to rank based on principles of analogical reasoning has recently been proposed as a novel method in the realm of preference learning. Roughly speaking, the method proceeds from a regularity assumption as follows: Given objects A, B, C, D, if A relates to B as C relates to D, and A is preferred to B, then C is presumably preferred to D. This assumption is formalized in terms of so-called analogical proportions, which operate on a feature representation of the objects. Consequently, a suitable feature representation is an important prerequisite for the success of analogy-based learning to rank. In this paper, we therefore address the problem of feature selection and adapt common feature selection techniques, including forward selection, correlation-based filter techniques, as well as Relief-based methods, to the case of analogical learning. The usefulness of these approaches is shown in experiments with synthetic and benchmark data.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Actually, we do not produce a ranking of all features, but include only those features whose scores are positive.

  2. 2.

    https://github.com/mahmadif/able2rank.

  3. 3.

    The description is available at https://github.com/mahmadif/able2rank.

References

  1. Ahmadi Fahandar, M., Hüllermeier, E.: Learning to rank based on analogical reasoning. In: AAAI (2018)

    Google Scholar 

  2. Ahmadi Fahandar, M., Hüllermeier, E.: Analogy-based preference learning with kernels. In: Benzmüller, C., Stuckenschmidt, H. (eds.) KI 2019. LNCS (LNAI), vol. 11793, pp. 34–47. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-30179-8_3

    Chapter  Google Scholar 

  3. Ahmadi Fahandar, M., Hüllermeier, E., Couso, I.: Statistical inference for incomplete ranking data: the case of rank-dependent coarsening. In: ICML (2017)

    Google Scholar 

  4. Bounhas, M., Pirlot, M., Prade, H.: Predicting preferences by means of analogical proportions. In: ICCBR (2018)

    Google Scholar 

  5. Draper, B., Kaito, C., Bins, J.: Iterative relief. In: 2003 Conference on Computer Vision and Pattern Recognition Workshop (2003)

    Google Scholar 

  6. Fürnkranz, J., Hüllermeier, E.: Preference Learning. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-14125-6

    Book  MATH  Google Scholar 

  7. Geng, Z., Shi, N.Z.: Algorithm AS 257: isotonic regression for umbrella orderings. J. R. Stat. Soc. Seri. C (Appl. Stat.) 39(3), 397–402 (1990)

    MATH  Google Scholar 

  8. Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. JMLR 3, 1157–1182 (2003)

    MATH  Google Scholar 

  9. Keogh, E.: Instance-Based Learning, pp. 549–550. Springer, Boston (2010). https://doi.org/10.1007/978-0-387-30164-8_409

    Book  Google Scholar 

  10. Kira, K., Rendell, L.A.: The feature selection problem: traditional methods and a new algorithm. In: AAAI (1992)

    Google Scholar 

  11. Kira, K., Rendell, L.A.: A practical approach to feature selection. In: Proceedings ML-92, 9th International Workshop on Machine Learning (1992)

    Chapter  Google Scholar 

  12. Kononenko, I.: Estimating attributes: analysis and extensions of relief. In: ECML (1994)

    Google Scholar 

  13. Miclet, L., Prade, H.: Handling analogical proportions in classical logic and fuzzy logics settings. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS (LNAI), vol. 5590, pp. 638–650. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02906-6_55

    Chapter  MATH  Google Scholar 

  14. Mirzazadeh, F., Guo, Y., Schuurmans, D.: Convex co-embedding. In: AAAI (2014)

    Google Scholar 

  15. Sun, Y.: Iterative relief for feature weighting: algorithms, theories, and applications. IEEE TPAMI 29(6), 1035–1051 (2007)

    Article  Google Scholar 

  16. Sun, Y., Li, J.: Iterative relief for feature weighting. In: ICML (2006)

    Google Scholar 

  17. Turner, T., Wollan, P.: Locating a maximum using isotonic regression. Comput. Stat. Data Anal. 25(3), 305–320 (1997)

    Article  Google Scholar 

  18. Urbanowicz, R., Meeker, M., LaCava, W., Olson, R., Moore, J.: Relief-based feature selection: introduction and review. J. Biomed. Inform. 85, 189–203 (2017)

    Article  Google Scholar 

  19. Weinberger, K.Q., Saul, L.K.: Distance metric learning for large margin nearest neighbor classification. JMLR 10, 207–244 (2009)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohsen Ahmadi Fahandar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ahmadi Fahandar, M., Hüllermeier, E. (2019). Feature Selection for Analogy-Based Learning to Rank. In: Kralj Novak, P., Šmuc, T., Džeroski, S. (eds) Discovery Science. DS 2019. Lecture Notes in Computer Science(), vol 11828. Springer, Cham. https://doi.org/10.1007/978-3-030-33778-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-33778-0_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-33777-3

  • Online ISBN: 978-3-030-33778-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics