[1] Zaki M J.Efficiently mining frequent trees in a forest [C]//8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.Alberta, Canada, 2002: 68-75.
[2] Asai T, Abe K, Kawasoe S, et al.Efficient substructure discovery from large semi-structured data [C]//Proc 2002 SIAM Int Conf on Data Mining (SDM’02).Arlington, VA, 2002: 457-473.
[3] Pei J, Dong G, Zou W, et al.On computing condensed frequent pattern bases[C]//Proc 2002 Int Conf on Data Mining (ICDM’02).Maebashi, Japan, 2002: 378-385.
[4] Wang C, Hong M, Pei J, et al.Efficient pattern-growth methods for frequent tree pattern mining [C]//The Eighth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD’04).Sydney, Australia, 2004: 441-451.
[5] Chi Y, Yang Y, Xia Y, et al.CMTreeMiner:mining both closed and maximal frequent subtrees [C]//The Eighth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD’04).Sydney, Australia, 2004: 63-73.
[6] Kudo T.FREQT:an implementation of FREQT [EB/OL].(2003-03-21)[2004-12-15].http://chasen.org/~taku/software/freqt/.