ACM Home Page
Please provide us with feedback. Feedback
On combining multiple clusterings
Full text PdfPdf (179 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the thirteenth ACM international conference on Information and knowledge management table of contents
Washington, D.C., USA
SESSION: KM-2 (knowledge management): clustering II table of contents
Pages: 294 - 303  
Year of Publication: 2004
ISBN:1-58113-874-1
Authors
Tao Li  Florida International University, Miami, FL
Mitsunori Ogihara  University of Rochester, Rochester, NY
Sheng Ma  IBM T.J. Watson Research Center, Hawthorne, NY
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 83,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1031171.1031234
What is a DOI?

ABSTRACT

Many problems can be reduced to the problem of combining multiple clusterings. In this paper, we first summarize different application scenarios of combining multiple clusterings and provide a new perspective of viewing the problem as a categorical clustering problem. We then show the connections between various consensus and clustering criteria and discuss the complexity results of the problem. Finally we propose a new method to determine the final clustering. Experiments on kinship terms and clustering popular music from heterogeneous feature sets show the effectiveness of combining multiple clusterings.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Arabie, P., Carroll, J. D., & Desarbo, W. (1987). Three-way scaling and clustering. Newbury Park, CA: Sage publications.
2
 
3
 
4
 
5
Brucker, P. (1977). On the complexity of clustering problems. Optimization and Operations Research (pp. 45--54). Springer-Verlag.
 
6
Cohen, J. (1960). A coefficient of agreement for nominal scales. Educational and Psychological Measurement, 20, 37--46.
 
7
David, A., & Panchanathan, S. (2000). Wavelet-histogram method for face recognition. Journal of Electronic Imaging, 9, 217--225.
 
8
Day, W. H. E. (1986). Foreword: Comparison and consensus of classifications. Journal of Classification, 3, 183--185.
 
9
Duran, B. S., & Odell, P. L. Cluster analysis: a survey. New York, NY: Springer.
 
10
 
11
Ferligoj, A. (1992). Direct multicriteria clustering algorithm. Journal of Classification, 9, 43--61.
 
12
Ferligoj, A., & Batagelj, V. (1983). Some types of clustering with relational constraints. Psychometrika, 48, 541--552.
 
13
Fern, X. Z., & Brodley, C. E. (2003). Random projection for high dimensional data clustering: A cluster ensemble approach. Proceedings of the Twentieth International Conference on Machine Learning(ICML 2003) (pp. 186--193). Morgan Kaufmann Publishers.
 
14
Golub, G. H., & Loan, C. F. V. (1991). Matrix computations. The Johns Hopkins University Press.
 
15
Goodman, L. A., & Kruskal, W. H. (1954). Measures of associations for cross classification. Journal of the American Statistical Association, 49, 732--764.
 
16
Gordan, A. D., & Vichi, M. (1998). Partitions of partitions. journal of classification, 15, 265--285.
 
17
Gordan, A. D., & Vichi, M. (2002). Obtaining partitions of a set of hard or fuzzy partitions. Classification, Clustering and Data Analysis: recent advances and applications (pp. 75--79). Springer.
 
18
Hubert, L. J., & Arabie, P. (1985). Comparing partitions. journal of classification, 2, 193--218.
 
19
Hubert, L. J., & Baker, F. B. (1978). Evaluating the conformity of sociometric measurements. Psychometrika, 43, 31--41.
 
20
 
21
Katz, L., & Powell, J. H. (1953). A proposed index of the conformity of one sociometric measurement to another. Psychometrika, 18, 249--256.
 
22
Kaufman, L., & Rousseeuw, P. J. (1990). Finding groups in data: An introduction to cluster analysis. John Wiley.
23
24
25
 
26
Li, T., Zhu, S., & Ogihara, M. (2003b). Algorithms for clustering high dimensional and distributed data. Intelligent Data Analysis Journal, 7. 305--326.
 
27
Messatfa, H. (1992). An algorithm to maximize the agreement. Journal of Classification, 9, 5--15.
 
28
 
29
 
30
 
31
 
32
P.W. Ellis, D., Whitman, B., Berenzweig, A., & Lawrence, S. (2002). The quest for ground truth in musical artist similarity. Proceedings of 3rd International Conference on Music Information Retrieval (pp. 170--177).
 
33
Rosenberg, S., & Kim, M. P. (1975). The method of sorting as a data gathering procedure in multivariate research. Multivariate Behavioral Research, 10, 489--502.
 
34
 
35
 
36
Tweedie, F. J., & Baayen, R. H. (1998). How variable may a constant be? Measure of lexical richness in perspective. Computers and the Humanities, 32, 323--352.
 
37
Tzanetakis, G., & Cook, P. (2002). Musical genre classification of audio signals. IEEE Transactions on Speech and Audio Processing, 10.
 
38
Vichi, M. (1999). One-mode classification of a three-way data matrix. journal of classification, 16, 27--44.
 
39
Zhao, Y., & Karypis, G. (2001). Criterion functions for document clustering: Experiments and analysis (Technical Report). Department of Computer Science, University of Minnesota.

Collaborative Colleagues:
Tao Li: colleagues
Mitsunori Ogihara: colleagues
Sheng Ma: colleagues