Mining frequent itemset using bit-vector representation approach is very efficient for small dense datasets, but highly inefficient for sparse datasets due to lack of any efficient bit-vector projection technique. In this paper we present a novel efficient bit-vector projection technique, for sparse and dense datasets. We also present a new frequent itemset mining algorithm Ramp (Real Algorithm for Mining Patterns) using bit-vector representation approach and our bit-vector projection technique. The performance of the Ramp is compared with the current best frequent itemset mining algorithms. Different experimental results on sparse datasets show that mining frequent itemset using Ramp is faster than the current best algorithms. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Bashir, S., & Baig, A. R. (2006). Ramp: High performance frequent itemset mining with efficient bit-vector projection technique. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3918 LNAI, pp. 504–508). https://doi.org/10.1007/11731139_59
Mendeley helps you to discover research relevant for your work.