Classification of Datasets with Frequent Itemsets is Wild

Natalia Vanetik

2012

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.

Paper Citation

in Harvard Style

Vanetik N. (2012). Classification of Datasets with Frequent Itemsets is Wild . In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2012) ISBN 978-989-8565-29-7, pages 386-389. DOI: 10.5220/0004167903860389

in Bibtex Style

@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 - Volume 1: KDIR, (IC3K 2012)},
year={2012},
pages={386-389},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004167903860389},
isbn={978-989-8565-29-7},
}

in EndNote Style

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