Clustering High-Dimensional Data

Michael E. Houle (), Marie Kiermeier () and Arthur Zimek ()
Additional contact information
Michael E. Houle: National Institute of Informatics
Marie Kiermeier: Ludwig-Maximilians-Universität München
Arthur Zimek: University of Southern Denmark, Department of Mathematics and Computer Science

A chapter in Machine Learning for Data Science Handbook, 2023, pp 219-237 from Springer

Abstract: Abstract Clustering algorithms have been adapted or specifically designed for high-dimensional data where many attributes might be just noise such that patterns can be identified only in appropriate combinations of attributes and would be obfuscated by noise otherwise. In this chapter, we give an overview of the basic strategies and techniques used for these specialized algorithms along with pointers to example methods.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-24628-9_11

Ordering information: This item can be ordered from
http://www.springer.com/9783031246289

DOI: 10.1007/978-3-031-24628-9_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().