Author:
Chen Yen-Liang,Kao Hung-Pin,Ko Ming-Tat
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Lin, X., Liu, C., Zhang, Y., Zhou, X.: Efficiently computing frequent tree-like topology patterns in a web environment. In: Proceedings of Technology of Object-Oriented Languages and Systems (1999)
2. Wang, K., Liu, H.Q.: Discovering structural association of semistructured data. IEEE Trans. on Knowledge and Data Engineering 12, 353–371 (2000)
3. Wang, K., Liu, H.Q.: Mining is-part-of association patterns from semistructured data. In: Proceedings of the 9th IFIP 2.6 Working Conference on Database Semantics (2001)
4. Inokuuchi, A., Washio, T., Motoda, H.: An Apriori-based Algorithm for mining frequent substructures from graph data. In: Proceeding of the 4th European Conference on Principles and Practices of Knowledge Discovery in Databases, pp. 13–23 (2000)
5. Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of the IEEE International Conference on Data Mining (2001)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献