The Smallest Valid Extension-Based Efficient, Rare Graph Pattern Mining, Considering Length-Decreasing Support Constraints and Symmetry Characteristics of Graphs
Open Access
Abstract
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.Keywords
Funding Information
- National Research Foundation of Korea (NRF) (2015R1D1A1A02062051, 2015R1A2A1A15054624, 2013 R1A1A1A05005682)
This publication has 41 references indexed in Scilit:
- Incremental mining of weighted maximal frequent itemsets from dynamic databasesExpert Systems with Applications, 2016
- Sliding window based weighted erasable stream pattern mining for stream data applicationsFuture Generation Computer Systems, 2016
- Fast algorithm for high utility pattern mining with the sum of item quantitiesIntelligent Data Analysis: An International Journal, 2016
- Top-k high utility pattern mining with effective threshold raising strategiesKnowledge-Based Systems, 2015
- Efficient Mining of Robust Closed Weighted Sequential Patterns Without Information LossInternational Journal on Artificial Intelligence Tools, 2015
- Mining weighted erasable patterns by using underestimated constraint-based pruning techniqueJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology, 2015
- Discovering high utility itemsets with multiple minimum supportsIntelligent Data Analysis: An International Journal, 2014
- Incremental high utility pattern mining with static and dynamic databasesApplied Intelligence, 2014
- Ranking algorithm for book reviews with user tendency and collective intelligenceMultimedia Tools and Applications, 2014
- A blog ranking algorithm using analysis of both blog influence and characteristics of blog postsCluster Computing, 2013