Abstract Representations and Frequent Pattern Discovery

2012/02/10 by Ozkural, Eray
#Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1202.2167

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.

Related

• Summarization Techniques for Pattern Collections in Data Mining
• Modeling Complex Higher Order Patterns
• The role of semantics in mining frequent patterns from knowledge bases\n in description logics with rules
• Reductions for Frequency-Based Data Mining Problems
• Frequent Knot Discovery