Sciweavers

134 search results - page 11 / 27
» Sliding-Window Filtering: An Efficient Algorithm for Increme...
Sort
View
DATAMINE
2000
118views more  DATAMINE 2000»
13 years 7 months ago
Spatial Data Mining: Database Primitives, Algorithms and Efficient DBMS Support
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
Martin Ester, Alexander Frommelt, Hans-Peter Krieg...
ACSW
2004
13 years 9 months ago
Cost-Efficient Mining Techniques for Data Streams
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon that the data rate is high relative to the computational power. The increasing...
Mohamed Medhat Gaber, Shonali Krishnaswamy, Arkady...
ICML
2006
IEEE
14 years 8 months ago
Sequential update of ADtrees
Ingcreasingly, data-mining algorithms must deal with databases that continuously grow over time. These algorithms must avoid repeatedly scanning their databases. When database att...
Josep Roure, Andrew W. Moore
ICDE
2007
IEEE
131views Database» more  ICDE 2007»
14 years 1 months ago
Incremental Clustering of Mobile Objects
Moving objects are becoming increasingly attractive to the data mining community due to continuous advances in technologies like GPS, mobile computers, and wireless communication ...
Sigal Elnekave, Mark Last, Oded Maimon
AAAI
2010
13 years 9 months ago
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek