1217 search results - page 87 / 244 » On compressing frequent patterns |
158
click to vote
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
126
click to vote
ICDM
2005
IEEE
15 years 9 months ago
2005
IEEE
Consider spatial data consisting of a set of binary features taking values over a collection of spatial extents (grid cells). We propose a method that simultaneously finds spatia...
136
click to vote
SPIRE
2009
Springer
15 years 10 months ago
2009
Springer
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
119
click to vote
PAKDD
2009
ACM
15 years 10 months ago
2009
ACM
When training classifiers, presence of noise can severely harm their performance. In this paper, we focus on “non-class” attribute noise and we consider how a frequent fault-t...
124
click to vote
IDEAS
2005
IEEE
15 years 9 months ago
2005
IEEE
The resource requirements of frequent pattern mining algorithms depend mainly on the length distribution of the mined patterns in the database. Synthetic databases, which are used...