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
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Integrating Fuzziness into OLAP for Multidimensional Fuzzy Association Rules Mining
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Mining Strong Affinity Association Patterns in Data Sets with Skewed Support Distribution
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Efficient dynamic mining of constrained frequent sets
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Though many algorithms have focused on mining quantitative attributes with a uniform support distribution, very little work is done in mining quantitative attributes with skewed support distribution. Still the binning methods in these algorithms are not effective against skewed support distribution and noise data; mostly they are not dynamic. In this paper, two efficient algorithms are proposed: Support-distribution Based Binning (SBB) for binning quantitative attributes and Dynamic Rule Mining (DRM) for association rule computation. The performance of these algorithms is experimented with real-life data sets and results are analyzed.