HASHMAX: A NEW METHOD FOR MINING MAXIMAL FREQUENT ITEMSETS

Natalia Vanetik, Ehud Gudes

2011

Abstract

Mining maximal frequent itemsets is a fundamental problem in many data mining applications, especially in the case of dense data when the search space is exponential. We propose a top-down algorithm that employs hashing techniques, named HashMax, in order to generate maximal frequent itemsets efficiently. An empirical evaluation of our algorithm in comparison with the state-of-the-art maximal frequent itemset generation algorithm Genmax shows the advantage of HashMax in the case of dense datasets with a large amount of maximal frequent itemsets.

Paper Citation

in Harvard Style

Vanetik N. and Gudes E. (2011). HASHMAX: A NEW METHOD FOR MINING MAXIMAL FREQUENT ITEMSETS . In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2011) ISBN 978-989-8425-79-9, pages 132-137. DOI: 10.5220/0003628101400145

in Bibtex Style

@conference{kdir11,
author={Natalia Vanetik and Ehud Gudes},
title={HASHMAX: A NEW METHOD FOR MINING MAXIMAL FREQUENT ITEMSETS},
booktitle={Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2011)},
year={2011},
pages={132-137},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003628101400145},
isbn={978-989-8425-79-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2011)
TI - HASHMAX: A NEW METHOD FOR MINING MAXIMAL FREQUENT ITEMSETS
SN - 978-989-8425-79-9
AU - Vanetik N.
AU - Gudes E.
PY - 2011
SP - 132
EP - 137
DO - 10.5220/0003628101400145