FIMI 2004 - PDF Preprint Papers

FIMI 2004

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FIMI-2004 Paper

click to vote

FIMI
2004

279views Data Mining» more FIMI 2004»

DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets

13 years 5 months ago

Download hpc.isti.cnr.it

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 ...

Claudio Lucchese, Salvatore Orlando, Raffaele Pere...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	279	DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets	claim
2	268	Algorithmic Features of Eclat	claim
3	239	LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets	claim
4	212	A Space Optimization for FP-Growth	claim
5	175	CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure	claim
6	172	AIM2: Improved implementation of AIM	claim
7	161	ABS: Adaptive Borders Search of frequent itemsets	claim
8	155	nonordfp: An FP-growth variation without rebuilding the FP-tree	claim
9	134	Recursion Pruning for the Apriori Algorithm	claim
10	134	Reducing the Main Memory Consumptions of FPmax* and FPclose	claim
11	123	Surprising Results of Trie-based FIM Algorithms	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers