Complete list of publications
-
Soft Clustering Criterion Functions for Partitional Document Clustering.
Ying Zhao and George Karypis. 13th Conference of Information and Knowledge Management (CIKM), pp. 246-247, 2004.
-
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.
-
Finding Functionally Related Genes by Local and Global Analysis of MEDLINE Abstracts.
Sigve Nakken, Christopher Kauffman, and George Karypis. SIGIR04 Bio Workshop: Search and Discovery in Bioinformatics, 2004.
-
Item-Based Top-N Recommendation Algorithms.
Mukund Deshpande and George Karypis. ACM Transactions on Information Systems. Volume 22, Issue 1, pp. 143 - 177, 2004.
-
Multi-Resource Aware Partitioning Algorithms for FPGAs with Heterogeneous Resources.
Navaratnasothie Selvakkumaran, Abhishek Ranjan, Salil Raje, and George Karypis. 41st Design Automation Conference, pp. 741-746, 2004.
|
|