Sciweavers

1277 search results - page 100 / 256
» The Google Similarity Distance
Sort
View
DEXA
2003
Springer
193views Database» more  DEXA 2003»
15 years 11 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
MIR
2004
ACM
125views Multimedia» more  MIR 2004»
15 years 11 months ago
Autonomous visual model building based on image crawling through internet search engines
In this paper, we propose an autonomous learning scheme to automatically build visual semantic concept models from the output data of Internet search engines without any manual la...
Xiaodan Song, Ching-Yung Lin, Ming-Ting Sun
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
15 years 10 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
CCCG
2009
15 years 7 months ago
On the Height of a Homotopy
Given 2 homotopic curves in a topological space, there are several ways to measure similarity between the curves, including Hausdorff distance and Fr
Erin W. Chambers, David Letscher
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
15 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