Clustering by weighted cuts in directed graphs

Proceedings of the 7th SIAM International Conference on Data Mining

Volumn , Issue , 2007, Pages 135-144

  Meila, Marina ^a   Pentney, William ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DATA MINING;

NORMALIZED CUTS; OPTIMIZATION PROBLEMS; RAYLEIGH QUOTIENTS; SPECTRAL CLUSTERING; SYMMETRIC MATRICES;

DIRECTED GRAPHS;

EID: 70449095774     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972771.13     Document Type: Conference Paper

References (21)

1. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems,30(l-7):107-117, 1998.
2. M. Craven, D. DiPasquo, D. Preitag, A. McCallum, T. Mitchell, K. Nigam, and S. Slattery. Learning to extract knowledge from the world wide web. In Pro ceedings of the 15th National Conference on Artificial Intelligence (AAAI-98),1998.
3. J. Huang, T. Zhu, and D. Schuurmans. Web commu nities identification from random walks. In Joint Eu ropean Conference on Machine Learning and European Conference on Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD-06),2006.
4. M. Meila and L. Xu. Multiway cuts and spectral clus tering. Technical Report 442, University of Washington, May 2003.
5. M. Meila. The multicut lemma. Technical Report 417, University of Washington, 2002.
6. M. Meila. Comparing clusterings by the variation of information. In M. Warmuth and B. Scholkopf, editors, Proceedings of the Sixteenth Annual Conference ofn Computational Learning Theory (COLT),volume 16. Springer, 2003.
7. M. Meila and J. Shi. A random walks view of spectral segmentation. In T. Jaakkola and T. Richardson, editors, Artificial Intelligence and Statistics AISTATS,2001.
8. W. Pentney and M. Meila. Spectral clustering of bio logical sequence data. In M. Veloso and S. Kambham-pati, editors, Proceedings of Twentieth National Con ference on Artificial Intelligence (AAAI-05),2005.
9. Structural classification of proteins database. http://scop.berkeley.edu.
10. J. Shi and J. Malik. Normalized cuts and image segmentation. PAMI,2000.
11. J. Shi and J. Malik. Normalized cuts and image segmentation. PAMI,2000.
12. T. Smith and M. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology,147:195-197, 1981.
13. G. W. Stewart and J.-g. Sun. Matrix perturbation theory.Academic Press, San Diego, CA, 1990.
14. J. B. Tenenbaum, V. D. Silva, and J. C. Langford. A global geometric framework for nonlinear dimensional ity reduction. Science,290(5500): 2319-2323, 2000.
15. L. Trefethen and M. Embree. Spectra and Pseudospec-tra: The Behavior of Non-Normal Matrices and Opera tors.Princeton University Press, Princeton, NJ, 2005.
16. D. Verma and M. Meila. A comparison of spectral clustering algorithms. TR 03-05-01, University of Washington, May 2003. (sumitted).
17. U. von Luxburg, O. Bousquet, and M. Belkin. Limits of spectral clustering. In L. K. Saul, Y. Weiss, and L. Bottou, editors, Advances in Neural Information Processing Systems,number 17. MIT Press, 2005.
18. S. X. Yu and J. Shi. Multiclass spectral clustering. In International Conference on Computer Vision,2003.
19. D. Zhou, J. Huang, and B. Scholkopf. Learning from labeled and unlabeled data on a directed graph, pages 1041-1048, 2005.
20. D. Zhou, J. Huang, and B. Scholkopf. Learning from labeled and unlabeled data on a directed graph, pages 1041-1048, 2005.
21. D. Zhou, B. Scholkopf, and T. Hofmann. Semi-supervised learning on directed graphs. In L. K. Saul, Y. Weiss, and L. Bottou, editors, Advances in Neural Information Processing Systems,number 17. MIT Press, 2005.