Skip to main content
SpringerLink
Log in

Subspace Clustering Techniques

  • Living reference work entry
  • First Online:
Encyclopedia of Database Systems

  • 96 Accesses

Abstract

Cluster analysis aims at finding a set of subsets (i.e., a clustering) of objects in a data set.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Hartigan JA. Direct clustering of a data matrix. J Am Stat Assoc. 1972;67(337):123–29.

    Article  Google Scholar 

  2. Agrawal R, Gehrke J, Gunopulos D, Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Seattle; 1998. p. 94–105.

    Google Scholar 

  3. Aggarwal CC, Procopiuc CM, Wolf JL, Yu PS, Park JS. Fast algorithms for projected clustering. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Philadelphia; 1999. p. 61–72.

    Google Scholar 

  4. Aggarwal CC, Yu PS. Finding generalized projected clusters in high dimensional space. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Dallas; 2000. p. 70–81.

    Google Scholar 

  5. Madeira SC, Oliveira AL. Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Trans Comput Biol Bioinform. 2004;1(1):24–45.

    Article  Google Scholar 

  6. Kriegel HP, Kr¨ger P, Zimek A. Clustering high dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans Knowl Discov Data (TKDD). 2009;3(1):1–58.

    Google Scholar 

  7. Kriegel HP, Kr¨ger P, Zimek A. Subspace clustering. Wiley Interdiscip Rev Data Min Knowl Disc. 2012;2(4):351–64.

    Article  Google Scholar 

  8. Bellman R. Adaptive control processes. A guided tour. Princeton: Princeton University Press; 1961.

    Book  MATH  Google Scholar 

  9. Beyer K, Goldstein J, Ramakrishnan R, Shaft U. When is “Nearest Neighbor” meaningful? In: Proceedings of the 7th International Conference on Database Theory (ICDT), Jerusalem; 1999. p. 217–35.

    Google Scholar 

  10. Houle ME, Kriegel HP, Kr¨ger P, Schubert E, Zimek A. Can shared-neighbor distances defeat the curse of dimensionality? In: Proceedings of the 22nd International Conference on Scientific and Statistical Database Management (SSDBM), Heidelberg; 2010. p. 482–500.

    Google Scholar 

  11. Achtert E, B¨hm C, David J, Kr¨ger P, Zimek A. Global correlation clustering based on the Hough transform. Stat Anal Data Min. 2008;1(3):111–27.

    Article  MathSciNet  Google Scholar 

  12. Achtert E, B¨hm C, Kriegel HP, Kr¨ger P, Zimek A. Deriving quantitative models for correlation clusters. In: Proceedings of the 12th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Philadelphia; 2006. p. 4–13.

    Google Scholar 

  13. Zimek A, Vreeken J. The blind men and the elephant: on meeting the problem of multiple truths in data from clustering and pattern mining perspectives. Mach Learn. 2013;98:121–55.

    Article  MathSciNet  MATH  Google Scholar 

  14. Sim K, Gopalkrishnan V, Zimek A, Cong G. A survey on enhanced subspace clustering. Data Min Knowl Disc. 2013;26(2):332–97.

    Article  MathSciNet  MATH  Google Scholar 

  15. Achtert E, Kriegel HP, Schubert E, Zimek A. Interactive data mining with 3D-parallel-coordinate-trees. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), New York; 2013. p. 1009–12.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ludwig-Maximilians-Universität München, Munich, Germany

    Peer Kröger & Arthur Zimek

  2. Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense, Denmark

    Arthur Zimek

Authors
  1. Peer Kröger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arthur Zimek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peer Kröger .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, Georgia, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, Ontario, Canada

    M. Tamer Özsu

Section Editor information

  1. Department of Computer Science and Engineering, The University of California at Riverside, Bourns College of Engineering, 92521, Riverside, CA, USA

    Dimitrios Gunopulos

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media LLC

About this entry

Cite this entry

Kröger, P., Zimek, A. (2017). Subspace Clustering Techniques. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_607-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_607-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4899-7993-3

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation