Browse > Article
http://dx.doi.org/10.7472/jksii.2014.15.6.125

A Weighted Frequent Graph Pattern Mining Approach considering Length-Decreasing Support Constraints  

Yun, Unil (Dept. of Computer Engineering, Sejong University)
Lee, Gangin (Dept. of Computer Engineering, Sejong University)
Publication Information
Journal of Internet Computing and Services / v.15, no.6, 2014 , pp. 125-132 More about this Journal
Abstract
Since frequent pattern mining was proposed in order to search for hidden, useful pattern information from large-scale databases, various types of mining approaches and applications have been researched. Especially, frequent graph pattern mining was suggested to effectively deal with recent data that have been complicated continually, and a variety of efficient graph mining algorithms have been studied. Graph patterns obtained from graph databases have their own importance and characteristics different from one another according to the elements composing them and their lengths. However, traditional frequent graph pattern mining approaches have the limitations that do not consider such problems. That is, the existing methods consider only one minimum support threshold regardless of the lengths of graph patterns extracted from their mining operations and do not use any of the patterns' weight factors; therefore, a large number of actually useless graph patterns may be generated. Small graph patterns with a few vertices and edges tend to be interesting when their weighted supports are relatively high, while large ones with many elements can be useful even if their weighted supports are relatively low. For this reason, we propose a weight-based frequent graph pattern mining algorithm considering length-decreasing support constraints. Comprehensive experimental results provided in this paper show that the proposed method guarantees more outstanding performance compared to a state-of-the-art graph mining algorithm in terms of pattern generation, runtime, and memory usage.
Keywords
Length-decreasing support constraint; weighted frequent pattern mining; graph pattern; data mining; frequent pattern mining;
Citations & Related Records
연도 인용수 순위
  • Reference
1 L.T. Thomas, S.R. Valluri, and K. Karlapalem, "MARGIN: Maximal frequent subgraph mining", Transactions on Knowledge Discovery from Data. vol. 4, no. 3, pp. 10:1-42, 2010.
2 X. Yan and J. Han, "gSpan: graph-based substructure pattern mining", in Proc. of the 2002 IEEE Int'l Conf. on Data Mining, pp. 721-724, 2002.
3 M. Seno, and G. Karypis, "Finding frequent patterns using length-decreasing support constraints", Data Mining and Knowledge Discovery, vol. 10, no. 3, pp. 197-228, 2005.   DOI
4 R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," in Proc. of the 20th Int'l Conf. on Very Large Data Bases (VLDB), pp. 487-499, 1994.
5 J. Han, J. Pei, and Y. Yin, "Mining Frequent Patterns without Candidate Generation," in Proc. of the 2000 ACM SIGMOD Int'l Conf. on Management of Data, pp. 1-12, 2000.
6 A. Bifet, G. Holmes, B. Pfahringer, and R. Gavalda, "Mining Frequent Closed Graphs on Evolving Data Streams", in Proc. of the 17th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pp. 591-599, 2011.
7 A.Y.R. Gonzalez, J.F.M. Trinidad, J.A. Carrasco-Ochoa, and J. Ruiz-Shulcloper, "Mining frequent patterns and association rules using similarities," Expert Systems with Applications, Vol. 40, No. 17, pp. 6823-6836, 2013.   DOI   ScienceOn
8 S. Gunnemann and T. Seidl, "Subgraph Mining on Directed and Weighted Graphs", in Pro. of the 14th Pacific-Asia Conf. on Knowledge Discovery and Data Mining, pp. 133-146, 2010.
9 G. Lee and U. Yun, "Frequent Graph Pattern Mining with Length-Decreasing Support Constraints", Multimedia and Ubiquitous Engineering, pp. 185-192, 2013.
10 J. Huan, W. Wang, and J. Prins, "Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism", in Proc. of the 3rd IEEE International Conf. on Data Mining, pp. 549-552, 2003.
11 Y. Jia, J. Zhang, and J. Huan, "An efficient graph-mining method for complicated and noisy data with real-world applications", Knowledge Information Systems, vol. 28, no. 2, pp 423-447, 2011.   DOI
12 C. Jiang, F. Coenen, and M. Zito, "Frequent Sub-graph Mining on Edge Weighted Graphs" in Proc. of the 12th int'l conf. on Data warehousing and knowledge discovery, pp. 77-88, 2010.
13 S. Nijssen and J.N. Kok, "The Gaston Tool for Frequent Subgraph Mining", Electronic Notes in Theoretical Computer Science, vol. 127, no. 1 pp. 77-87, 2005.   DOI