An advanced algorithm of frequent subgraph mining based on ADI

ICIC Express Letters

Volumn 3, Issue 3, 2009, Pages 639-644

  Zou, Xiaohong ^a   Zhao, Li ^a   Guo, Jingfeng ^a   Chen, Xiao ^a  

^a YANSHAN UNIVERSITY   (China)

Author keywords

ADI; Canonical code; Frequent subgraph; Mining; Subgraph isomorphism

Indexed keywords

CODING EFFICIENCY; FREQUENT SUBGRAPH MINING; INDEX STRUCTURE; LARGE GRAPHS; SUBGRAPH ISOMORPHISM;

RETAIL STORES;

SET THEORY;

EID: 77953891428     PISSN: 1881803X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (5)

1. A. Inokuchi, T. Washio and H. Motoda An apriori-based algorithm formining frequent substructures from graph data Proc. of the European Conferenceon Principles of Data Mining and Knowledge Discovery, pp. 13-23, 2000.
2. R. Shettar, and G. T. Shobha Finding frequent structures insemistructured data ICIC Express Letters, Vol. 3, No. 2, pp. 135-140, 2009.
3. X. Yan, and J. Han, gSpan: Graph-based substructure pattern mining, Proc.of the IEEE International Conference on Data Mining, 2002.
4. C. Wang, W. Wang, J. Pei, Y. Zhu and B. Shi, Scalable mining of largedisk-based graph databases, Proc. of the International Conference on KnowledgeDiscovery and Data Mining, pp. 316-325, 2004. (Pubitemid 40114941)
5. D. W. Williams, J. Huan and W. Wang, Graph database indexing usingstructured graph decomposition, Proc. of the IEEE International Conference onData Engineering, pp. 976-985, 2007.