Sciweavers

29 search results - page 4 / 6
» Mining Large Networks with Subgraph Counting
Sort
View
KDD
2012
ACM
242views Data Mining» more  KDD 2012»
11 years 10 months ago
Query-driven discovery of semantically similar substructures in heterogeneous networks
Heterogeneous information networks that contain multiple types of objects and links are ubiquitous in the real world, such as bibliographic networks, cyber-physical networks, and ...
Xiao Yu, Yizhou Sun, Peixiang Zhao, Jiawei Han
IJMMS
2007
166views more  IJMMS 2007»
13 years 8 months ago
Visualization of large networks with min-cut plots, A-plots and R-MAT
What does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph? The answer to such questions is vital f...
Deepayan Chakrabarti, Christos Faloutsos, Yiping Z...
CIKM
2010
Springer
13 years 3 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
CIKM
2009
Springer
14 years 2 months ago
A query language for analyzing networks
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
Anton Dries, Siegfried Nijssen, Luc De Raedt
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 8 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...