387 search results - page 72 / 78 » Mining Approximative Descriptions of Sets Using Rough Sets |
WWW
2005
ACM
14 years 8 months ago
2005
ACM
We consider the problem of finding duplicates in data streams. Duplicate detection in data streams is utilized in various applications including fraud detection. We develop a solu...
DEXA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping ...
PAMI
2010
13 years 5 months ago
2010
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
WAIM
2010
Springer
13 years 5 months ago
2010
Springer
Trajectory prediction (TP) of moving objects has grown rapidly to be a new exciting paradigm. However, existing prediction algorithms mainly employ kinematical models to approximat...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...