K-optimal pattern discovery
Encyclopedia
K-optimal pattern discovery is a data mining
Data mining
Data mining , a relatively young and interdisciplinary field of computer science is the process of discovering new patterns from large data sets involving methods at the intersection of artificial intelligence, machine learning, statistics and database systems...

 technique that provides an alternative to the frequent pattern discovery approach that underlies most association rule learning
Association rule learning
In data mining, association rule learning is a popular andwell researched method for discovering interesting relations between variablesin large databases. Piatetsky-Shapirodescribes analyzing and presenting...

 techniques.

Frequent pattern discovery techniques find all patterns for which there are sufficient examples in the sample data
Data
The term data refers to qualitative or quantitative attributes of a variable or set of variables. Data are typically the results of measurements and can be the basis of graphs, images, or observations of a set of variables. Data are often viewed as the lowest level of abstraction from which...

. In contrast, k-optimal pattern discovery techniques find the k patterns that optimize a user-specified measure of interest. The value k is also specified by the user.

Examples of k-optimal pattern discovery techniques include:
  • k-optimal classification rule discovery .
  • k-optimal subgroup discovery .
  • finding k most interesting patterns using sequential sampling .
  • mining top.k frequent closed patterns without minimum support .
  • k-optimal rule discovery .
The source of this article is wikipedia, the free encyclopedia.  The text of this article is licensed under the GFDL.
 
x
OK