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 quantitative association rules in large relational tables
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Association rules over interval data
SIGMOD '97 Proceedings of the 1997 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 Statistical Theory for Quantitative Association Rules
Journal of Intelligent Information Systems
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mining Association Rules with Weighted Items
IDEAS '98 Proceedings of the 1998 International Symposium on Database Engineering & Applications
Quantitative Association Rules Based on Half-Spaces: An Optimization Approach
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
MIC Framework: An Information-Theoretic Approach to Quantitative Association Rule Mining
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Hi-index | 0.00 |
To avoid the loss of semantic information due to the partition of quantitative values, this paper proposes a novel algorithm, called MPSQAR, to handle the quantitative association rules mining. And the main contributions include: (1) propose a new method to normalize the quantitative values; (2) assign a weight for each attribute to reflect the values distribution; (3) extend the weight-based association model to tackle the quantitative values in association rules without partition; (4) propose a uniform method to mine the traditional binary association rules and quantitative association rules; (5) show the effectiveness and scalability of new method by experiments.