Abstract
Since frequent graph pattern mining was proposed, various approaches have been suggested by devising efficient techniques or integrating graph mining with other mining areas. However, previous methods have limitations that cannot reflect the following important characteristics in the real world to their mining processes. First, elements in the real world have their own importance as well as frequency, but traditional graph mining methods do not consider such features. Second, various elements composing graph databases may need thresholds different from one another according to their characteristics. However, since traditional approaches mine graph patterns on the basis of only a single threshold, losses of important pattern information can be caused. Motivated by these problems, we propose a new graph mining algorithm that can consider both different importance and multiple thresholds for each element of graphs. We also demonstrate outstanding performance of the proposed algorithm by comparing ours with previous state-of-the-art approaches.
This research was supported by the MSIP (Ministry of Science, ICT & Future Planning), Korea, under ICT/SW Creative research program supervised by the NIPA (National ICT Industry Promotion Agency) (NIPA-2014-H0502-14-3008) and the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (NRF No. 2013-005682).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Hu, Y.H., Chen, Y.L.: Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism. Decision Support Systems 42(1), 1–24 (2006)
Kiran, R.U., Reddy, P.K.: Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithms. In: EDBT, pp. 11–20 (2011)
Lee, G., Yun, U.: Frequent Graph Mining Based on Multiple Minimum Support Constraints. In: Park, J.J.(J.H.), Adeli, H., Park, N., Woungang, I. (eds.) Mobile, Ubiquitous, and Intelligent Computing. LNEE, vol. 274, pp. 19–23. Springer, Heidelberg (2014)
Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum supports. In: KDD, pp. 337–341 (1999)
Nijssen, S., Kok, J.N.: A quickstart in frequent structure mining can make a difference. In: KDD, pp. 647–652 (2004)
Samiullah, M., Ahmed, C.F., Fariha, A., Islam, M.R., Lachiche, N.: Mining frequent correlated graphs with a new measure. Expert Systems with Applications 41(4), 1847–1863 (2014)
Vo, B., Coenen, F., Le, B.: A new method for mining Frequent Weighted Itemsets based on WIT-trees. Expert Systems with Applications 40(4), 1256–1264 (2013)
Yun, U.: On pushing weight constraints deeply into frequent itemset mining. Intelligent Data Analysis 13(2), 359–383 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, G., Yun, U. (2015). Mining Frequent Graph Patterns Considering Both Different Importance and Rarity of Graph Elements. In: Park, J., Stojmenovic, I., Jeong, H., Yi, G. (eds) Computer Science and its Applications. Lecture Notes in Electrical Engineering, vol 330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45402-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-662-45402-2_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45401-5
Online ISBN: 978-3-662-45402-2
eBook Packages: EngineeringEngineering (R0)