A new mallows distance based metric for comparing clusterings

ICML 2005 - Proceedings of the 22nd International Conference on Machine Learning

Volumn , Issue , 2005, Pages 1033-1040

  Zhou, Ding ^a   Li, Jia ^b   Zha, Hongyuan ^a  

^a The Pennsylvania State University   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMAL SYSTEMS; PROBABILITY; SYSTEMS ANALYSIS;

CLUSTERINGS; DISTANCE BASED METRIC; TRIANGLE INEQUALITY;

LEARNING SYSTEMS;

EID: 31844437822     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. A. Ben-Hur, A. Elisseeff and I. Guyon, A stability based method for discovering structure in clustered data, In Pacific Symposium on Biocomputing, pages 6-17, 2002.
2. A. Dempster, N. Laird, and D. Rubin, Maximum likelihood from incomplete data via the EM algorithm, Journal of the Royal Statistical Society, Series B, 39(1):138,1977.
3. S. Dongen, Performance criteria for graph clustering and Markov cluster experiments, Technical Report INSR0012, Centrum voor Wiskundeen Informatica, 2000.
4. M. Ester, H.P. Kriegel, J. Sander and X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, In proceedings of the KDD, 1996.
5. E.B.Fowlkes and C.L.Mallows, A method for comparing two hierarchical clusterings, Journal of the American Statistical Association, 78(383):553-569,1983.
6. L. Hubert and P. Arabie, Comparing partitions, Journal of Classification, 2:193-218, 1985.
7. E. Levina and P. Bickel, The Earth Mover's distance is the Mallows distance: some insights from statistics, In proceedings of IEEE International Conference on Computer Vision, Vol. 2, pages 251-256. Vancouver, BC, Canada, 2001.
8. C.L. Mallows, A note on asymptotic joint normality, Annals of Mathematical Statistics, 43(2): 508-515, 1972.
9. M. Meila, Comparing Clusterings, Technical Report, Statistics, University of Washington, 2002.
10. J.B. Orlin, A faster strongly polynomial minimim cost flow algorithm, Proc. 20th ACM Symposium on the Theory of Computing, 1988.
11. S.T. Rachev, The Monge-Kantorovich mass transference problem and its stochastic applications, Theory of Probability and its Applications, 29:647-676,1984.
12. W.M. Rand, Objective criteria for the evaluation of clustering methods, Journal of the American Statistical Association, 66:846-850, 1971.
13. C. Robardet and F. Feschet, A new methodology to compare clustering algorithms, In proceedings of the Second International Conference on Intelligent Data Engineering and Automated Learning, HK, China, 2000.
14. Y. Rubner, C. Tomasi and L.J. Guibas, A metric for distribution with applications to image databases, In proceedings of IEEE International Conference on Computer Vision, pages 59-66. Bombay, India, 1998.