43 search results - page 7 / 9 » Fast Frequent Itemset Mining using Compressed Data Represent... |
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
KES
2008
Springer
13 years 7 months ago
2008
Springer
Users prefer to navigate subjects from organized topics in an abundance resources than to list pages retrieved from search engines. We propose a framework to cluster frequent items...
DMKD
2003
ACM
14 years 8 days ago
2003
ACM
We analyze expression matrices to identify a priori interesting sets of genes, e.g., genes that are frequently co-regulated. Such matrices provide expression values for given biol...
PKDD
2000
Springer
13 years 10 months ago
2000
Springer
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
A visual word lexicon can be constructed by clustering primitive visual features, and a visual object can be described by a set of visual words. Such a "bag-of-words" re...