Michihiro Kuramochi, George Karypis  Home/Search
Context Related
| umn.edu/~karypis/publicati...sigram.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/~karypis/pu...datamining (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents two algorithms based on the horizontal and vertical pattern discovery paradigms that find the connected subgraphs that have a sufficient number of edgedisjoint embeddings in a single large undirected labeled sparse graph. These algorithms use three different methods to determine the number of the edge-disjoint embeddings of a subgraph that are based on approximate and exact maximum independent set computations and use it to prune infrequent subgraphs. Experimental evaluation ... (Update)
Cited by: More
Towards Motif Detection in Networks: Frequency Concepts.. - Schreiber.. (2004) (Correct)
Active bibliography (related documents): More All
9.4: Finding Frequent Patterns in a Large Sparse Graph - Kuramochi, Karypis (2003) (Correct)
1.1: Frequent Sub-Structure-Based Approaches for.. - Deshpande, Kuramochi, .. (2003) (Correct)
0.6: An Efficient Algorithm for Discovering Frequent Subgraphs - Kuramochi, Karypis (2002) (Correct)
Similar documents based on text: More All
0.5: Frequent Subgraph Discovery - Kuramochi, Karypis (2001) (Correct)
0.4: Discovering Frequent Geometric Subgraphs - Kuramochi, Karypis (2002) (Correct)
0.4: Gene Classification using Expression Profiles: A Feasibility.. - Kuramochi, Karypis (2001) (Correct)
Related documents from co-citation: More All
2: Computing Frequent Graph Patterns from Semistructured Data (context) - Vanetik, Gudes et al. - 2002
2: cient algorithm for discovering frequent subgraphs (context) - Kuramochi, Karypis - 2002
2: Network motifs: simple building blocks of complex networks (context) - Milo, Shen- et al. - 2002
BibTeX entry: (Update)
M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. In SIAM International Conference on Data Mining (SDM-04), 2004. http://citeseer.ist.psu.edu/article/kuramochi04finding.html More
@misc{ kuramochi04finding,
author = "M. Kuramochi and G. Karypis",
title = "Finding frequent patterns in a large sparse graph",
text = "M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse
graph. In SIAM International Conference on Data Mining (SDM-04), 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/article/kuramochi04finding.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
910 Fast algorithms for mining association rules - Agrawal, Srikant - 1994
696 UCI repository of machine learning databases (context) - Blake, Merz - 1998
576 Authoritative sources in a hyperlinked environment - Kleinberg - 1999
475 Automatic subspace clustering of high dimensional data for d.. - Agrawal, Gehrke et al. - 1998
340 Mining sequential patterns - Agrawal, Srikant - 1995
249 Mining frequent patterns without candidate generation - Han, Pei et al. - 2000
203 Approximating clique is almost NP-complete (context) - Feige, Goldwasser et al. - 1991
91 Integrating classification and association rule mining - Liu, Hsu et al. - 1998
87 Social Network Analysis : Methods and Applications (context) - Wasserman, Faust et al. - 1994
83 On syntactic versus computational views of approximability - Khanna, Motwani et al. - 1994
56 Practical graph isomorphism (context) - McKay - 1981
54 An apriori-based algorithm for mining frequent substructures.. - Inokuchi, Washio et al. - 2000
52 Frequent subgraph discovery - Kuramochi, Karypis - 2001
49 Algorithms for maximum independent sets (context) - Robson - 1986
46 Substructure discovery using minimum description length and .. - Cook, Holder - 1994
45 Finding frequent substructures in chemical compounds - Dehaspe, Toivonen et al. - 1998
45 gSpan: Graph-based substructure pattern mining - Yan, Han - 2002
34 Nucleic Acids Research (context) - Berman, Westbrook et al. - 2000
27 Carcinogenesis predictions using ILP - Srinivasan, King et al. - 1997
25 Graph-based data mining - Cook, Holder - 2000
24 Fast vertical mining using diffsets - Zaki, Gouda - 2003
24 Department of Computing Science - Fortin, isomorphism et al. - 1996
23 ANF: A fast and scalable tool for data mining in massive gra.. - Palmer, Gibbons et al. - 2002
20 Molecular feature mining in HIV data (context) - Kramer, De Raedt et al. - 2001
20 the approximation properties of independent set problem in d.. - Berman, Fujito - 1995
19 CLIP: Concept learning from inference patterns (context) - Yoshida, Motoda - 1995
18 CloseGraph: Mining closed frequent graph patterns (context) - Yan, Han
18 A framework for constructing features and models for intrusi.. - Lee, Stolfo - 2000
17 Identification of tertiary structure resemblance in proteins.. (context) - Grindley, Artymiuk et al. - 1993
17 Substructure discovery in the SUBDUE system - Holder, Cook et al. - 1994
17 Greed is good: Approximating independent sets in sparse and .. (context) - orsson, Radhakrishnan - 1997
17 The level-wise version space algorithm and its application t.. - De Raedt, Kramer - 2001
15 Discrete Applied Mathematics (context) - Hochbaum, for et al. - 1983
15 Towards semantic web mining - Berendt, Hotho et al. - 2002
15 Efficient mining of frequent subgraph in the presence of iso.. - Huan, Wang et al. - 2003
14 Use of techniques derived from graph theory to compare secon.. (context) - Mitchell, Artymiuk et al. - 1989
12 Computing frequent graph patterns from semistructured data (context) - Vanetik, Gudes et al. - 2002
10 An efficient algorithm for discovering frequent subgraphs - Kuramochi, Karypis - 2002
10 Scientific knowledge discovery using Inductive Logic Program.. - Muggleton - 1999
10 An efficient algorithm for discovering frequent subgraphs - Kuramochi, Karypis
10 Finding patterns in three dimensional graphs: Algorithms and.. - Wang, Wang et al. - 2002
9 Fast detection of common geometric substructure in proteins - Chew, Huttenlocher et al. - 1999
9 A geometric algorithm to find small but highly simialar 3D s.. - Pennec, Ayache - 1998
8 CMAR: Accurate and efficient classification based on multipl.. - Li, Han et al. - 2001
8 Complete mining of frequent patterns from graphs: Mining gra.. (context) - Inokuchi, Washio et al. - 2003
7 Lecture Notes in Computer Science (context) - Kleinberg, Kumar et al. - 1999
7 A fast algorithm for the maximum clique problem (context) - ard - 2002
6 Relational data mining with inductive logic programming for .. - Mooney, Melville et al. - 2002
6 Frequent sub-structure based approaches for classifying chem.. - Deshpande, Kuramochi et al. - 2003
6 The graph isomorph disease (context) - Read, Corneil - 1977
6 Heuristics for similarity searching of chemical graphs using.. (context) - Raymond - 2002
6 A fast algorithm for mining frequent connected subgraphs (context) - Inokuchi, Washio et al. - 2002
5 Graph-based induction as a unified learning framework (context) - Yoshida, Motoda et al. - 1994
5 Knowledge discovery from structural data - Cook, Holder et al. - 1995
5 Automated approaches for classifying structures - Deshpande, Kuramochi et al. - 2002
4 Multiple structural alignment and core detection by geometri.. - Leibowitz, Fligelman et al. - 1999
4 Application of graph-based concept learning to the predictiv.. - Gonzalez, Holder et al. - 2001
4 Discovery and evaluation of graph-based hierarchical concept.. (context) - Jonyer, Cook et al. - 2001
3 Mining molecular fragments: Finding relevant substructures o.. (context) - Borgelt, Berthold - 2002
3 automated method for multiple structure alignment and detect.. (context) - Leibowitz, Nussinov et al. - 2001
3 Logic induction of valid behavior specifications for intrusi.. (context) - Ko - 2000
3 SEuS: Structure extraction using summaries (context) - Ghazizadeh, Chawathe - 2002
3 Hierarchical conceptual structural clustering (context) - Jonyer, Holder et al. - 2001
2 An efficient algorithm of frequent connected subgraph extrac.. (context) - Hong, Zhou et al. - 2003
2 An algorithm for finding maximal common subtopoloties in a s.. (context) - Koch, Lengauer et al. - 1996
2 Artificial Intelligence and Link Analysis Papers from (context) - Jensen, Goldberg - 1998
2 A scalabale algorithm for clustering sequence datasets (context) - Guralnik, Karypis - 2001
2 Discovering freuqent structures using summaries (context) - Ghazizadeh, Chawathe - 2002
2 eduprojectkddcup dataset (context) - http, cornell et al. - 2003
http://cygnus.uta.edu/subdue/databases/
http://cs.anu.edu.au/#bdm/
Documents on the same site (http://www-users.cs.umn.edu/~karypis/publications/data-mining.html): More
Text Categorization Using Weight Adjusted k-Nearest.. - Han, Karypis, Kumar (1999) (Correct)
Clustering In A High-Dimensional Space Using Hypergraph.. - Han, Karypis, Kumar.. (1997) (Correct)
Web Page Categorization and Feature Selection.. - Moore, Han.. (1997) (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