Sciweavers

719 search results - page 134 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
WWW
2005
ACM
15 years 10 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
KDD
2009
ACM
187views Data Mining» more  KDD 2009»
15 years 10 months ago
New ensemble methods for evolving data streams
Advanced analysis of data streams is quickly becoming a key area of data mining research as the number of applications demanding such processing increases. Online mining when such...
Albert Bifet, Bernhard Pfahringer, Geoffrey Holmes...
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
15 years 10 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-...
CIKM
1999
Springer
15 years 2 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
AINA
2005
IEEE
15 years 3 months ago
iHITS: Extending HITS for Personal Interests Profiling
Ever since the boom of World Wide Web, profiling online users' interests has become an important task for content providers. The traditional approach involves manual entry of...
Ziming Zhuang