A probabilistic majorclust variant for the clustering of near-homogeneous graphs

Authors:
Oliver Niggemann;Volker Lohweg;Tim Tack
Affiliations:
Fraunhofer IOSB-INA, Competence Center Industrial Automation, Lemgo, Germany and Institute Industrial IT, Lemgo;Institute Industrial IT, Lemgo;Institute Industrial IT, Lemgo
Venue:
KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Year:
2010

Citing 5
Cited 0

Graph Clustering Using Multiway Ratio Cut

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
On the Nature of Structure and Its Identification

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Cluster Cores-Based Clustering for High Dimensional Data

ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Constrained locally weighted clustering

Proceedings of the VLDB Endowment
Fuzzifying clustering algorithms: the case study of majorclust

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Clustering remains a major topic in machine learning; it is used e.g. for document categorization, for data mining, and for image analysis. In all these application areas, clustering algorithms try to identify groups of related data in large data sets. In this paper, the established clustering algorithm MajorClust ([12]) is improved; making it applicable to data sets with few structure on the local scale--so called near-homogeneous graphs. This new algorithm MCProb is verified empirically using the problem of image clustering. Furthermore, MCProb is analyzed theoretically. For the applications examined so-far, MCProb outperforms other established clustering techniques.