Gary William Flake
- 1.Inktomi Corporation. Inktomi webmap press release. http://www.inktomi.com/webmap/, January 2000.Google Scholar
- 2.Steve Lawrence and C. Lee Giles. Accessibility of information on the web. Nature, 400(6740):107-109, 1999.Google ScholarCross Ref
- 3.John Scott. Social network analysis: a handbook. SAGE Publications, 1991.Google Scholar
- 4.E. Garfield. Citation Indexing: Its Theory and Application in Science. Wiley, NewYork, 1979.Google Scholar
- 5.H.D. White and K.W. McCain. Bibliometrics. In Ann. Rev. Info. Sci. and Technology, pages 119-186. Elsevier, 1989.Google Scholar
- 6.H. Small. Co-citation in the scientific literature: A new measure of the relationship between two documents. J. Am. Soc. for Inf. Sci., 24(4):265-269, 1973.Google ScholarCross Ref
- 7.M. Kessler. Bibliographic coupling between scientific papers. American Documentation, 14:10-25, 1963.Google ScholarCross Ref
- 8.R. Larson. Bibliometrics of the world wide web: An exploratory analysis of the intellectual structure of cyberspace. In Ann. Meeting of the American Soc. Info. Sci. 1996.Google Scholar
- 9.S. Selim and M. Ismail. K-Means-type algorithms: a generalized convergence theorem and characterization of local optimality. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(1):81-87, 1984.Google ScholarDigital Library
- 10.A. Popescul, G. W. Flake, S. Lawrence, L. Ungar, and C. L. Giles. Clustering and identifying temporal trends in document databases. In Proc. IEEE Advances in Digital Libraries 2000, 2000. To appear. Google ScholarDigital Library
- 11.Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 668-677, 1998. Google ScholarDigital Library
- 12.L. Page. PageRank: bringing order to the web. Stanford Digital Libraries working paper 1997-0072., 1997.Google Scholar
- 13.D. Gibson, J. Kleinberg, and P. Raghavan. Inferring web communities from link topology. InProc. 9th ACM Conference on Hypertext and Hypermedia, 1998. Google ScholarDigital Library
- 14.M. R. Garey and D. S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H.Freeman, New York, 1979. Google ScholarDigital Library
- 15.C. Chekuri, A. Goldberg, D. Karger, M. Levine, and C. Stein. Experimental study of minimum cut algorithms. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'97), pages 324-333, New Orleans, 1997. Google ScholarDigital Library
- 16.L. R. Ford Jr. and D. R. Fulkerson. Maximal ow through a network. Canadian J. Math., 8:399-404, 1956.Google ScholarCross Ref
- 17.T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. MIT Press and McGraw-Hill Book Company, 6th edition, 1992. Google ScholarDigital Library
- 18.Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows : Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993. Google ScholarDigital Library
- 19.J. Edmonds and R. M. Karp. Theoretical improvements in the algorithmic efficiency for network ow problems. JACM, 19:248-264, 1972. Google ScholarDigital Library
- 20.R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the world wide web. Nature, 401, 1999.Google Scholar
- 21.S. Chakrabarti, M. van der Berg, and B. Dom. Focused crawling: a new approach to topic-specific web resource discovery. InProceedings of 8th International World Wide Web Conference (WWW8), 1999. Google ScholarDigital Library
- 22.Z. Wu and R. Leahy. An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. PAMI, 15(11):1101-1113, November 1993. Google ScholarDigital Library
- 23.A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. R. Statist. Soc. B, 39:185-197, 1977.Google Scholar
- 24.S. Macskassy, A. Banerjee, B. Davison, and H. Hirsh. Human performance on clustering web pages: A preliminary study. InProceedings of The Fourth International Conference onKnowledge Discovery and Data Mining (KDD-98), 1998.Google Scholar
- 25.Andrew V. Goldberg and Robert E. Tarjan. A new approach to themaximum ow problem. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 136-146, Berkeley, California, 28-30 May 1986. Google ScholarDigital Library
Index Terms
- Efficient identification of Web communities
Recommendations
Self-Organization and Identification of Web Communities
Millions of individuals operating independently author the Web's information. Despite its decentralized nature, the authors' work shows that the Web self-organizes and its link structure allows efficient identification of communities. This is ...
Identification of Web Communities through Link Based Approaches
ICIME '09: Proceedings of the 2009 International Conference on Information Management and EngineeringWWW has grown rapidly in recent years which has enabled us to obtain much information on various fields. At the same time it is becoming difficult to obtain really relevant web pages on a specific topic. Therefore it becomes very important today to ...
Creating a Web community chart for navigating related communities
HYPERTEXT '01: Proceedings of the 12th ACM conference on Hypertext and HypermediaRecent research on link analysis has shown the existence of numerous web communities on the Web. A web community is a collection of web pages created by individuals or any kind of associations that have a common interest on a specific topic. In this ...
Comments