Sciweavers

41 search results - page 8 / 9
» Finding frequent items in probabilistic data
Sort
View
KDD
2006
ACM
127views Data Mining» more  KDD 2006»
14 years 4 months ago
Recommendation method for extending subscription periods
Online stores providing subscription services need to extend user subscription periods as long as possible to increase their profits. Conventional recommendation methods recommend...
Tomoharu Iwata, Kazumi Saito, Takeshi Yamada
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 4 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
PODS
2009
ACM
100views Database» more  PODS 2009»
14 years 4 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
MOBISYS
2009
ACM
14 years 4 months ago
Longitudinal study of a building-scale RFID ecosystem
Radio Frequency IDentification (RFID) deployments are becoming increasingly popular in both industrial and consumer-oriented settings. To effectively exploit and operate such depl...
Evan Welbourne, Karl Koscher, Emad Soroush, Magdal...
SOFTWARE
2002
13 years 4 months ago
Modeling with a Sense of Purpose
is the level of abstraction: a logical model ignores the constraints that the underlying database technology imposes and presents a simplified view. Sometimes physical database des...
John Daniels