Please use this identifier to cite or link to this item:
|Title:||FP-bonsai: the art of growing and pruning small FP-trees||Other Titles:||8th Pacific-Asia Conference, PAKDD 2004, Sydney, Australia, May 26-28, 2004. Proceedings||Authors:||Bonchi, F.
|Issue Date:||2004||Publisher:||Berlin Springer||Source:||Advances in Knowledge Discovery and Data Mining. p. 155-160||Series/Report:||Lecture Notes in Computer Science||Series/Report no.:||3056||Abstract:||In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this paper, we integrate the recently proposed ExAnte data reduction technique within the FP-growth algorithm. Together, they result in a very efficient frequent itemset mining algorithm that effectively exploits monotone constraints.||Document URI:||http://hdl.handle.net/1942/6669||ISBN:||978-3-540-22064-0||DOI:||10.1007/b97861||ISI #:||000221955100017||Category:||A1||Type:||Journal Contribution|
|Appears in Collections:||Research publications|
Show full item record
WEB OF SCIENCETM
checked on May 13, 2022
checked on May 20, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.