A spectral method to separate disconnected and nearly-disconnected Web graph components

Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2001, Pages 275-280

  Ding, Chris H Q ^a   He, Xiaofeng ^b   Zha, Hongyuan ^b  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; GRAPHIC METHODS; ITERATIVE METHODS; LAPLACE TRANSFORMS; MATRIX ALGEBRA; PERTURBATION TECHNIQUES; PROBLEM SOLVING; THEOREM PROVING;

GRAPH STRUCTURES;

WORLD WIDE WEB;

EID: 0035788930     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/502512.502551     Document Type: Conference Paper

References (29)

1. B. Awerbuch and Y. Shiloach. New connectivity and msf algorithms for shuffle-exchange network and pram. IEEE. Trans. on Computers, pages 1258-1263, 1987.
2. K. Bharat and M. R. Henzinger. Improved algorithms for topic distillation in a hyperlinked environment. ACM Conf. on Research and Development in Information Retrieval (SIGIR'98), 1998.
3. N. Biggs. Algebraic Graph Theory. Cambridge Univ. Press, 1974.
4. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web. Proc. 9th International World Wide Web Conference, 2000.
5. S. Chakrabarti, B. E. Dom, and J. M. Kleinberg. Mining the link structure of the world wide web. Feb 1999.
6. 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.
7. F.R.K. Chung. Spectral Graph Theory. Amer. Math. Society., 1997.
8. T.H. Cormen, C.E. Leiserson, and R. L. Rives. Introduction to Algorithms. MIT Press, 1990.
9. C. Ding, X. He, H. Zha, M. Gu, and H. Simon. Spectral min-max cut for graph partitioning and data clustering. Lawrence Berkeley Nat'l Lab Tech report 47848, May 2001.
10. W.E. Donath and A. J. Hoffman. Lower bounds for partitioning of graphs. IBM J. Res. Develop., 17:420-425, 1973.
11. M. Fiedler. Algebraic connectivity of graphs. Czech. Math. J., 23:298-305, 1973.
12. M. Fiedler. A property of eigenvectors of non-negative symmetric matrices and its application to graph theory. Czech. Math. J., 25:619-633, 1975.
13. G. W. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. Proc. Int'l Conf. Knowledge Kiscovery and Data Mining (KDD), pages 150-159, 2000.
14. H. Gazit. An optimal randomized parallel algorithm for finding connected components. SIAM J. Computing., 20:1046-1067, 1991.
15. J. Griener. A comparison of data-parallel algorithms for connected components. Proc. ACM Symp. Para. Algo. Arch., pages 16-25, 1994.
16. 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.
17. X. He, H. Zha, C. Ding, and H.D. Simon. Web document clustering using hyperlink structures. Tech Report CSE-01-006, April 2001.
18. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 48:604-632, 1999.
19. R. R. Larson. Bibliometrics of the world wide web: an exploratory analysis of the intellectual structures of cyberspace. Proc. SIGIR'96, 1996.
20. Y. Li. Towards a qualitative search engine. IEEE Internet Computing, July-August 1998.
21. J. Mathews and R.L. Walker. Mathematical Methods of Physics. Addison-Wesley, 1971.
22. L. Page. Pagerank: bring order to the web. Stanford Digital Library working paper 1997-0072, 1997.
23. B. N. Parlett. The Symmetric Eigenvalue Problem. SIAM Press, 1998.
24. P. Pirolli, J. Pitkow, and R. Rao. Silk from a sow's ear: Extracting usable structures from the web. Proc. SIGCHI'96, 1996.
25. 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.
26. L.I. Schiff. Quantum Mechanics, 3rd ed. McGraw-Hill, 1968.
27. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE. Trans. on Pattern Analysis and Machine Intelligence, 2000.
28. Y. Shiloach and U. Vishkin. An o(log n) parallel connectivity algorithm. J. Algorithm, pages 57-67, 1982.
29. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Computing., 1:146-160. 1972.