1217 search results - page 63 / 244 » On compressing frequent patterns |
246
Voted
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
115
click to vote
JOT
2006
15 years 3 months ago
2006
address (at least three) common problems, and the solution is then abstracted into a pattern. Antipatterns, on the other hand, identify common problems with solutions, and then sho...
154
click to vote
IDEAS
2006
IEEE
15 years 9 months ago
2006
IEEE
Sequential pattern mining is very important because it is the basis of many applications. Yet how to efficiently implement the mining is difficult due to the inherent characteri...
156
Voted
DAGSTUHL
2006
15 years 5 months ago
2006
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
123
Voted
CSR
2006
Springer
15 years 7 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...