A spectral clustering approach to finding communities in graphs

Proceedings of the 2005 SIAM International Conference on Data Mining, SDM 2005

Volumn , Issue , 2005, Pages 274-285

  White, Scott ^a   Smyth, Padhraic ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; GRAPH THEORY; SPACE DIVISION MULTIPLE ACCESS;

AUTOMATIC SELECTION; NUMBER OF CLUSTERS; OBJECTIVE FUNCTIONS; REAL-WORLD GRAPHS; SPECTRAL ALGORITHM; SPECTRAL CLUSTERING; SPECTRAL CLUSTERING ALGORITHMS; SPECTRAL RELAXATIONS;

CLUSTERING ALGORITHMS;

EID: 84880106426     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972757.25     Document Type: Conference Paper

References (14)

1. C. Alpert and S. Yao, Spectral partitioning: the more eigenvectors the better. In Proceedings of 32nd ACM/IEEE Design Automation Conference, 1995, pp. 195-200.
2. Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. Vorst, eds., Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, Philadelphia, 2000.
3. M. Brand and K. Huang. A unifying theorem for spectral embedding and clustering. 9th International Conference on Artificial Intelligence and Statistics, 2002.
4. F. Chung. Spectral graph theory. Number 92 in CBMS Regional Conference Series in Mathematics. American Mathematical Society, 1997.
5. C. Elkan. Using the triangle inequality to accelerate k-Means. In Proceedings of the Twentieth International Conference on Machine Learning, 2003, pp. 147-153.
6. M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23 (1973), pp. 298-305.
7. K. Hall. An r-dimensional quadratic placement algorithm. Management Science, 11(3)(1970), pp. 219-229.
8. G. Miller. WordNet: An on-line lexical database. International Journal of Lexicography, 3 (1990), pp. 235-312.
9. M. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69, 026113 (2004).
10. M. Newman. Fast algorithm for detecting community structure in networks. Physical Review E, 69, 066133 (2004).
11. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: analysis and an algorithm. In Advances in Neural Information Processing Systems 14, 2002, pp. 849-856.
12. J. Shi and J. Malik. Normalized cuts and image segmentation. In IEEE Transactions on Pattern Analysis and Machine Intelligence, 22 (2000), pp. 888-905.
13. S. White and P. Smyth. Algorithms for discovering relative importance in graphs. In Proceedings of Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003, pp. 266-275.
14. Y. Weiss. Segmentation using eigenvectors: A unifying view. In Proceedings OF IEEE International Conference on Computer Vision, 1999, pp. 975-982.