Name
Abstract | ||
|---|---|---|
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm consists of two phases. First, we scan the database once to find the frequent items. For each frequent item found, the ICMiner converts the original transaction database into a set of domain attributes, called a dataset. Then, it enumerates closed inter-transaction itemsets using an itemset-dataset tree, called an ID-tree. By using the ID-tree and datasets to mine closed inter-transaction itemsets, the ICMiner can embed effective pruning strategies to avoid costly candidate generation and repeated support counting. The experiment results show that the proposed algorithm outperforms the EH-Apriori, FITI, ClosedPROWL, and ITP-Miner algorithms in most cases. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.datak.2008.02.001 | Data Knowl. Eng. |
Keywords | Field | DocType |
costly candidate generation,inter-transaction closed pattern,itp-miner algorithm,frequent item,inter-transaction itemsets,domain attribute,original transaction database,effective pruning strategy,efficient algorithm,proposed algorithm,data mining,association rules,association rule | Data mining,Computer science,Algorithm,Association rule learning,Database transaction,Database | Journal |
Volume | Issue | ISSN |
66 | 1 | 0169-023X |
Citations | PageRank | References |
26 | 0.92 | 45 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anthony J. T. Lee | 1 | 325 | 17.40 |
| Chun-sheng Wang | 2 | 78 | 2.66 |
| Wan-Yu Weng | 3 | 26 | 0.92 |
| Yi-An Chen | 4 | 89 | 5.36 |
| Huei-Wen Wu | 5 | 58 | 2.46 |