A min-max cult algorithm for graph partitioning and data clustering

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2001, Pages 107-114

  Ding, Chris H Q ^a   He, Xiaofeng ^a,b   Zha, Hongyuan ^b   Gu, Ming ^a   Simon, Horst D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (24)

1. P.K. Agarwal and C.M. Procopiuc. Exact and approximation algorithms for clustering. Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, pages 658-667, 1998.
2. D. Boley. Principal direction divisive partitioning. Data mining and knowledge discovery, 2:325-344, 1998.
3. B. Bollobas. Random Graphs. Academic Press, 1985.
4. C.-K. Cheng and Y.A. Wei. An improved two-way partitioning algorithm with stable performance. IEEE. Trans. on Computed Aided Desgin, 10:1502-1511, 1991.
5. F.R.K. Chung. Spectral Graph Theory. Amer. Math. Society, 1997.
6. C. Ding, X. He, and H. Zha. A spectral method to separate disconnected and nearly-disconnected web graph components. Proc. 7th ACM Int'l Conf Knowledge Discovery and Data Mining (KDD 2001), pages 275-280, August 2001.
7. S. Doddi, M.V. Marathe, S. S. Ravi, D. S. Taylor, and P. Widmayer. Approximation algorithms for clustering to minimize the sum of diameters. Nordic Journal of Computing, 7(3):185, Fall 2000, Fall 2000.
8. W.E. Donath and A. J. Hoffman. Lower bounds for partitioning of graphs. IBM J. Res. Develop., 17:420-425, 1973.
9. R. V. Driessche and D. Roose. An improved spectral bisection algorithm and its application to dynamic load balancing. Parallel Computing, 21, 1995.
10. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering in large graphs and matrices. In Proc. 19th ACM-SIAM Symposium on Discrete Algorithms, 1939.
11. M. Fiedler. Algebraic connectivity of graphs. Czech. Math. J., 23:298-305, 1973.
12. M. Fiedler. A property of eigenvectors of no-negative symmetric matrices and its application to graph theory. Czech. Math. J., 25:619-633, 1975.
13. S. Guattery and G. L. Miller. On the quality of spectral separators. SIAM Journal of Matrix Anal. Appl., 19(3), 1998.
14. L. Hagen and A.B. Kahng. New spectral methods for ratio cut partitioning and clustering. IEEE. Trans. on Computed Aided Desgin, 11:1074-1085, 1992. (Pubitemid 23555831)
15. X. He, H. Zha, C. Ding, and H.D. Simon. Web document clustering using hyperlink structures. Tech Report CSE-01-006, April 2001.
16. B. Hendrickson and R. Leland. Chaco mesh partitioning software. http://www.cs.sandia.gov/CRF/chac.html.
17. G. Karypis and V. Kumar. Metis graph partitioning software. http://www-users.cs.umn.edu/karypis/metis/.
18. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Tech. J., 1970.
19. A. McCallum. Bow: A toolkit for statistical language modeling, text retrieval, classification and clustering. http://www.cs.cmu.edu/mccallum/bow, 1996.
20. B. N. Parlett. The Symmetric Eigenvalue Problem. SIAM Press, 1998.
21. A. Pothen, H. D. Simon, and K. P. Liou. Partitioning sparse matrices with egenvectors of graph. SIAM Journal of Matrix Anal. Appl., 11:430-452, 1990.
22. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE. Trans. on Pattern Analysis and Machine Intelligence, 2000.
23. D.A. Spielman and S.-H. Teng. Spectral partitioning works: Planar graphs and finite element meshes. Proc. 37th IEEE Conference on Foundations of Computer Science,, 1996.
24. H. Zha, X. He, C. Ding, M. Gu, and H.D. Simon. Bipartite graph partitioning and data clustering. Proc. 10th Int'l Conf. Information and Knowledge Management (CIKM 2001), Nov. 2001.