Subgraph Isomorphism Detection using a code based representation

Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Recent Advances in Artifical Intelligence

Volumn , Issue , 2005, Pages 474-479

  Omos, Ivan ^a   Gonzalez, Jesus A ^a   Osorio, Mauricio ^b  

^a INSTITUTO NACIONAL DE ASTROFÍSICA   (Mexico)

^b UNIVERSIDAD DE LAS AMÉRICAS PUEBLA   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; GRAPH THEORY; LEARNING SYSTEMS;

GRAPH-BASED REPRESENTATION; SCALABLE GRAPH MATCHING TOOLS; SUBGRAPH ISOMORPHISM DETECTION;

COMPUTER SCIENCE;

EID: 32844473265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Cook, D. J.; Holder, L. B. Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research, 1:231-255, 1994.
2. Garey R. Michael. Johnson S. David. Computers and Intractability, A Guide to the theory of NP-Completeness. W. H. Freeman and Company (2003)
3. Inokuchi, A. Washio, T. Motoda, H. Complete Mining of Frequent Patterns from Graphs: Mining Graph Data. Machine Learning, Kluwer Academic Publishers. (2003). 321-354
4. Kuramochi, M.; Karypis, G. An Efficient Algorithm for discovering Frequent Subgraphs. Tech. Report. Dept. of Computing Science, University of Minnesota. June (2002).
5. Olmos, Ivan. Gonzalez, Jesus. Osorio, Mauricio. Subgraph Isomorphism Detection with a Representation Based on List of Codes. First Iberoamerican Workshop on Machine Learning for Scientific Data Analysis (2004).
6. Shayan G. Sudarshan S.C. "SEuS: Structure Extraction using Summaries". Technical Report. C. S. Department, University of Maryland, (2002). Thulasiraman, K. Swamy, M.N.S. Graphs: Theory and Algorithms. Wiley - Interscience. 460 pp (1992).
7. Xifeng, Y. Jiawei H. gSpan: Graph - Based Substructure Pattern Mining. Technical Report. University of Illinois. (2002).
8. Zaki, M. J. Efficiently Mining Trees in a Forest. Tech. Report 01-7, Computer Science Department, Rensselaer Polytechnic Institute, (2001).