Rule-chain incremental mining algorithm based on directed graph

Authors:
Hongyun Ning;Zhiying Zhang;Degan Zhang
Affiliations:
Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin, China and Key Laboratory of Computer Vision and System, Tianjin Universit ...;Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin, China and Key Laboratory of Computer Vision and System, Tianjin Universit ...;Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin, China and Key Laboratory of Computer Vision and System, Tianjin Universit ...
Venue:
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
Year:
2009

Citing 7
Cited 0

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A Graph-Based Approach for Discovering Various Types of Association Rules

IEEE Transactions on Knowledge and Data Engineering
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases

Proceedings of the 17th International Conference on Data Engineering
Analyzing multi-level spatial association rules through a graph-based visualization

IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Discovering Frequent Graph Patterns Using Disjoint Paths

IEEE Transactions on Knowledge and Data Engineering
Self-optimization Rule-chain Mining Based on Potential Association Rule Directed Graph

ISCID '08 Proceedings of the 2008 International Symposium on Computational Intelligence and Design - Volume 01

Quantified Score

Hi-index	0.00

Visualization

Abstract

Aiming to discover the rule-chains directly, a novel graph-based online incremental mining algorithm (RIOMining) is proposed. Firstly, an interrelated bitmap based on a directed graph (PAGraph) is designed to compress the rule-chain information for storage. The compressed storage of the directed-graph effectively avoids repetitious database scanning and makes meaningful rules found more conveniently. Secondly, four theorems about discovery and pruning of frequent path in the graph are proved, so as to the rule-chains could be iteratively generated by searching incremental paths, while the theorems narrow the search scope and promote the performance by properly pruning and extending paths. It effectively reduces the redundancy calculation. Comparing it with other two fast mining algorithms, DLG and FP-growth, experimental result shows that it can mine rule-chains of high quality, especially, it is of real-time accuracy, and thereby it can be widely applied to dynamic network environment.