DaWaK 2010: Data Warehousing and Knowledge Discovery pp 77-88 | Cite as
Frequent Sub-graph Mining on Edge Weighted Graphs
Abstract
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with respect to other forms of frequent pattern mining but are exacerbated in the context of frequent sub-graph mining. To reduced the search space, and address these twin overheads, a weighted approach to sub-graph mining is proposed. However, a significant issue in weighted sub-graph mining is that the anti-monotone property, typically used to control candidate set generation, no longer holds. This paper examines a number of edge weighting schemes; and suggests three strategies for controlling candidate set generation. The three strategies have been incorporated into weighted variations of gSpan: ATW-gSpan, AW-gSpan and UBW-gSpan respectively. A complete evaluation of all three approaches is presented.
Keywords
Weighted Transaction Graph Mining Weighted Frequent Sub-graph Mining Weighting SchemesPreview
Unable to display preview. Download preview PDF.
References
- 1.Barber, B., Hamilton, H.J.: Extracting Share Frequent Itemsets with Infrequent Subsets. Journal of Data Mining and Knowledge Discovery 7, 153–185 (2003)MathSciNetCrossRefGoogle Scholar
- 2.Carter, C.L., Hamilton, H.J., Cercone, N.: Share based Measures for Itemsets. In: Komorowski, J., Żytkow, J.M. (eds.) PKDD 1997. LNCS, vol. 1263, pp. 14–24. Springer, Heidelberg (1997)CrossRefGoogle Scholar
- 3.Cook, D.J., Holder, L.B.: Substructure Discovery Using Minimum Description Length and Background Knowledge. Journal of Artificial Intelligenc Research 1, 231–255 (1994)Google Scholar
- 4.Elsayed, A., Coenen, F., Jiang, C., Garca-Fiana, M., Sluming, V.: Corpus Callosum MR Image Classification. Journal of Knowledge Based Systems (to appear 2010)Google Scholar
- 5.Huan, J., Wang, W., Prins, J.: Efficient Mining of Frequent Subgraph in the Presence of Isomorphism. In: Proceedings of the 2003 International Conference on Data Mining, ICDM 2003 (2003)Google Scholar
- 6.Inokuchi, A., Washio, T., Motoda, H.: An Apriori-based Algorithm for Mining Frequent Substructures from Graph Data. In: Proceedings of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases (2000)Google Scholar
- 7.Jiang, C., Coenen, F., Sanderson, R., Zito, M.: Text Classification using Graph Mining-Based Feature Extraction. The Journal of Knowledge Based Systems (to appear 2010)Google Scholar
- 8.Kuramochi, M., Karypis, G.: Frequent Subgraph Discovery. In: Proceedings of IEEE International Conference on Data Mining (2001)Google Scholar
- 9.Robinson, S.E., Christley, R.M.: Identifying Temporal Variation in Reported Births, Deaths and Movements of Cattle in Britain. Journal of BMC Verterinary Research (2006), doi:10.1186/1746-6148-2-11Google Scholar
- 10.Tao, F., Murtagh, F., Farid, M.: Weighted Association Rule Mining using Weighted Support and Significance Framework. In: The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD 2003), Washington DC, USA, pp. 661–666 (2003)Google Scholar
- 11.Yan, X., Han, J.: gSpan: Graph-based Substructure Pattern Mining. In: Proceedings of 2002 International Conference on Data Mining (2002)Google Scholar
- 12.Yan, X., Han, J.: CloseGraph: Mining Closed Frequent Graph Patterns. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington DC, USA, pp. 286–295 (2003)Google Scholar
- 13.Yun, U.: WIS: Weighted Interesting Sequential Pattern Mining with a Similar Level of Support and/or Weight. ETRI Journal 29(3), 336–352 (2007)MathSciNetCrossRefGoogle Scholar