Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
8. Approximate and Spectral Clustering for Network and Affinity Data
verfasst von : Boris Mirkin
Erschienen in: Core Concepts in Data Analysis: Summarization, Correlation and Visualization
Verlag: Springer London
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
This chapter is devoted to clustering similarity, graph and network data – these are represented by square matrices rather than rectangular ones. This chapter describes methods for finding a cluster or two-cluster split combining three types of approaches from both old and recent developments: (a)combinatorial approach that is oriented at clustering as optimization of some reasonable measure of cluster homogeneity, (b)additive clustering approach that is based on a data recovery model at which the data is decoded from a cluster structure to be found by minimizing the discrepancy between them and observed similarities, and (c)spectral clustering approach exploiting the machinery of matrix eigenvalues and eigenvectors as a relaxation of combinatorial problems for similarity clustering.