Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3177))

  • 1325 Accesses

Abstract

We propose a new feature selection criterion not based on calculated measures between attributes, or complex and costly distance calculations. Applying a wrapper to the output of a new attribute ranking method, we obtain a minimum subset with the same error rate as the original data. The experiments were compared to two other algorithms with the same results, but with a very short computation time.

This work has been supported by the Spanish Research Agency CICYT under grant TIC2001-1143-C03-02.

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

Similar content being viewed by others

References

  1. Langley, P.: Selection of relevant features in machine learning. In: Procs. Of the AAAI Fall Symposium on Relevance, pp. 140–144 (1994)

    Google Scholar 

  2. Blum, A., Langley, P.: Selection of relevant features and examples in machine learning. In: Artificial Intelligence, pp. 245–271 (1997)

    Google Scholar 

  3. Doak, J.: An evaluation of search algorithms for feature selection. Technical report, Los Alamos National Laboratory (1994)

    Google Scholar 

  4. Dash, M., Liu, H.: Feature selection for classification. Intelligent Data Analisys 1 (1997)

    Google Scholar 

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

    MATH  Google Scholar 

  6. Kononenko, I.: Estimating attributes: Analysis and estensions of relief. In: European Conference on Machine Learning, pp. 171–182 (1994)

    Google Scholar 

  7. Quinlan, J.: Induction of decision trees. Machine Learning 1, 81–106 (1986)

    Google Scholar 

  8. Aha, D., Kibler, D., Albert, M.: Instance-based learning algorithms. Machine Learning 6, 37–66 (1991)

    Google Scholar 

  9. Witten, I.H., Frank, E.: Data Mining: Practical machine learning tools with Java implementations. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  10. Blake, C., Merz, E.K.: Uci repository of machine learning databases (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ruiz, R., Aguilar-Ruiz, J.S., Riquelme, J.C. (2004). Wrapper for Ranking Feature Selection. In: Yang, Z.R., Yin, H., Everson, R.M. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2004. IDEAL 2004. Lecture Notes in Computer Science, vol 3177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28651-6_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28651-6_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22881-3

  • Online ISBN: 978-3-540-28651-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics