MaxDomino: efficiently mining maximal sets

Authors:
Krishnamoorthy Srikumar;Bharat Bhasker;Satish K. Tripathi
Affiliations:
Indian Institute of Management, Lucknow, India;Indian Institute of Management, Lucknow, India;Indian Institute of Management, Lucknow, India
Venue:
BNCOD'03 Proceedings of the 20th British national conference on Databases
Year:
2003

Citing 3
Cited 2

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Depth first generation of long patterns

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases

Proceedings of the 17th International Conference on Data Engineering

Efficiently mining Maximal Frequent Sets in dense databases for discovering association rules

Intelligent Data Analysis
An efficient system for detecting outliers from financial time series

BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present MaxDomino, an algorithm for mining maximal frequent sets using a novel concept of dominancy factor of a transaction. We also propose a hashing scheme to collapse the database to a form that contains only unique transactions. Unlike traditional bottom up approach with look-aheads, MaxDomino employs a top down strategy with selective bottom up search for mining maximal sets. Using the connect dataset [Benchmark dataset created by University California, Irvine], our experimental results reveal that MaxDomino outperforms GenMax at higher support levels. Furthermore, our scalability tests show that MaxDomino yields an order of magnitude improvement in speed over GenMax. MaxDomino is especially efficient when the maximal frequent sets are longer.