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.
Frequent graph mining has been proposed to find interesting patterns (i.e., frequent sub-graphs) from databases composed of graph transaction data, which can effectively express complex and large data in the real world. In addition, various applications for graph mining have been suggested. Traditional graph pattern mining methods use a single minimum support threshold factor in order to check whether or not mined patterns are interesting. However, it is not a sufficient factor that can consider valuable characteristics of graphs such as graph sizes and features of graph elements. That is, previous methods cannot consider such important characteristics in their mining operations since they only use a fixed minimum support threshold in the mining process. For this reason, in this paper, we propose a novel graph mining algorithm that can consider various multiple, minimum support constraints according to the types of graph elements and changeable minimum support conditions, depending on lengths of graph patterns. In addition, the proposed algorithm performs in mining operations more efficiently because it can minimize duplicated operations and computational overheads by considering symmetry features of graphs. Experimental results provided in this paper demonstrate that the proposed algorithm outperforms previous mining approaches in terms of pattern generation, runtime and memory usage.
As one of the recent interesting areas in data mining, frequent graph pattern (or sub-graphs) mining was proposed to deal with more complicated data such as graphs. Moreover, in order to extract more meaningful graph patterns, the concept of weighted frequent graph pattern mining was suggested. Meanwhile, graph patterns extracted from given graph databases can have various features, which can be different for each length of the patterns. However, traditional graph mining approaches cannot deal with such useful characteristics in their mining operations because they employ a single minimum support threshold. Hence, even if a mined graph pattern turns out to be weighted infrequent, it may become a useful result according to its length feature. In this paper, we propose a new method for mining weighted frequent graph patterns based on length-decreasing support constraints and weighted smallest valid extension. Experimental results of this paper show that the proposed algorithm outperforms a state-of-the-art approach in various aspects.
30 April 2015 in Journal of Internet Computing and Services