Sciweavers

243 search results - page 31 / 49
» Scalable mining of large disk-based graph databases
Sort
View
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
14 years 8 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 11 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 3 days ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou
CPHYSICS
2006
124views more  CPHYSICS 2006»
13 years 7 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
KDD
2012
ACM
185views Data Mining» more  KDD 2012»
11 years 10 months ago
A framework for summarizing and analyzing twitter feeds
The firehose of data generated by users on social networking and microblogging sites such as Facebook and Twitter is enormous. Real-time analytics on such data is challenging wit...
Xintian Yang, Amol Ghoting, Yiye Ruan, Srinivasan ...