• Journal of Internet Computing and Services
    ISSN 2287 - 1136(Online) / ISSN 1598 - 0170 (Print)
    http://jics.or.kr/

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


Unil Yun, Gangin Lee, Journal of Internet Computing and Services, Vol. 15, No. 6, pp. 125-132, Dec. 2014
10.7472/jksii.2014.15.6.125, Full Text:
Keywords: Length-decreasing support constraint, weighted frequent pattern mining, graph pattern, Data Mining, Frequent pattern mining

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[APA Style]
Unil Yun and Gangin Lee (2014). A Weighted Frequent Graph Pattern Mining Approach considering Length-Decreasing Support Constraints. Journal of Internet Computing and Services, 15(6), 125-132. DOI: 10.7472/jksii.2014.15.6.125.

[IEEE Style]
U. Yun and G. Lee, "A Weighted Frequent Graph Pattern Mining Approach considering Length-Decreasing Support Constraints," Journal of Internet Computing and Services, vol. 15, no. 6, pp. 125-132, 2014. DOI: 10.7472/jksii.2014.15.6.125.

[ACM Style]
Unil Yun and Gangin Lee. 2014. A Weighted Frequent Graph Pattern Mining Approach considering Length-Decreasing Support Constraints. Journal of Internet Computing and Services, 15, 6, (2014), 125-132. DOI: 10.7472/jksii.2014.15.6.125.