Bandyopadhyay S, Maulik U, Cook D J, et al. Enhancing Structure Discovery for Data Mining in Graphical Databases Using Evolutionary Programming // Proc of the 15th International Florida Artificial Intelligence Research Society Conference. Pensacola Beach, USA, 2002: 232236
[2]
Grunwald P. A Tutorial Introduction to the Minimum Description Length Principle [EB/OL]. [20060801]. http://homepages.cwi.nl/pdg/ftp/mdlintro.pdf
[3]
Li Minqiang, Kou Jisong, Lin Dan, et al. Genetic Algorithms'Theory and Applications. Beijing, China: Science Press, 2002 (in Chinese) (李敏强,寇纪淞,林 丹,等.遗传算法的基本理论与应用.北京:科学出版社, 2002)
[4]
Inokuchi A, Washio T, Motoda H. An AprioriBased Algorithm for Mining Frequent Substructures from Graph Data // Proc of the 4th European Conference on Principles and Practices of Knowledge Discovery in Databases. Lyon,France, 2000: 1323
[5]
Kuramochi M, Karypis G. An Efficient Algorithm for Discovering Frequent Subgraphs. IEEE Trans on Knowledge and Data Engineering, 2004, 16(9): 10381051
[6]
Yan Xifeng, Han Jiawei. Gspan: GraphBased Substructure Pattern Mining // Proc of the IEEE International Conference on Data Mining. Maebashi City, Japan, 2002: 721724
[7]
Dehaspe L, Toivonen H. Discovery of Frequent Datalog Patterns. Data Mining and Knowledge Discovery, 1999, 3(1): 736
[8]
de Raedt L, Kramer S. The Levelwise Version Space Algorithm and Its Application to Molecular Fragment Finding // Proc of the 17th International Joint Conferences on Artificial Intelligence. Seattle, USA, 2001: 853862
[9]
Cook D J, Holder L B. Substructure Discovery Using Minimum Description Length and Background Knowledge. Journal of Artificial Intelligence Research, 1994, 1: 231255
[10]
Jonyer I, Cook D J, Holder L B. GraphBased Hierarchical Conceptual Clustering. International Journal of Artificial Intelligence Tools, 2001, 10(1/2): 107135
