Multiple Minimum Support-Based Rare Graph Pattern Mining Considering Symmetry Feature-Based Growth Technique and the Differing Importance of Graph Elements

Symmetry

Gangin Lee²  Unil Yun¹  Heungmo Ryang²  Donggyu Kim² 

[1] Department of Computer Engineering, Sejong University, 209 Neungdong-ro, Gwangjin-gu, Seoul 143-747, Korea;

关键词: frequent pattern mining;    graph mining;    graph enumeration;    multiple minimum supports;    weight constraint;   

DOI  :  10.3390/sym7031151

来源: mdpi

【 摘 要 】

Frequent graph pattern mining is one of the most interesting areas in data mining, and many researchers have developed a variety of approaches by suggesting efficient, useful mining techniques by integration of fundamental graph mining with other advanced mining works. However, previous graph mining approaches have faced fatal problems that cannot consider important characteristics in the real world because they cannot process both (1) different element importance and (2) multiple minimum support thresholds suitable for each graph element. In other words, graph elements in the real world have not only frequency factors but also their own importance; in addition, various elements composing graphs may require different thresholds according to their characteristics. However, traditional ones do not consider such features. To overcome these issues, we propose a new frequent graph pattern mining method, which can deal with both different element importance and multiple minimum support thresholds. Through the devised algorithm, we can obtain more meaningful graph pattern results with higher importance. We also demonstrate that the proposed algorithm has more outstanding performance compared to previous state-of-the-art approaches in terms of graph pattern generation, runtime, and memory usage.

【 授权许可】

CC BY   
© 2015 by the authors; licensee MDPI, Basel, Switzerland.