Loading...
Please wait, while we are loading the content...
Similar Documents
MAFIA: A maximal frequent itemset algorithm for transactional databases (2001)
| Content Provider | CiteSeerX |
|---|---|
| Author | Burdick, Doug Calimlim, Manuel Gehrke, Johannes |
| Description | We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very long. The search strategy of our algorithm integrates a depth-first traversal of the itemset lattice with effective pruning mechanisms. Our implementation of the search strategy combines a vertical bitmap representation of the database with an efficient relative bitmap compression schema. In a thorough experimental analysis of our algorithm on real data, we isolate the effect of the individual components of the algorithm. Our performance numbers show that our algorithm outperforms previous work by a factor of three to five. 1 |
| File Format | |
| Language | English |
| Publisher Date | 2001-01-01 |
| Access Restriction | Open |
| Subject Keyword | Transactional Database Real Data Previous Work Individual Component New Algorithm Search Strategy Thorough Experimental Analysis Depth-first Traversal Performance Number Maximal Frequent Itemset Algorithm In ICDE Maximal Frequent Itemsets Efficient Relative Bitmap Compression Schema Itemset Lattice Vertical Bitmap Representation |
| Content Type | Text |
| Resource Type | Article |
