Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Scalable Algorithms for Association Mining
IEEE Transactions on Knowledge and Data Engineering
Efficient Mining of High Confidience Association Rules without Support Thresholds
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Finding Interesting Associations without Support Pruning
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
ACM SIGKDD Explorations Newsletter
Mining top-k regular-frequent itemsets using database partitioning and support estimation
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
High confidence associations are of utter importance in knowledge discovery in various domains and possibly exist even at lower threshold support. Established methods for generating such rules depend on mining itemsets that are frequent with respect to a pre-defined cut-off value of support, called support threshold. Such a framework, however, discards all itemsets below the threshold and thus, existence of confident rules below the cut-off is out of its purview. But, infrequent itemsets can potentially generate confident rules. In the present work we introduce a concept of cohesion among items and obtain a methodology for mining high confidence association rules from itemsets irrespective of their support. Experiments with real and synthetic datasets corroborate the concept of cohesion.