Publications Related to Pattern discovery
-
Finding Frequent Patterns in a Large Sparse Graph.
Michihiro Kuramochi and George Karypis. Data Mining and Knowledge Discovery, 11(3): 243-271, 2005.
-
HARMONY: Efficiently Mining the Best Rules for Classification.
Jianyong Wang and George Karypis. SIAM International Conference on Data Mining, pp. 205--216, 2005.
-
GREW: A Scalable Frequent Subgraph Discovery Algorithm.
Michihiro Kuramochi and George Karypis. 4th IEEE Conference on Data Mining (ICDM), pp. 439-442, 2004.
-
SUMMARY: Efficient Summarizing Transactions for Clustering.
Jianyong Wang and George Karypis. 4th IEEE Conference on Data Mining (ICDM), pp. 241-248, 2004.
-
Efficient Closed Pattern Mining in the Presence of Tough Block Constraints.
Krishna Gade, Jianyong Wang, and George Karypis. 10th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), 2004.
-
BAMBOO: Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint.
Jianyong Wang and George Karypis. SIAM International Conference on Data Mining, 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.
-
Parallel Formulations of a Tree-Projection Based Sequence Discovery Algorithm.
Valerie Guralnik and George Karypis. Parallel Computing 30(4): 443-472, 2004.
-
Discovering Frequent Geometric Subgraphs.
Michihiro Kuramochi and George Karypis. 2nd IEEE Conference on Data Mining (ICDM), pp. 258 - 265, 2002.
|
|