An impossibility theorem for clustering

Advances in Neural Information Processing Systems

Volumn , Issue , 2003, Pages

  Kleinberg, Jon ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING TECHNIQUES; K-MEANS; K-MEDIAN; RESEARCH COMMUNITIES; TECHNICAL LEVELS; UNIFIED FRAMEWORK;

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

References (12)

1. M. Anderberg, Cluster Analysis for Applications, Academic Press, 1973.
2. K. Arrow, Social Choice and Individual Values, Wiley, New York, 1951.
3. M. Bern, D. Eppstein, "Approximation algorithms for geometric prolems," in Approximation Algorithms for NP-Hard Problems, (D. Hochbaum, Ed.), PWS Publishing, 1996.
4. R. Duda, P. Hart, D. Stork, Pattern Classification (2nd edition), Wiley, 2001.
5. P. Hansen, F. Roberts, "An impossibility result in axiomatic location theory," Mathematics of Operations Research 21(1996).
6. A. Jain, R. Dubes, Algorithms for Clustering Data, Prentice-Hall, 1981.
7. N. Jardine, R. Sibson, Mathematical Taxonomy Wiley, 1971.
8. A. Kalai, C. Papadimitriou, S. Vempala, A. Vetta, personal communication, June 2002.
9. P. Mirchandani, R. Francis, Discrete Location Theory, Wiley, 1990.
10. M. Osborne A. Rubinstein, A Course in Game Theory, MIT Press, 1994.
11. D. Pennock, E. Horvitz, C.L. Giles, "Social choice theory and recommender systems: Analysis of the axiomatic foundations of collaborative filtering," Proc. 17th AAAI, 2000.
12. J. Puzicha, T. Hofmann, J. Buhmann "A Theory of Proximity Based Clustering: Structure Detection by Optimization," Pattern Recognition, 33 (2000).