1768 search results - page 143 / 354 » Mining Very Large Databases |
135
click to vote
ICDM
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
118
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
163
click to vote
INFOSCALE
2007
ACM
15 years 4 months ago
2007
ACM
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...
109
Voted
CIB
2002
15 years 3 months ago
2002
The web log data embed much of web users' browsing behavior. From the web logs, one can discover patterns that predict the users' future requests based on their current b...
138
Voted
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...