2Ming-Syan Chen.Data Mining:An Overview from Database Perspec-tire.1998.
3数据挖掘讨论组.http://www.dmgroup.org.cn.
4Inokuchi A,Washio T,Motoda H.An apriori-based algorithm for mining frequent substructures from graph data.In:Cheng M,Yu PS,Liu B,eds.Proc.of the 4th European Conf.on Principles of Data Mining and Knowledge Discovery.Lyon:Springer-Verlag,2000.13-23.
5Kuramochi M,Karypis G.Frequent subgraph discovery.In:Cercone N,Lin TY,Wu X,eds.Proc.of the 1st IEEE Int'l Conf.on Data Mining.San Jose:IEEE Computer Society,2001.313-320.
6Yan X,Han J.gSpan:Graph-Based substructure pattern mining.In:Aggrawal R,Dittrich K,Ngu AH,eds.Proc.of the 2nd IEEE Int'l Conf.on Data Mining.Maebashi:IEEE Computer Society,2002.721-724.
7Borgelt C,Berhold MR.Mining molecular fragments:Finding relevant substructures of molecules.In:Aggrawal R,Dittrich K,Ngu AH,eds.Proc.of the 2nd IEEE Int'l Conf.on Data Mining.Maebashi:IEEE Computer Society,2002.51-58.
8Huan J,Wang W,Prins J.Efficient mining of frequent subgraphs in the presence of isomorphism.In:Wu X,Tuzhilin A,eds.Proc.of the 3rd IEEE Int'l Conf.Data Mining.Melbourne:IEEE Computer Society,2003.549-552.
9Nijssen S,Kok JN.A quickstart in frequent structure mining can make a difference.In:Kim W,Kohavi R,Gehrke J,DuMouchel W,eds.Proc.of the 10th ACM SIGKDD Int'l Conf.on Knowledge Discovery and Data Mining.Seattle:ACM,2004.647-652.
10Yan X,Han J.Closegraph:Mining closed frequent graph patterns.In:Getoor L,Senator TE,Domingos P,Faloutsos C,eds.Proc.of the 9th ACM SIGKDD Int'l Conf.on Knowledge Discovery and Data Mining.Washington:ACM,2003.286-295.
