ORIGAMI: A novel and effective approach for mining representative orthogonal graph patterns

Statistical Analysis and Data Mining

Volumn 1, Issue 2, 2008, Pages 67-84

  Chaoji, Vineet ^a   Hasan, Mohammad Al ^a   Salem, Saeed ^a   Besson, Jeremy ^b   Zaki, Mohammed J ^a  

^a Rensselaer Polytechnic Institute   (United States)

^b CNRS   (France)

Author keywords

Graph mining; Maximal pattern mining; Randomized algorthims

Indexed keywords

EFFECTIVE ALGORITHMS; EFFECTIVE APPROACHES; GRAPH MINING; GRAPH PATTERNS; MAXIMAL PATTERN MINING; MAXIMAL PATTERNS; ORTHOGONAL GRAPHS; PATTERN MINING; RANDOMIZED ALGORTHIMS; TWO-GRAPHS;

MINING;

EID: 70350719970     PISSN: 19321872     EISSN: 19321864     Source Type: Journal    
DOI: 10.1002/sam.10004     Document Type: Article

References (21)

1. F. Afrati, G. Gionis, and H. Mannila, Approximating a collection of frequent sets, In SIGKDD, 2004.
2. H. Bunke, On a relation between graph edit distance and maximum common subgraph, Pattern Recognit Lett 18(9) (1997), 689-694.
3. H. Bunke and K. Shearer, A graph distance metric based on the maximal common subgraph, Pattern Recognit Lett 19 (1998), 255-259.
4. T. Calders, C. Rigotti, and J.-F. Boulicaut, A Survey on Condensed Representation for Frequent Sets, In Constraint-Based Mining and Inductive DB (LNCS Vol. 3848), 2005.
5. D. Cook and L. Holder, Substructure discovery using minimal description length and background knowledge, J Artif Intell Res 1 (1994), 231-255.
6. I. Davidson and S. S. Ravi, Clustering with constraints: feasibility issues and the k-means algorithm, In SIAM SDM Proceedings, Newport Beach, CA, 2005.
7. P. Flajolet, D. Gardy, and L. Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Appl Math 39(3) (1992), 207-229.
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, New York, W. H. Freeman & Co., 1979.
9. M. Hasan, V. Chaoji, S. Salem, N. Parimi, and M. Zaki, DMTL: A generic data mining template library, InWorkshop on Library-Centric Software Design (w/ OOPSLA), San Diego, CA, 2005.
10. J. Huan, W. Wang, and J. Prins, Efficient mining of frequent subgraphs in the presence of isomorphism, In ICDM, 2003.
11. J. Huan, W. Wang, J. Prins, and J. Yang, SPIN: Mining Maximal Frequent Subgraphs from Graph Databases, In SIGKDD, 2004.
12. A. Inokuchi, T. Washio, and H. Motoda, Complete mining of frequent patterns from graphs: mining graph data, Mach Learn 50(3) (2003), 321-354.
13. M. Kuramochi and G. Karypis, Frequent Subgraph Discovery, In ICDM, 2001.
14. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
15. S. Nijssen and J. Kok, A quickstart in frequent structure mining can make a difference, In SIGKDD, 2004.
16. L. Thomas, S. Valluri, and K. Karlapalem, MARGIN: Maximal Frequent Subgraph Mining, In ICDM, 2006.
17. D. Xin, H. Cheng, X. Yan, and J. Han, Extracting Redundancy-Aware Top-k Patterns, In SIGKDD, 2006.
18. D. Xin, J. Han, X. Yan, and H. Cheng, Mining Compressed Frequent-Pattern Sets, In VLDB, August 2005.
19. X. Yan and J. Han, gSpan: Graph-Based Substructure Pattern Mining, In ICDM, 2002.
20. X. Yan and J. Han, CloseGraph: Mining Closed Frequent Graph Patterns, In SIGKDD, 2003.
21. X. Yan, P. S. Yu, and J. Han, Graph Indexing: A Frequent Structure-based Approach, In SIGMOD, 2004.