Sciweavers

279 search results - page 49 / 56
» Methods for finding frequent items in data streams
Sort
View
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
14 years 8 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 8 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
TLSDKCS
2010
13 years 2 months ago
Improving Retrievability and Recall by Automatic Corpus Partitioning
Abstract. With increasing volumes of data, much effort has been devoted to finding the most suitable answer to an information need. However, in many domains, the question whether a...
Shariq Bashir, Andreas Rauber
KDD
2009
ACM
221views Data Mining» more  KDD 2009»
14 years 8 months ago
Migration motif: a spatial - temporal pattern mining approach for financial markets
A recent study by two prominent finance researchers, Fama and French, introduces a new framework for studying risk vs. return: the migration of stocks across size-value portfolio ...
Xiaoxi Du, Ruoming Jin, Liang Ding, Victor E. Lee,...
WAIM
2010
Springer
13 years 5 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan