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:
“His talent was as natural as the pattern that was made by the dust on a butterfly’s wings. At one time he understood it no more than the butterfly did and he did not know when it was brushed or marred. Later he became conscious of his damaged wings and of their construction and he learned to think and could not fly any more because the love of flight was gone and he could only remember when it had been effortless.”
—Ernest Hemingway (1899–1961)
“Next to the striking of fire and the discovery of the wheel, the greatest triumph of what we call civilization was the domestication of the human male.”
—Max Lerner (b. 1902)