Sciweavers

Share
164 search results - page 1 / 33
» Finding Frequent Patterns in a Large Sparse Graph
Sort
View
IPPS
2007
IEEE
12 years 8 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
12 years 3 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
13 years 3 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
CORR
2010
Springer
112views Education» more  CORR 2010»
12 years 1 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
DASFAA
2005
IEEE
133views Database» more  DASFAA 2005»
12 years 7 months ago
Mining Frequent Tree-Like Patterns in Large Datasets
In this paper, we propose a novel data mining scheme to explore the frequent hierarchical structure patterns, named tree-like patterns, with the relationship of each item on a sequ...
Tzung-Shi Chen, Shih-Chun Hsu
books