A Low Dimensional Embedding Method for Combining Clusterings

Article Preview

Abstract:

Clustering combination has recently become a hotspot in machine learning, while its critical problem lies on how to combine multiple clusterings to yield a final superior result. In this paper, a low dimensional embedding method is proposed. It first obtains the low dimensional embeddings of hyperedges by performing spectral clustering algorithms and then obtains the low dimensional embeddings of objects indirectly by composition of mappings and finally performs K-means algorithm to cluster the objects according to their coordinates in the low dimensional space. Experimentally the proposed method is shown to perform well.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 201-203)

Pages:

2517-2520

Citation:

Online since:

February 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] P.N. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining (2005).

Google Scholar

[2] A. Strehl, and J. Ghosh, Cluster ensembles - a knowledge reuse framework for combining partitionings, Journal of Machine Learning Research (2002), pp.583-617.

Google Scholar

[3] X. Z. Fern, and C.E. Brodley, Solving cluster ensemble problems by bipartite graph partitioning, Proc. of the 21st Intl. Conf. on Machine Learning (2004).

DOI: 10.1145/1015330.1015414

Google Scholar

[4] A. L. Fred, and A. K. Jain, Combining Multiple Clusterings Using Evidence Accumulation, IEEE Trans. on Pattern Analysis and Machine Intelligence (2005), pp.835-850.

DOI: 10.1109/tpami.2005.113

Google Scholar

[5] S. Xu, Z. M. Lu, and G. C. Gu. Two spectral algorithms for ensembling document clusters. Acta Automatica Sinica. (2009), pp.997-1002.

DOI: 10.3724/sp.j.1004.2009.00997

Google Scholar

[6] G. Karypis, and V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM Journal on Scientific Computing (1998).

DOI: 10.1137/s1064827595287997

Google Scholar

[7] G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, Multilevel hypergraph partitioning: Applications in VLSI domain, Proc. of the Design and Automation Conf. (1997), pp.526-529.

DOI: 10.1109/dac.1997.597203

Google Scholar

[8] Information on http: /trec. ni-st. gov.

Google Scholar

[9] Information on http: /www. research. att. com/~lewis.

Google Scholar