Rough Set Model for Constraint-based Multi-dimensional Association Rule Mining

Authors:
Wanzhong Yang;Yuefeng Li;Yue Xu;Hang Liu
Affiliations:
School of Software Engineering & Data Communications, Queensland University of Technology, Brisbane, OLD 4001, Australia, E-mail: w3.yang@student.qut.edu.au;School of Software Engineering & Data Communications, Queensland University of Technology, Brisbane, OLD 4001, Australia, E-mail: y2.li, yue.xu}@qut.edu.au;School of Software Engineering & Data Communications, Queensland University of Technology, Brisbane, OLD 4001, Australia, E-mail: y2.li, yue.xu}@qut.edu.au;X-bas Business Management Services, E-mail: hang@bigpond.net.au
Venue:
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Year:
2006

Citing 11
Cited 1

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Exploratory mining and pruning optimizations of constrained associations rules

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Data mining: concepts and techniques

Data mining: concepts and techniques
Exploiting succinct constraints using FP-trees

ACM SIGKDD Explorations Newsletter
Mining Frequent Item Sets with Convertible Constraints

Proceedings of the 17th International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
In Pursuit of Patterns in Data Reasoning from Data The Rough Set Way

TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
DualMiner: a dual-pruning algorithm for itemsets with constraints

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Interpretations of Association Rules by Granular Computing

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Divide-and-Approximate: A Novel Constraint Push Strategy for Iceberg Cube Mining

IEEE Transactions on Knowledge and Data Engineering
Mining association rules with multi-dimensional constraints

Journal of Systems and Software

An efficient discovery of class-restricted MARs

AIKED'11 Proceedings of the 10th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a rough set model for constraint-based multi-dimensional association rule mining. It first overviews the progress in constraint-based multi-dimensional association rule mining. It then applies the constraints on the rough set model. To set up a decision table, it adopts the user voting and the thresholds on condition granules and decision granules. Finally it employs the extended random sets to generate interesting rules. It shows that this rough set model will effectively improve the quality of association rule mining by reducing the attributes greatly in the vertical direction and clustering the records clearly in the horizontal direction. To describe the association among the attributes, it constructs an ontology and presents a new concept of an association table. The construction of a tuple in an association table indicates the relationship among different levels on the ontology towards decision support.