Author:
Chi Yun,Yang Yirong,Xia Yi,Muntz Richard R.
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Aho, A.V., Hopcroft, J.E., Ullman, J.E.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Asai, T., Abe, K., Kawasoe, S., Arimura, H., Satamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: Proc. of the 2nd SIAM Int. Conf. on Data Mining (2002)
3. Asai, T., Arimura, H., Uno, T., Nakano, S.: Discovering frequent substructures in large unordered trees. In: Proc. of the 6th Intl. Conf. on Discovery Science (2003)
4. Chi, Y., Yang, Y., Muntz, R.R.: Indexing and mining free trees. In: Proc. of the 2003 IEEE Int. Conf. on Data Mining (2003)
5. Chi, Y., Yang, Y., Muntz, R.R.: Mining frequent rooted trees and free trees using canonical forms. Technical Report CSD-TR No. 030043, UCLA (2003),
ftp://ftp.cs.ucla.edu/techreport/2003-reports/030043.pdf
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献