HASHMAX: A NEW METHOD FOR MINING MAXIMAL FREQUENT ITEMSETS

Natalia Vanetik; Ehud Gudes

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

HASHMAX: A NEW METHOD FOR MINING MAXIMAL FREQUENT ITEMSETS

Topics: Mining High-Dimensional Data; Optimization

In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 0IC3K, 132-137, 2011 , Paris, France

Authors: Natalia Vanetik and Ehud Gudes

Affiliation: Ben Gurion University, Israel

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

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

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 (IC3K 2011) - KDIR; ISBN 978-989-8425-79-9; ISSN 2184-3228, SciTePress, 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 (IC3K 2011) - KDIR},
year={2011},
pages={132-137},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003628101400145},
isbn={978-989-8425-79-9},
issn={2184-3228},
}

TY - CONF

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