Please use this identifier to cite or link to this item:
|Title:||Memory issues in frequent itemset mining||Authors:||GOETHALS, Bart||Issue Date:||2004||Publisher:||New York ACM Press 2004||Source:||Proceedings of the 2004 ACM Symposium on Applied Computing (SAC'04), March 14-17, 2004, Nicosia, Cyprus. p. 530-534.||Abstract:||During the past decade, many algorithms have been proposed to solve the frequent itemset mining problem, i.e. find all sets of items that frequently occur together in a given database of transactions. Although very efficient techniques have been presented, they still suffer from the same problem. That is, they are all inherently dependent on the amount of main memory available. Moreover, if this amount is not enough, the presented techniques are simply not applicable anymore, or significantly need to pay in performance. In this paper, we give a rigorous comparison between current state of the art techniques and present a new and simple technique, based on sorting the transaction database, resulting in a sometimes more efficient algorithm for frequent itemset mining using less memory||Document URI:||http://hdl.handle.net/1942/4345||Link to publication:||http://doi.acm.org/10.1145/967900.968012||ISBN:||1-58113-812-1||Category:||C1||Type:||Proceedings Paper|
|Appears in Collections:||Research publications|
Show full item record
checked on May 20, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.