Sciweavers

2227 search results - page 16 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
16 years 2 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
15 years 2 months ago
Metric forensics: a multi-level approach for mining volatile graphs
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...
110
Voted
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 28 days ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
121
Voted
SC
2003
ACM
15 years 5 months ago
Traffic-based Load Balance for Scalable Network Emulation
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...
Xin Liu, Andrew A. Chien
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 6 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan