Author:
Nakano Shin-ichi,Uehara Ryuhei,Uno Takeaki
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software
Reference35 articles.
1. Holder L B, Cook D J, Djoko S. Substructure discovery in the SUBDUE system. In AAAI Workshop on Knowledge Discovery in Databases, Seattle, Washington, U.S.A., July 31–August 4, 1994, pp.169–180.
2. Inokuchi A, Washio T, Motoda H. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD), Lyon, France, Sept. 13–16, 2000, LNCS 1910, Springer-Verlag, pp.13–23.
3. Zaki M J. Efficiently mining frequent trees in a forest. In Proc. the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 23–26, 2002, ACM Press, pp.71–80.
4. Asai T, Arimura H, Uno T et al. Discovering frequent substructures in large unordered trees. In Proc. Discovery Science (DS’03), Sapporo, Japan, Oct. 17–19, 2003, Lecture Notes in Artificial Intelligence, Vol. 2843, Springer-Verlag, pp.47–61.
5. Munro J I, Raman V. Succinct representation of balanced parentheses, static trees and planar graphs. In Proc. the 38 th Ann. Symp. Foundation of Computer Science, Miami Beach, Florida, USA, October 20–22, 1997, ACM Press, pp.118–126.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献