Next Article in Journal / Special Issue
Hierarchical Clustering Using One-Class Support Vector Machines
Previous Article in Journal
Symmetry-Breaking as a Paradigm to Design Highly-Sensitive Sensor Systems
Previous Article in Special Issue
Kinematic Skeleton Based Control of a Virtual Simulator for Military Training
Article

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

Department of Computer Engineering, Sejong University, 209 Neungdong-ro, Gwangjin-gu, Seoul 143-747, Korea
*
Author to whom correspondence should be addressed.
Academic Editor: Neil Y. Yen
Symmetry 2015, 7(3), 1151-1163; https://doi.org/10.3390/sym7031151
Received: 12 January 2015 / Revised: 22 March 2015 / Accepted: 23 June 2015 / Published: 26 June 2015
(This article belongs to the Special Issue Advanced Symmetry Modelling and Services in Future IT Environments)
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. View Full-Text
Keywords: frequent pattern mining; graph mining; graph enumeration; multiple minimum supports; weight constraint frequent pattern mining; graph mining; graph enumeration; multiple minimum supports; weight constraint
Show Figures

Figure 1

MDPI and ACS Style

Lee, G.; Yun, U.; Ryang, H.; Kim, D. Multiple Minimum Support-Based Rare Graph Pattern Mining Considering Symmetry Feature-Based Growth Technique and the Differing Importance of Graph Elements. Symmetry 2015, 7, 1151-1163. https://doi.org/10.3390/sym7031151

AMA Style

Lee G, Yun U, Ryang H, Kim D. Multiple Minimum Support-Based Rare Graph Pattern Mining Considering Symmetry Feature-Based Growth Technique and the Differing Importance of Graph Elements. Symmetry. 2015; 7(3):1151-1163. https://doi.org/10.3390/sym7031151

Chicago/Turabian Style

Lee, Gangin; Yun, Unil; Ryang, Heungmo; Kim, Donggyu. 2015. "Multiple Minimum Support-Based Rare Graph Pattern Mining Considering Symmetry Feature-Based Growth Technique and the Differing Importance of Graph Elements" Symmetry 7, no. 3: 1151-1163. https://doi.org/10.3390/sym7031151

Find Other Styles

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Search more from Scilit
 
Search
Back to TopTop