David Gibson Ravi Kumar Andrew Tomkins IBM Almaden Research Center 650 Harry...  Home/Search
Context Related
| vldb2005.org/program/...p721gibson.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: vldb2005.org/program/paper/thu... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extremely e#cient, capable of handling graphs with tens of billions of edges on a single machine with modest resources. (Update)
Cited by: More
Link-Based Characterization and Detection of Web Spam - Becchetti, Castillo.. (2006) (Correct)
Using Rank Propagation and Probabilistic Counting.. - Becchetti.. (2006) (Correct)
Active bibliography (related documents): More All
0.6: Classification Techniques for Categorization of Hypertext Documents - Arumugam (Correct)
0.6: Automated Modeling and Nonlinear Axis Scaling - Leejay Wu (2005) (Correct)
0.5: Graph Domination, Coloring and Cliques in Telecommunications - Balasundaram, Butenko (Correct)
Similar documents based on text:
5.0: Unknown - (Correct)
Related documents from co-citation: More All
3: Combating web spam with trustrank (context) - Gyongyi, Garcia-Molina et al. - 2004
2: and statistics: using statistical analysis to locate spam web pages (context) - Fetterly, Manasse et al. - 2004
2: Making eigenvector-based reputation systems robust to collusion (context) - Zhang, Goel et al. - 2004
BibTeX entry: (Update)
D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB '05: Proceedings of the 31st international conference on Very large data bases, pages 721--732. VLDB Endowment, 2005. http://citeseer.ist.psu.edu/gibson05discovering.html More
@misc{ gibson05discovering,
author = "D. Gibson and R. Kumar and A. Tomkins",
title = "Discovering large dense subgraphs in massive graphs",
text = "D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs
in massive graphs. In VLDB '05: Proceedings of the 31st international conference
on Very large data bases, pages 721--732. VLDB Endowment, 2005.",
year = "2005",
url = "citeseer.ist.psu.edu/gibson05discovering.html" }
Citations (may not include all citations):387 The space complexity of approximating the frequency moments - Alon, Matias et al. - 1999
208 Fast algorithms for mining association rules in large databa.. (context) - Agrawal, Srikant - 1994
140 Graph structure in the web (context) - Broder, Kumar et al. - 2000
136 Syntactic clustering of the web (context) - Broder, Glassman et al. - 1997
114 Silk from a sow's ear: Extracting usable structures from the.. - Pirolli, Pitkow et al. - 1996
106 Trawling the Web for emerging cyber-communities - Kumar, Raghavan et al. - 1999
68 Min-wise independent permutations - Broder, Charikar et al. - 2000
62 Extracting large scale knowledge bases from the web - Kumar, Raghavan et al. - 1999
61 Mining the Web: Discovering Knowledge from Hypertext Data (context) - Chakrabarti - 2002
31 Semtag and seeker: Bootstrapping the semantic web via automa.. - Dill, Eiron et al. - 2003
30 Identifying aggregates in hypertext structures - Botafogo, Schneiderman - 1991
30 Computing on data streams - Henzinger, Raghavan et al. - 1999
19 A comparison of techniques to find mirrored hosts on the WWW - Bharat, Broder et al. - 2000
16 Who links to whom: Mining linkage between web sites - Bharat, Chang et al. - 2001
15 Challenges in web search engines - Henzinger, Motwani et al. - 2003
14 and statistics: Using statistical analysis to locate spam we.. (context) - Fetterly, Manasse et al. - 2004
11 the bursty evolution of blogspace - Kumar, Novak et al. - 2003
10 cient identification of web communities (context) - Flake, Lawrence et al. - 2000
9 subgraph problem (context) - Feige, Peleg et al. - 2001
3 How to build a webfountain: An architecture for very large-s.. (context) - Gruhl, Chavet et al. - 2004
2 Massive quasi-clique detection - Abello, Resende et al. - 2002
1 Surfing the web by site - Gibson - 2004
1 the streaming model augmented with a sorting primitive (context) - Aggarwal, Datar et al. - 2004
1 The site browser: Catalyzing improvements in hypertext organ.. (context) - Gibson - 2004
1 A graph-theoretic approach to extract storylines from search.. (context) - Kumar, Mahadevan et al. - 2004
Documents on the same site (http://www.vldb2005.org/program/paper/thu/): More
Shuffling a Stacked Deck: The Case for Partially.. - Pandey, Roy, Olston, al. (2005) (Correct)
REED: Robust, Efficient Filtering and Event Detection - In Sensor Networks (2005) (Correct)
Parallel Execution of Test Runs for Database Application.. - Haftmann, Kossmann, Lo (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC