Michihiro Kuramochi, George Karypis  Home/Search
Context Related
| umn.edu/~kuram/papers/fsg.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umn.edu/~kuram (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Over the years, frequent itemset discovery algorithms have been used to solve various interesting problems. As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of these domains. An alternate way of modeling the objects in these data sets, is to use a graph to model the database objects. Within that model, the problem of finding frequent patterns becomes that of... (Update)
Cited by: More
The semantics of frequent subgraphs: Mining and navigation.. - Berendt (2005) (Correct)
Frequent Subtree Mining - An Overview - Chi, Nijssen, al. (2001) (Correct)
Using and Learning Semantics in Frequent Subgraph Mining - Berendt (2005) (Correct)
Similar documents (at the sentence level):
68.8%: Frequent Subgraph Discovery - Kuramochi, Karypis (2001) (Correct)
25.9%: An Efficient Algorithm for Discovering Frequent Subgraphs - Kuramochi, Karypis (2002) (Correct)
10.2%: Discovering Frequent Geometric Subgraphs - Kuramochi, Karypis (2002) (Correct)
Active bibliography (related documents): More All
0.4: Finding Frequent Patterns in a Large Sparse Graph - Kuramochi, Karypis (2004) (Correct)
0.2: Frequent Sub-Structure-Based Approaches for.. - Deshpande, Kuramochi, .. (2003) (Correct)
0.2: A PCA Approach for Fast Retrieval of Structural Patterns in.. - Xu, King (Correct)
Similar documents based on text: More All
0.6: Automated Approaches for Classifying Structures - Deshpande, Kuramochi, Karypis (2002) (Correct)
0.5: SLPMiner: An Algorithm for Finding Frequent Sequential.. - Seno, Karypi (2002) (Correct)
0.5: Vectorization of Structure to Index Graph Databases - Srinivasa, Acharya, Agrawal, .. (2002) (Correct)
Related documents from co-citation: More All
43: An apriori-based algorithm for mining frequent substructures from graph data - Inokuchi, Washio et al. - 2000
36: gSpan: Graph-based substructure pattern mining - Yan, Han - 2002
20: Fast Algorithms for Mining Association Rules - Agrawal, Srikant - 1994
BibTeX entry: (Update)
M. Kuramochi and G. Karypis. Frequent subgraph discovery. In 1st IEEE Conference on Data Mining, 2001. http://citeseer.ist.psu.edu/kuramochi01frequent.html More
@inproceedings{ kuramochi01frequent,
author = "Michihiro Kuramochi and George Karypis",
title = "Frequent Subgraph Discovery",
booktitle = "{ICDM}",
pages = "313-320",
year = "2001",
url = "citeseer.ist.psu.edu/kuramochi01frequent.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
910 Fast algorithms for mining association rules - Agrawal, Srikant - 1994
340 Mining sequential patterns - Agrawal, Srikant - 1995
249 Mining frequent patterns without candidate generation - Han, Pei et al. - 2000
54 An apriori-based algorithm for mining frequent substructures.. - Inokuchi, Washio et al. - 2000
45 Finding frequent substructures in chemical compounds - Dehaspe, Toivonen et al. - 1998
40 Turbo-charging vertical mining of large databases - Shenoy, Haritsa et al. - 2000
34 The predictive toxicology evaluation challenge - Srinivasan, King et al. - 1997
31 An algorithm for subgraph isomorphism (context) - Ullman - 1976
27 Carcinogenesis predictions using ILP - Srinivasan, King et al. - 1997
24 Department of Computing Science - Fortin, isomorphism et al. - 1996
21 Fast mining of sequential patterns in very large databases - Zaki - 1997
19 CLIP: Concept learning from inference patterns (context) - Yoshida, Motoda - 1995
17 Scalable algorithms for association mining - Zaki - 2000
17 Substructure discovery in the SUBDUE system - Holder, Cook et al. - 1994
15 A tree projection algorithm for generation of large itemsets.. (context) - Agarwal, Aggarwal et al. - 1998
9 Applying the SUBDUE substructure discovery system to the che.. - Chittimoori, Holder et al. - 1999
9 cient algorithm for closed association rule mining (context) - Zaki, Hsiao et al. - 1999
6 The graph isomorph disease (context) - Read, Corneil - 1977
6 Intelligent retrieval of solid models - Cicirello - 1999
5 Comparisons of attributed graph matching algorithms for comp.. - Kalviainen, Oja - 1990
4 Content-based image retrieval with scale-spaced object trees - Dupplaw, Lewis - 2000
4 Unifying graph-matching problem with a practical solution - Chen, Yun - 1998
4 based algorithm for optimal graph matching applied to comput.. (context) - Piriyakumar, Levi et al. - 1998
1 Data organizatinon and access for e#cient data mining (context) - Dunkel, Soparkar - 1999
1 Fast vertical mining using di#sets (context) - Zaki, Gouda - 2001
http://oldwww.comlab.ox.ac.uk/oucl/groups/machlearn/PTE/
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.umn.edu/~kuram):
Gene Classification using Expression Profiles: A Feasibility.. - Kuramochi, Karypis (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC