Association against dissociation: some pragmatic considerations for frequent itemset generation under fixed and variable thresholds

Authors:
Sukomal Pal;Aditya Bagchi
Affiliations:
Indian Statistical Institute, Kolkata, India;Indian Statistical Institute, Kolkata, India
Venue:
ACM SIGKDD Explorations Newsletter
Year:
2005

Citing 6
Cited 4

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
An effective hash-based algorithm for mining association rules

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Parallel Algorithms for Discovery of Association Rules

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
Pushing Support Constraints Into Association Rules Mining

IEEE Transactions on Knowledge and Data Engineering
Finding Interesting Associations without Support Pruning

ICDE '00 Proceedings of the 16th International Conference on Data Engineering

An approach to mining bundled commodities

Knowledge-Based Systems
Data Mining by Navigation --- An Experience with Systems Biology

PReMI '09 Proceedings of the 3rd International Conference on Pattern Recognition and Machine Intelligence
High confidence association mining without support pruning

PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
Cohesion: A concept and framework for confident association discovery with potential application in microarray mining

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditionally, support is considered to be the standard measure for frequent itemset generation in Association Rule mining. This paper provides a new measure called togetherness where dissociation among items is also considered as a parameter in the frequent itemset generation process. Results of performance analysis show that association against dissociation is a more pragmatic approach and discovers truly associated candidate itemsets. Second part of the paper extends this togetherness measure to the domain of variable threshold. Here, like variable minimum support, a variable minimum togetherness has been proposed where this minimum value decreases as the itemset size increases. A simple and pragmatic process has been described, which can be easily implemented. It also provides ample control facilities in the hand of the users. Necessary change and extension of the existing algorithms have been made to establish the concepts. Here as well, results of performance analysis justify the approach.