Sciweavers

30 search results - page 4 / 6
» Adaptive Cluster Distance Bounding for High-Dimensional Inde...
Sort
View
PRL
2006
139views more  PRL 2006»
13 years 6 months ago
Adaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...
ICAPR
2001
Springer
13 years 10 months ago
Image Retrieval Using a Hierarchy of Clusters
The goal of this paper is to describe an efficient procedure for color-based image retrieval. The proposed procedure consists of two stages. First, the image data set is hierarchi...
Daniela Stan, Ishwar K. Sethi
ADC
2007
Springer
183views Database» more  ADC 2007»
13 years 10 months ago
Efficient Similarity Search by Summarization in Large Video Database
With the explosion of video data, video processing technologies have advanced quickly and been applied into many fields, such as advertisements, medical etc.. To fast search these...
Xiangmin Zhou, Xiaofang Zhou, Heng Tao Shen
ICML
2005
IEEE
14 years 7 months ago
Comparing clusterings: an axiomatic view
This paper views clusterings as elements of a lattice. Distances between clusterings are analyzed in their relationship to the lattice. From this vantage point, we first give an a...
Marina Meila
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
13 years 4 months ago
CP-index: using clustering and pivots for indexing non-metric spaces
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
Victor Sepulveda, Benjamin Bustos