Skip to main content

Ranking Attributes Using Learning of Preferences by Means of SVM

  • Conference paper
Current Topics in Artificial Intelligence (CAEPIA 2007)

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

Included in the following conference series:

  • 570 Accesses

Abstract

A relaxed setting for Feature Selection is known as Feature Ranking in Machine Learning. The aim is to establish an order between the attributes that describe the entries of a learning task according to their utility. In this paper, we propose a method to establish these orders using Preference Learning by means of Support Vector Machines (SVM). We include an exhaustive experimental study that investigates the virtues and limitations of the method and discusses, simultaneously, the design options that we have adopted. The conclusion is that our method is very competitive, specially when it searchs for a ranking limiting the number of combinations of attributes explored; this supports that the method presented here could be successfully used in large data sets.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bahamonde, A., Bayón, G.F., Díez, J., Quevedo, J.R., Luaces, O., del Coz, J.J., Alonso, J., Goyache, F.: Feature subset selection for learning preferences: A case study. In: Greiner, R., Schuurmans, D. (eds.) ICML 2004. Proceedings of the International Conference on Machine Learning, Banff, Alberta (Canada), pp. 49–56 (July 2004)

    Google Scholar 

  2. Duda, R., Hart, P.: Pattern Classification and Scene Analysis. Wiley, Chichester (1973)

    MATH  Google Scholar 

  3. Egan, J.P.: Signal Detection Theory and ROC Analysis. Series in Cognition and Perception. Academic Press, New York (1975)

    Google Scholar 

  4. Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. Journal of Machine Learning Research 3, 1157–1182 (2003)

    Article  MATH  Google Scholar 

  5. Herbrich, R., Graepel, T., Obermayer, K.: Large margin rank boundaries for ordinal regression. In: Advances in Large Margin Classifiers, MIT Press, Cambridge, MA (2000)

    Google Scholar 

  6. Inza, I., Larrañaga, P., Etxeberria, R., Sierra, B.: Feature subset selection by Bayesian networks based optimization. Artificial Intelligence 123(1-2), 157–184 (2000)

    Article  MATH  Google Scholar 

  7. Joachims, T.: Optimizing search engines using clickthrough data. In: Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD), ACM, New York (2002)

    Google Scholar 

  8. Jong, K., Mary, J., Cornuéjols, A., Marchiori, E., Sebag, M.: Ensemble feature ranking. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 267–278. Springer, Heidelberg (2004)

    Google Scholar 

  9. Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artificial Intelligence 97(1-2), 273–324 (1997)

    Article  MATH  Google Scholar 

  10. Larrañaga, P., Lozano, J.: Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Norwell, MA (2001)

    Google Scholar 

  11. Michalski, R.: Learnable evolution model: Evolutionary processes guided by machine learning. Machine Learning, 9–40 (2000)

    Google Scholar 

  12. Miquélez, T., Bengoetxea, E., Larrañaga, P.: Evolutionary computations based on bayesian classifiers. International Journal of Applied Mathematics and Computer Science 14(3), 101–115 (2004)

    Google Scholar 

  13. Larrañaga, P., Lozano, J.A.: Synergies between evolutionary computation and probabilistic graphical models. International Journal of Approximate Reasoning, 155–156 (2002)

    Google Scholar 

  14. Quevedo, J.R., Bahamonde, A., Luaces, O.: A simple and efficient method for variable ranking according to their usefulness for learning. In: Computational Statistics and Data Analysis (to appear, 2007)

    Google Scholar 

  15. Vapnik, V.: Statistical Learning Theory. John Wiley, Chichester (1998)

    MATH  Google Scholar 

  16. Vapnik, V., Golowich, S., Smola, A.: Support vector method for function approximation, regression estimation, and signal processing. In: Mozer, M.C., Jordan, M.I., Petsche, T. (eds.) Advances in Neural Information Processing Systems, vol. 9, pp. 281–287. MIT Press, Cambridge, MA (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Daniel Borrajo Luis Castillo Juan Manuel Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hernández-Arauzo, A., García-Torres, M., Bahamonde, A. (2007). Ranking Attributes Using Learning of Preferences by Means of SVM. In: Borrajo, D., Castillo, L., Corchado, J.M. (eds) Current Topics in Artificial Intelligence. CAEPIA 2007. Lecture Notes in Computer Science(), vol 4788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75271-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75271-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75270-7

  • Online ISBN: 978-3-540-75271-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics