Author:
Yamamoto Tsubasa,Ozaki Tomonobu,Ohkawa Takenao
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Borgelt, C.: On Canonical Forms for Frequent Graph Mining. In: Proc. of the 3rd International Workshop on Mining Graphs, pp. 1–12 (2005)
2. Borgelt, C., Berthold, M.R.: Mining molecular fragments: Finding relevant substructures of molecules. In: Proc. of the 2nd IEEE International Conference on Data Mining, pp. 51–58 (2002)
3. Lecture Notes in Computer Science;Y.L. Chen,2004
4. De Raedt, L., Washio, T., Kok, J.N. (eds.): Advances in Mining Graphs, Trees and Sequences, Frontiers in Artificial Intelligence and Applications, vol. 124. IOS Press, Amsterdam (2005)
5. Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proc. of the 3rd IEEE International Conference on Data Mining, pp. 549–552 (2003)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mining for Paths in Flow Graphs;Advances in Data Mining. Applications and Theoretical Aspects;2010