2503 search results - page 85 / 501 » A study of 3-arc graphs |
159
Voted
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
158
Voted
RSA
2010
15 years 4 months ago
2010
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
194
click to vote
DASFAA
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...
166
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Defect localisation is essential in software engineering and is an important task in domain-specific data mining. Existing techniques building on call-graph mining can localise dif...
190
click to vote
DIALM
2008
ACM
15 years 7 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...