Mining Frequent Graph Patterns Considering Both Different Importance and Rarity of Graph Elements

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).