Sciweavers

731 search results - page 55 / 147
» Taxonomy-superimposed graph mining
Sort
View
SAC
2004
ACM
14 years 3 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
PAKDD
2004
ACM
183views Data Mining» more  PAKDD 2004»
14 years 3 months ago
Constraint-Based Graph Clustering through Node Sequencing and Partitioning
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
Yu Qian, Kang Zhang, Wei Lai
KDD
2010
ACM
263views Data Mining» more  KDD 2010»
14 years 1 months ago
Social action tracking via noise tolerant time-varying factor graphs
Users’ behaviors (actions) in a social network are influenced by various factors such as personal interests, social influence, and global trends. However, few publications sys...
Chenhao Tan, Jie Tang, Jimeng Sun, Quan Lin, Fengj...
SDM
2008
SIAM
120views Data Mining» more  SDM 2008»
13 years 11 months ago
Spatial Scan Statistics for Graph Clustering
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected ed...
Bei Wang, Jeff M. Phillips, Robert Schreiber, Denn...
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 4 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