155 search results - page 1 / 31 » An efficient algorithm for mining closed inter-transaction i... |
102
Voted
FIMI
2004
15 years 1 months ago
2004
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
165
Voted
FIMI
2004
15 years 1 months ago
2004
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
138
Voted
IEAAIE
2009
Springer
15 years 6 months ago
2009
Springer
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
DKE
2008
15 years 7 days ago
2008
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm co...
105
Voted
DIS
2007
Springer
15 years 4 months ago
2007
Springer
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...