124 search results - page 16 / 25 » Quantitative evaluation of approximate frequent pattern mini... |
CIKM
2004
Springer
15 years 3 months ago
2004
Springer
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user ac...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
172
click to vote
GIS
2004
ACM
15 years 10 months ago
2004
ACM
Spatial co-location patterns represent the subsets of events whose instances are frequently located together in geographic space. We identified the computational bottleneck in the...
104
click to vote
KDD
2007
ACM
15 years 3 months ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...