Sciweavers

1246 search results - page 62 / 250
» High Performance Clustering Based on the Similarity Join
Sort
View
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
16 years 7 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
AI
2000
Springer
15 years 10 months ago
Keep It Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory
Abstract. Today’s case based reasoning applications face several challenges. In a typical application, the case bases grow at a very fast rate and their contents become increasin...
Qiang Yang, Jing Wu
KDD
2009
ACM
217views Data Mining» more  KDD 2009»
16 years 6 months ago
Efficient anomaly monitoring over moving object trajectory streams
Lately there exist increasing demands for online abnormality monitoring over trajectory streams, which are obtained from moving object tracking devices. This problem is challengin...
Yingyi Bu, Lei Chen 0002, Ada Wai-Chee Fu, Dawei L...
VIIP
2001
15 years 7 months ago
Boolean 2D Shape Similarity for Surface Reconstruction
Surface reconstruction problem (SRP) from planar samples has been traditionally approached by either (i) using local proximity between data points in adjacent layers, or by (ii) c...
Oscar E. Ruiz, Carlos A. Cadavid
CIKM
2006
Springer
15 years 8 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu