PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Frequent Pattern
Hannu Toivonen
In: Encyclopedia of Machine Learning (2010) Springer . ISBN 978-0-387-30768-8

Abstract

Definition Given a set D of examples, a language L of possible pat- terns, and a minimum frequency min_ fr, every pattern θ ∈ L that occurs at least in the minimum number of examples, i.e., ∣{ e ∈ D ∣ θ occurs in e }∣ ≥ min_ fr, is a frequent pattern. Discovery of all frequent pat- terns is a common data mining task. In its most typical form, the patterns are 7frequent itemsets. A more gen- eral formulation of the problem is 7constraint-based mining.

PDF - PASCAL Members only - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Book Section
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:7896
Deposited By:Hannu Toivonen
Deposited On:17 March 2011