A new approach to data driven clustering

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 57-64

  Azran, Arik ^a   Ghahramani, Zoubin ^b  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; STATISTICAL METHODS;

DATA DRIVEN CLUSTERING; DATA SPACE; MARKOV RANDOM WALK; STATISTICAL MODEL; TRANSITION PROBABILITY MATRIX;

DATA REDUCTION;

EID: 34250785690     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143852     Document Type: Conference Paper

References (7)

1. Jain, A. K., Murty, M. N., & Flynn, P. J. (1999). Data clustering: a review. ACM Computing Surveys, 31, 264-323.
2. Kannan, R., Vempala, S., &: Vetta, A. (2000). On Clustering: Good, Bad and Spectral. Proceedings of the 41st Annual Symposium on the Foundation of Computer Science.
3. Meila, M., & Shi, J. (2001). A random walks view of spectral segmentation. Tenth International Workshop on Artificial Intelligence and Statistics (AISTATS).
4. Ng, A. J., Jordan, M. I., & Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems (NIPS), 14.
5. Shi, J., & Malik, J. (2000). Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence.
6. Spielman, D., & Teng, S. (2004). Nearly linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. 36th Annual ACM Symposium on Theory of Computing (pp. 81-90).
7. Tishby, N., & Slonim, N. (2000). Data clustering by markovian relaxation and the information bottleneck method. NIPS (pp. 640-646).