Using a hash-based method for apriori-based graph mining

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3202, Issue , 2004, Pages 349-361

  Nguyen, Phu Chien ^a   Washio, Takashi ^a   Ohara, Kouzou ^a   Motoda, Hiroshi ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

ADJACENCY MATRICES; CANDIDATE SETS; DOMINATING FACTORS; EFFECTIVE ALGORITHMS; FREQUENT SUBGRAPHS; GRAPH ISOMORPHISM; GRAPH MINING; SYNTHETIC GRAPHS;

ARTIFICIAL INTELLIGENCE;

EID: 35048887228     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30116-5_33     Document Type: Article

References (13)

1. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proceedings of the 20th VLDB Conference, pp.487-499.
2. Borgelt, C. and Berthold, M.R. 2002. Mining molecular fragments: Finding relevant substructures of molecules. In Proceedings of the 2nd IEEE International Conference on Data Mining (ICDM'02), pp.51-58.
3. Cook, D.J. and Holder, L.B. 1994. Substructure discovery using minimum description length and background knowledge, Journal of Artificial Intelligence Research, Vol.1, pp.231-255.
4. Diestel, R. 2000. Graph Theory. Springer-Verlag, New York.
5. Fortin, S. 1996. The graph isomorphism problem. Technical Report 96-20, University of Alberta, Edmonton, Alberta, Canada.
6. Inokuchi, A., Washio, T., Nishimura, K. and Motoda, H. 2002. A fast algorithm for mining frequent connected subgraphs. IBM Research Report RT0448, Tokyo Research Laboratory, IBM Japan.
7. Inokuchi, A., Washio, T. and Motoda, H. 2003. Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning, Vol.50, pp.321-354.
8. Debnath, A.K., et al. 1991. Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. Correlation with molecular orbital energies and hydrophobicity. Journal of Medical Chemistry, Vol. 34, pp.786-797.
9. Kuramochi, M. and Karypis, G. 2001. Frequent subgraph discovery. In Proceedings of the 1st IEEE International Conference on Data Mining (ICDM'01), pp.313-320.
10. Park, J.S., Chen, M-.S. and Yu, P.S. 1997. Using a hash-based method with transaction trimming for mining association rules. IEEE Trans. Knowledge and Data Engineering, Vol.9, No.5, pp. 813-825.
11. Washio, T. and Motoda, H. 2003. State of the art of graph-based data mining. SIGKDD Explorations, Vol.5, No.1, pp.59-68.
12. Yan, X. and Han, J. 2002. gSpan: Graph-based structure pattern mining. In Proceedings of the 2nd IEEE International Conference on Data Mining (ICDM'02), pp.721-724.
13. Yoshida, K. and Motoda, H. CLIP: Concept learning from inference patterns. Artificial Intelligence, Vol.75, No.1, pp.63-92.