Rácz, Balázs (2004) nonordfp: an FP-growth variation without rebuilding the FP-tree. In: Frequent Itemset Mining Implementations.Proceedings of the Workshop FIMI'04, Brighton (CEUR-WS 126).

Full text not available from this repository.

Abstract

We describe a frequent itemset mining algorithm and implementation based on the well-known algorithm FPgrowth. The theoretical difference is the main data structure (tree), which is more compact and which we do not need to rebuild for each conditional step. We thoroughly deal with implementation issues, data structures, memory layout, I/O and library functions we use to achieve comparable performance as the best implementations of the 1st Frequent Itemset Mining Implementations (FIMI) Workshop.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Informatics Laboratory
Depositing User:	Eszter Nagy
Date Deposited:	11 Dec 2012 15:16
Last Modified:	11 Dec 2012 15:16
URI:	https://eprints.sztaki.hu/id/eprint/3586

Update Item