loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Natalia Vanetik and Ehud Gudes

Affiliation: Ben Gurion University, Israel

ISBN: 978-989-8425-79-9

Keyword(s): Maximal frequent itemset mining.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Methodologies and Technologies ; Mining High-Dimensional Data ; Operational Research ; Optimization ; Symbolic Systems

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.

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.171.183.163

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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

@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},
}

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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.