164 search results - page 10 / 33 » Finding Frequent Patterns in a Large Sparse Graph |
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
PVLDB
2008
14 years 9 months ago
2008
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
SSDBM
2010
IEEE
14 years 7 months ago
2010
IEEE
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...