Sciweavers

249 search results - page 33 / 50
» Metric space similarity joins
Sort
View
PR
2000
103views more  PR 2000»
13 years 7 months ago
Genetic algorithm-based clustering technique
A genetic algorithm-based clustering technique, called GA-clustering, is proposed in this article. The searching capability of genetic algorithms is exploited in order to search f...
Ujjwal Maulik, Sanghamitra Bandyopadhyay
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
14 years 5 months ago
Inapproximability for planar embedding problems
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios ...
KAIS
2000
87views more  KAIS 2000»
13 years 7 months ago
An Index Structure for Data Mining and Clustering
Abstract. In this paper we present an index structure, called MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in s...
Xiong Wang, Jason Tsong-Li Wang, King-Ip Lin, Denn...
DMIN
2009
142views Data Mining» more  DMIN 2009»
13 years 5 months ago
Efficient Record Linkage using a Double Embedding Scheme
Record linkage is the problem of identifying similar records across different data sources. The similarity between two records is defined based on domain-specific similarity functi...
Noha Adly
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
14 years 1 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...