Sciweavers

Share
2 search results - page 1 / 1
» Closing the Loop: Fast, Interactive Semi-Supervised Annotati...
Sort
View
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
12 years 2 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...
books