Sciweavers

43 search results - page 1 / 9
» Dense Subgraph Extraction with Application to Community Dete...
Sort
View
TKDE
2012
250views Formal Methods» more  TKDE 2012»
11 years 6 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
WWW
2007
ACM
14 years 5 months ago
Extraction and classification of dense communities in the web
The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information and services, and there is a growing interest in tools for understandi...
Yon Dourisboure, Filippo Geraci, Marco Pellegrini
VLDB
2005
ACM
177views Database» more  VLDB 2005»
13 years 9 months ago
Discovering Large Dense Subgraphs in Massive Graphs
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 extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
CORR
2012
Springer
209views Education» more  CORR 2012»
12 years 2 days ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii
COMSWARE
2008
IEEE
13 years 6 months ago
Extracting dense communities from telecom call graphs
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea,...