Classification of Datasets with Frequent Itemsets is Wild

Natalia Vanetik

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

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

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

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

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

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

Name:
Country:
Subject:

Advanced Search Affiliations Search

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

Proceedings

Proceedings Search

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

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

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

Classification of Datasets with Frequent Itemsets is Wild

Topics: Data Analytics; Foundations of Knowledge Discovery in Databases

In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 0IC3K, 386-389, 2012 , Barcelona, Spain

Author: Natalia Vanetik

Affiliation: Sami Shamoon College of Engineering, Israel

Keyword(s): Frequent Itemsets, Dataset Classification.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Business Analytics ; Data Analytics ; Data Engineering ; Foundations of Knowledge Discovery in Databases ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Symbolic Systems

Abstract: The problem of dataset classification with frequent itemsets is defined as the problem of determining whether or not two different datasets have the same frequent itemsets without computing these itemsets explicitly. The reasoning behind this approach is high computational cost of computing frequent itemsets. Finding welldefined and understandable normal forms for this classification task would be a breakthrough in dataset classification field. The paper proves that classification of datasets with frequent itemsets is a hopeless task since canonical forms do not exist for this problem.

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.116.15.31

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. (2012). Classification of Datasets with Frequent Itemsets is Wild. In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval (IC3K 2012) - KDIR; ISBN 978-989-8565-29-7; ISSN 2184-3228, SciTePress, pages 386-389. DOI: 10.5220/0004167903860389

@conference{kdir12,
author={Natalia Vanetik.},
title={Classification of Datasets with Frequent Itemsets is Wild},
booktitle={Proceedings of the International Conference on Knowledge Discovery and Information Retrieval (IC3K 2012) - KDIR},
year={2012},
pages={386-389},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004167903860389},
isbn={978-989-8565-29-7},
issn={2184-3228},
}

TY - CONF

JO - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval (IC3K 2012) - KDIR
TI - Classification of Datasets with Frequent Itemsets is Wild
SN - 978-989-8565-29-7
IS - 2184-3228
AU - Vanetik, N.
PY - 2012
SP - 386
EP - 389
DO - 10.5220/0004167903860389
PB - SciTePress