FIMI 2003 - PDF Preprint Papers

FIMI 2003

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FIMI-2003 Paper

click to vote

FIMI
2003

210views Data Mining» more FIMI 2003»

COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation

13 years 5 months ago

Download sunsite.informatik.rwth-aachen.de

Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...

Osmar R. Zaïane, Mohammad El-Hajj

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	210	COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation	claim
2	170	kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets	claim
3	146	Mining Frequent Itemsets using Patricia Tries	claim
4	146	ARMOR: Association Rule Mining based on ORacle	claim
5	136	Intersecting data to closed sets with constraints	claim
6	123	Apriori, A Depth First Implementation	claim
7	120	MAFIA: A Performance Study of Mining Maximal Frequent Itemsets	claim
8	108	AFOPT: An Efficient Implementation of Pattern Growth Approach	claim
9	104	AIM: Another Itemset Miner	claim
10	95	Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets	claim
11	88	A fast APRIORI implementation	claim
12	84	Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers