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.

Crossref

Google Scholar

[7]

M. Kessler. Bibliographic coupling between scientific papers. American Documentation, 14:10-25, 1963.

Crossref

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[16]

L. R. Ford Jr. and D. R. Fulkerson. Maximal ow through a network. Canadian J. Math., 8:399-404, 1956.

Crossref

Google Scholar

[17]

T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. MIT Press and McGraw-Hill Book Company, 6th edition, 1992.

Digital Library

Google Scholar

[18]

Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows : Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.

Digital Library

Google Scholar

[19]

J. Edmonds and R. M. Karp. Theoretical improvements in the algorithmic efficiency for network ow problems. JACM, 19:248-264, 1972.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

Cited By

View all

Zhao CAl-Bashabsheh AChan C(2024)Game Theoretic Clustering for Finding Strong CommunitiesEntropy10.3390/e2603026826:3(268)Online publication date: 18-Mar-2024
https://doi.org/10.3390/e26030268
Ferdowsi ADehghan Chenary M(2024)Gain and Pain in Graph Partitioning: Finding Accurate Communities in Complex NetworksAlgorithms10.3390/a1706022617:6(226)Online publication date: 23-May-2024
https://doi.org/10.3390/a17060226
Huang YGleich DVeldt NChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized MethodsProceedings of the ACM Web Conference 202410.1145/3589334.3645624(881-892)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645624
Show More Cited By

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 Engineering

WWW 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 Hypermedia

Recent 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

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

KDD '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining

August 2000

537 pages

ISBN:1581132336

DOI:10.1145/347090

Chairmen:
Raghu Ramakrishnan
Univ. of Wisconsin
,
Sal Stolfo
Columbia Univ., New York, NY
,
Roberto Bayardo
IBM Almaden Research Center, San Jose, CA
,
Ismail Parsa
Epsilon

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

KDD00

Sponsor:

KDD00: The Second Annual International Conference on Knowledge Discovery in Data

August 20 - 23, 2000

Massachusetts, Boston, USA

Acceptance Rates

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

534
Total Citations
View Citations
2,996
Total Downloads

Downloads (Last 12 months)198
Downloads (Last 6 weeks)23

Reflects downloads up to 19 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhao CAl-Bashabsheh AChan C(2024)Game Theoretic Clustering for Finding Strong CommunitiesEntropy10.3390/e2603026826:3(268)Online publication date: 18-Mar-2024
https://doi.org/10.3390/e26030268
Ferdowsi ADehghan Chenary M(2024)Gain and Pain in Graph Partitioning: Finding Accurate Communities in Complex NetworksAlgorithms10.3390/a1706022617:6(226)Online publication date: 23-May-2024
https://doi.org/10.3390/a17060226
Huang YGleich DVeldt NChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized MethodsProceedings of the ACM Web Conference 202410.1145/3589334.3645624(881-892)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645624
Chen QChen NShuai WWu GXu ZTong HCao N(2024)Calliope-Net: Automatic Generation of Graph Data Facts via Annotated Node-Link DiagramsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.332692530:1(562-572)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1109/TVCG.2023.3326925
Arapoglu OCabuk UDagdeviren OChallenger M(2024)ACapDS: An Energy-Efficient and Fault-Tolerant Distributed Capacitated Dominating Set Algorithm for Industrial IoTIEEE Access10.1109/ACCESS.2024.337440912(38816-38829)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3374409
Nagahata YKobayashi MToda MMaeda STaketsugu TKomatsuzaki T(2024)An encompassed representation of timescale hierarchies in first-order reaction networkProceedings of the National Academy of Sciences10.1073/pnas.2317781121121:21Online publication date: 17-May-2024
https://doi.org/10.1073/pnas.2317781121
Yu W(2024)Community detection for networks based on Monte Carlo type algorithmsJournal of the Korean Statistical Society10.1007/s42952-024-00287-yOnline publication date: 26-Aug-2024
https://doi.org/10.1007/s42952-024-00287-y
Wang SWang PWu BZhu YLuo WPan Y(2024)Structural entropy minimization combining graph representation for money laundering identificationInternational Journal of Machine Learning and Cybernetics10.1007/s13042-024-02129-z15:9(3951-3968)Online publication date: 10-Apr-2024
https://doi.org/10.1007/s13042-024-02129-z
Aslan MKoç İ(2024)Modified Coot bird optimization algorithm for solving community detection problem in social networksNeural Computing and Applications10.1007/s00521-024-09567-436:10(5595-5619)Online publication date: 7-Feb-2024
https://doi.org/10.1007/s00521-024-09567-4
Huang YSeshadhri CGleich DKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)Theoretical bounds on the network community profile from low-rank semi-definite programmingProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3618976(13976-13992)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3618976
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Self-Organization and Identification of Web Communities

Identification of Web Communities through Link Based Approaches

Creating a Web community chart for navigating related communities