Publications Related to Graph mining
-
Out-of-Core Coherent Closed Quasi-Clique Mining from Large Dense Graph Databases.
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, and George Karypis.  ACM Transactions on Database Systems, Vol 32, Issue 2, 2007.
-
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph.
Steve Reinhardt and George Karypis.  12th International Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS'07), 2007.
-
Coherent Closed Quasi-Clique Discovery from Large Dense Graph Databases.
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, and George Karypis.  12th International Conference on Knowledge and Data Discovery (KDD), 2006.
-
Finding Frequent Patterns in a Large Sparse Graph.
Michihiro Kuramochi and George Karypis.  Data Mining and Knowledge Discovery, 11(3): 243-271, 2005.
-
GREW: A Scalable Frequent Subgraph Discovery Algorithm.
Michihiro Kuramochi and George Karypis.  4th IEEE Conference on Data Mining (ICDM), pp. 439-442, 2004.
-
Finding Frequent Patterns in a Large Sparse Graph.
Michihiro Kuramochi and George Karypis.  SIAM International Conference on Data Mining, 2004.
-
An Efficient Algorithm for Discovering Frequent Subgraphs.
Michihiro Kuramochi and George Karypis.  IEEE Trans. Knowl. Data Eng. 16(9): 1038-1051, 2004.
-
Discovering Frequent Geometric Subgraphs.
Michihiro Kuramochi and George Karypis.  2nd IEEE Conference on Data Mining (ICDM), pp. 258 - 265, 2002.
-
Frequent Subgraph Discovery.
Michihiro Kuramochi and George Karypis.  1st IEEE Conference on Data Mining, pp. 313-320, 2001.
|
|