Skip to main content

Feature Selection as Retrospective Pruning in Hierarchical Clustering

  • Conference paper
  • First Online:

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

Abstract

Although feature selection is a central problem in inductive learning as suggested by the growing amount of research in this area, most of the work has been carried out under the supervised learning paradigm, paying little attention to unsupervised learning tasks and, particularly, clustering tasks. In this paper, we analyze the particular benefits that feature selection may provide in hierarchical clustering. We propose a view of feature selection as a tree pruning process similar to those used in decision tree learning. Under this framework, we perform several experiments using different pruning strategies and considering a multiple prediction task. Results suggest that hierarchical clusterings can be greatly simplified without diminishing accuracy.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. L. Blum and P. Langley. Selection of relevant features and examples in machine learning. Artificial Intelligence, 97:245–271, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. Dash, H. Liu, and J. Yao. Dimensionality reduction for unsupervised data. In Ninth IEEE International Conference on Tools with AI, ICTAI’97, 1997.

    Google Scholar 

  3. M. Devaney and A. Ram. Efficient feature selection in conceptual clustering. In Machine Learning: Proceedings of the Fourteenth International Conference, pages 92–97, Nashville, TN, 1997. Morgan Kaufmann.

    Google Scholar 

  4. U. M. Fayyad, G. Piatetsky-Shapiro, and P. Smyth. From data mining to knowledge discovery: An overview. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 1–34. AAAI Press, Cambridge, MA, 1996.

    Google Scholar 

  5. D. H. Fisher. Knowledge acquisition via incremental conceptual clustering. Machine Learning, 2:139–172, 1987.

    Google Scholar 

  6. D. H. Fisher. Iterative optimization and Simplification of hierarchical clusterings. Journal of Artificial Intelligence Research, (4):147–179, 1996.

    Google Scholar 

  7. D. H. Fisher and J. C. Schlimmer. Concept Simplification and prediction accuracy. In Proceedings of the Fifth International Conference on Machine Learning, pages 22–28, Ann Arbor, MI, 1988. Morgan Kaufmann.

    Google Scholar 

  8. J. H. Gennari. Concept formation and attention. pages 724–728, 1991.

    Google Scholar 

  9. G. H. John, R. Kohavi, and K. Pfleger. Irrelevant features and the subset selection problem. In Proceedings of the Eleventh International Conference on Machine Learning, pages 121–129. Morgan Kauffmann, San Mateo, CA, 1994.

    Google Scholar 

  10. P. Langley. Elements of machine learning. Morgan Kaufmann, San Francisco, CA, 1995.

    Google Scholar 

  11. R. S. Michalski and R. E. Stepp. Learning from observation: Conceptual clustering. In R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, editors, Machine Learning: An Artificial intelligence approach, pages 331–363. Morgan Kauffmann, San Mateo, CA, 1983.

    Google Scholar 

  12. J. Mingers. An empirical comparison of pruning methods for decision tree induction. Machine Learning, 4(2):227–243, 1989.

    Article  Google Scholar 

  13. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA, 1993.

    Google Scholar 

  14. L. Talavera. Feature selection as a preprocessing step for hierarchical clustering. In Proceedings of the Sixteenth International Conference on Machine Learning. Morgan Kaufmann, 1999. (To appear).

    Google Scholar 

  15. D. Wettschereck and D. W. Aha. Weighting features. In Proceedings of the First International Conference on Case-Based Reasoning, Portugal, 1995. Lisbon.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Talavera, L. (1999). Feature Selection as Retrospective Pruning in Hierarchical Clustering. In: Hand, D.J., Kok, J.N., Berthold, M.R. (eds) Advances in Intelligent Data Analysis. IDA 1999. Lecture Notes in Computer Science, vol 1642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48412-4_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48412-4_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66332-4

  • Online ISBN: 978-3-540-48412-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics