Skip to main content

2014 | OriginalPaper | Buchkapitel

16. Clustering

verfasst von : Dan A. Simovici, Chabane Djeraba

Erschienen in: Mathematical Tools for Data Mining

Verlag: Springer London

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Clustering is the process of grouping together objects that are similar. The groups formed by clustering are referred to as clusters

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat A.K. Jain, M.N. Murty, P.J. Flynn, Data clustering: a review. ACM Comput. Surv. 31, 264–323 (1999)CrossRef A.K. Jain, M.N. Murty, P.J. Flynn, Data clustering: a review. ACM Comput. Surv. 31, 264–323 (1999)CrossRef
2.
Zurück zum Zitat T. Kurita, An efficient agglomerative clustering algorithm using a heap. Pattern Recogn. 24, 205–209 (1991)CrossRefMathSciNet T. Kurita, An efficient agglomerative clustering algorithm using a heap. Pattern Recogn. 24, 205–209 (1991)CrossRefMathSciNet
3.
Zurück zum Zitat P. Berkhin, J. Becher, Learning simple relations: theory and applications. ed. by R.L. Grossman, J. Han, V. Kumar, H. Mannila, R. Motwani, in Proceedings of the 2nd SIAM International Conference on Data Mining, (Arlington, 2002), pp. 420–436 P. Berkhin, J. Becher, Learning simple relations: theory and applications. ed. by R.L. Grossman, J. Han, V. Kumar, H. Mannila, R. Motwani, in Proceedings of the 2nd SIAM International Conference on Data Mining, (Arlington, 2002), pp. 420–436
4.
Zurück zum Zitat L. Kaufman, P.J. Rousseeuw, Finding Groups in Data—An Introduction to Cluster Analysis (Wiley Interscience, New York, 1990) L. Kaufman, P.J. Rousseeuw, Finding Groups in Data—An Introduction to Cluster Analysis (Wiley Interscience, New York, 1990)
5.
Zurück zum Zitat M. Fiedler, Algebraic connectivity of graphs. Czechoslovak Math. J. 23, 298–305 (1973)MathSciNet M. Fiedler, Algebraic connectivity of graphs. Czechoslovak Math. J. 23, 298–305 (1973)MathSciNet
6.
Zurück zum Zitat B. Nadler, M. Galun, Fundamental limitation of spectral clustering, Advances in Neural Information Processing Systems, vol 19 (MIT Press, Cambridge, 2007), pp. 1017–1024 B. Nadler, M. Galun, Fundamental limitation of spectral clustering, Advances in Neural Information Processing Systems, vol 19 (MIT Press, Cambridge, 2007), pp. 1017–1024
7.
Zurück zum Zitat L. Hagen, A. Kahng, New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Comput. Aided Des. 11, 1074–1085 (1992)CrossRef L. Hagen, A. Kahng, New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Comput. Aided Des. 11, 1074–1085 (1992)CrossRef
8.
Zurück zum Zitat J. Shi, J. Malik, Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22, 888–905 (2000)CrossRef J. Shi, J. Malik, Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22, 888–905 (2000)CrossRef
9.
Zurück zum Zitat P. Perona, W. Freeman, A factorization approach to grouping. In European Conference on Computer Vision (1998), pp. 655–670 P. Perona, W. Freeman, A factorization approach to grouping. In European Conference on Computer Vision (1998), pp. 655–670
10.
Zurück zum Zitat M. Steinbach, G. Karypis, V. Kumar. A comparison of document clustering techniques. ed. by M. Grobelnik, D. Mladenic, N. Milic-Freyling. KDD Workshop on Text Mining, (Boston, 2000) M. Steinbach, G. Karypis, V. Kumar. A comparison of document clustering techniques. ed. by M. Grobelnik, D. Mladenic, N. Milic-Freyling. KDD Workshop on Text Mining, (Boston, 2000)
11.
Zurück zum Zitat S. Ray, R. Turi, Determination of number of clusters in \(k\)-means clustering in colour image segmentation. In Proceedings of the 4th International Conference on Advances in Pattern Recognition and Digital Technology, (Narosa, New Delhi, 1984), pp. 137–143 S. Ray, R. Turi, Determination of number of clusters in \(k\)-means clustering in colour image segmentation. In Proceedings of the 4th International Conference on Advances in Pattern Recognition and Digital Technology, (Narosa, New Delhi, 1984), pp. 137–143
12.
Zurück zum Zitat U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikolski, D. Wagner, On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172–188 (2008)CrossRef U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikolski, D. Wagner, On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172–188 (2008)CrossRef
13.
Zurück zum Zitat P.N. Tan, M. Steinbach, V. Kumar, Introduction to Data Mining (Addison-Wesley, Reading, 2005) P.N. Tan, M. Steinbach, V. Kumar, Introduction to Data Mining (Addison-Wesley, Reading, 2005)
14.
Zurück zum Zitat A.K. Jain, R.C. Dubes, Algorithm for Clustering Data (Prentice Hall, Englewood Cliffs, 1988) A.K. Jain, R.C. Dubes, Algorithm for Clustering Data (Prentice Hall, Englewood Cliffs, 1988)
15.
Zurück zum Zitat P. Berkhin, A survey of clustering data mining techniques, in Grouping Multidimensional Data—Recent Advances in Clustering, ed. by J. Kogan, C. Nicholas, M. Teboulle(Springer, Berlin, 2006), pp. 25–72 P. Berkhin, A survey of clustering data mining techniques, in Grouping Multidimensional Data—Recent Advances in Clustering, ed. by J. Kogan, C. Nicholas, M. Teboulle(Springer, Berlin, 2006), pp. 25–72
16.
Zurück zum Zitat T. Zhang, R. Ramakrishnan, M. Livny, Birch: a new data clustering algorithm and its applications. Data Min. Knowl. Disc. 1(2), 141–182 (1997) T. Zhang, R. Ramakrishnan, M. Livny, Birch: a new data clustering algorithm and its applications. Data Min. Knowl. Disc. 1(2), 141–182 (1997)
17.
Zurück zum Zitat M. Fiedler, A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czechoslovak Math. J. 25, 619–633 (1975)CrossRefMathSciNet M. Fiedler, A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czechoslovak Math. J. 25, 619–633 (1975)CrossRefMathSciNet
18.
Zurück zum Zitat J. Kleinberg, An impossibility theorem for clustering, in Advances in Neural Information Processing Systems, 15, Vancouver, Canada, 2002, ed. by S. Becker, S. Thrun, K. Obermayer. (MIT Press, Cambridge, 2003), pp. 446–453 J. Kleinberg, An impossibility theorem for clustering, in Advances in Neural Information Processing Systems, 15, Vancouver, Canada, 2002, ed. by S. Becker, S. Thrun, K. Obermayer. (MIT Press, Cambridge, 2003), pp. 446–453
19.
Zurück zum Zitat W.E. Donath, A.J. Hoffman, Lower bounds for the partitioning of graphs. IBM J. Res. Dev. 17, 420–425 (1973) W.E. Donath, A.J. Hoffman, Lower bounds for the partitioning of graphs. IBM J. Res. Dev. 17, 420–425 (1973)
Metadaten
Titel
Clustering
verfasst von
Dan A. Simovici
Chabane Djeraba
Copyright-Jahr
2014
Verlag
Springer London
DOI
https://doi.org/10.1007/978-1-4471-6407-4_16