MaxDomino: Efficiently mining maximal sets. 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.

References in zbMATH (referenced in 2 articles , 1 standard article )

Showing results 1 to 2 of 2.
Sorted by year (citations)

  1. Srikumar, Krishnamoorthy; Bhasker, Bharat: Efficiently mining maximal frequent sets in dense databases for discovering association rules (2004) ioport
  2. Srikumar, Krishnamoorthy; Bhasker, Bharat; Tripathi, Satish K.: MaxDomino: Efficiently mining maximal sets (2003)