K-optimal pattern discovery is a data mining technique that provides an alternative to the frequent pattern discovery approach that underlies most association rule learning techniques.
Frequent pattern discovery techniques find all patterns for which there are sufficiently frequent examples in the sample data. In contrast, k-optimal pattern discovery techniques find the k patterns that optimize a user-specified measure of interest. The parameter 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.
In contrast to k-optimal rule discovery and frequent pattern mining techniques, subgroup discovery focuses on mining interesting patterns with respect to a specified target property of interest. This includes, for example, binary, nominal, or numeric attributes, but also more complex target concepts such as correlations between several variables. Background knowledge like constraints and ontological relations can often be successfully applied for focusing and improving the discovery results.
Famous quotes containing the words pattern and/or discovery:
“The real trouble about women is that they must always go on trying to adapt themselves to men’s theories of women, as they always have done. When a woman is thoroughly herself, she is being what her type of man wants her to be. When a woman is hysterical it’s because she doesn’t quite know what to be, which pattern to follow, which man’s picture of woman to live up to.”
—D.H. (David Herbert)
“There is a great discovery still to be made in literature, that of paying literary men by the quantity they do not write.”
—Thomas Carlyle (1795–1881)