Sciweavers

279 search results - page 27 / 56
» Methods for finding frequent items in data streams
Sort
View
PODS
2009
ACM
112views Database» more  PODS 2009»
14 years 8 months ago
Optimal sampling from sliding windows
APPEARED IN ACM PODS-2009. A sliding windows model is an important case of the streaming model, where only the most "recent" elements remain active and the rest are disc...
Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniol...
SIGMOD
2005
ACM
123views Database» more  SIGMOD 2005»
14 years 1 months ago
To Do or Not To Do: The Dilemma of Disclosing Anonymized Data
Decision makers of companies often face the dilemma of whether to release data for knowledge discovery, vis a vis the risk of disclosing proprietary or sensitive information. Whil...
Laks V. S. Lakshmanan, Raymond T. Ng, Ganesh Rames...
ASC
2008
13 years 7 months ago
Info-fuzzy algorithms for mining dynamic data streams
Most data mining algorithms assume static behavior of the incoming data. In the real world, the situation is different and most continuously collected data streams are generated by...
Lior Cohen, Gil Avrahami, Mark Last, Abraham Kande...
JIPS
2010
154views more  JIPS 2010»
13 years 2 months ago
Mining Spatio-Temporal Patterns in Trajectory Data
Spatio-temporal patterns extracted from historical trajectories of moving objects reveal important knowledge about movement behavior for high quality LBS services. Existing approac...
Juyoung Kang 0002, Hwan-Seung Yong
JIIS
2000
119views more  JIIS 2000»
13 years 7 months ago
Knowledge Discovery from Series of Interval Events
Knowledge discovery from data sets can be extensively automated by using data mining software tools. Techniques for mining series of interval events, however, have not been conside...
Roy Villafane, Kien A. Hua, Duc A. Tran, Basab Mau...