Abstract Representations and Frequent Pattern Discovery
Artificial Intelligence
2012-02-13 v1 Information Theory
math.IT
Abstract
We discuss the frequent pattern mining problem in a general setting. From an analysis of abstract representations, summarization and frequent pattern mining, we arrive at a generalization of the problem. Then, we show how the problem can be cast into the powerful language of algorithmic information theory. This allows us to formulate a simple algorithm to mine for all frequent patterns.
Cite
@article{arxiv.1202.2167,
title = {Abstract Representations and Frequent Pattern Discovery},
author = {Eray Ozkural},
journal= {arXiv preprint arXiv:1202.2167},
year = {2012}
}