ORIGAMI: Mining representative orthogonal graph patterns

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 153-162

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

^a Rensselaer Polytechnic Institute   (United States)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH MINING; HIGH-QUALITY; INTERNATIONAL CONFERENCES; PATTERN SPACE; RANDOMIZED ALGORITHMS; SYNTHETIC DATASETS;

ADMINISTRATIVE DATA PROCESSING; DATA MINING; DECISION SUPPORT SYSTEMS; GRAPH THEORY; INFORMATION MANAGEMENT; MINING; SEARCH ENGINES;

SET THEORY;

EID: 49749107567     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2007.45     Document Type: Conference Paper

References (16)

1. F. Afrati, G. Gionis, and H. Mannila. Approximating a collection of frequent sets. In SIGKDD, 2004.
2. H. Bunke and K. Shearer. A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 19:255-259, 1998.
3. 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.
4. D. Cook and L. Holder. Substructure discovery using minimal description length and background knowledge. Journal of Artificial Intelligence Research, 1:231-255, 1994.
5. M. Hasan, V. Chaoji, S. Salem, N. Parimi, and M. Zaki. DMTL: A generic data mining template library. In Workshop on Library-Centric Software Design (w/ OOPSLA), 2005.
6. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In ICDM, 2003.
7. J. Huan, W. Wang, J. Prins, and J. Yang. SPIN: Mining Maximal Frequent Subgraphs from Graph Databases. In SIGKDD, 2004.
8. A. Inokuchi, T. Washio, and H. Motoda. Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning, 50(3):321-354, 2003.
9. M. Kuramochi and G. Karypis. Frequent Subgraph Discovery. In ICDM, 2001.
10. S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference. In SIGKDD, 2004.
11. L. Thomas, S. Valluri, and K. Karlapalem. MARGIN: Maximal Frequent Subgraph Mining. In ICDM, 2006.
12. D. Xin, H. Cheng, X. Yan, and J. Han. Extracting Redundancy-Aware Top-k Patterns. In SIGKDD, 2006.
13. D. Xin, J. Han, X. Yan, and H. Cheng. Mining Compressed Frequent-Pattern Sets. In VLDB, August 2005.
14. X. Yan and J. Han. gSpan: Graph-Based Substructure Pattern Mining. In ICDM, 2002.
15. X. Yan and J. Han. CloseGraph: Mining Closed Frequent Graph Patterns. In SIGKDD, 2003.
16. X. Yan, P. S. Yu, and J. Han. Graph Indexing: A Frequent Structure-based Approach. In SIGMOD, 2004.