Sciweavers

901 search results - page 114 / 181
» Nearest Neighbor Ensemble
Sort
View
ICDE
2010
IEEE
157views Database» more  ICDE 2010»
13 years 8 months ago
Subspace similarity search using the ideas of ranking and top-k retrieval
— There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, onl...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...
DAM
2006
89views more  DAM 2006»
13 years 8 months ago
First vs. best improvement: An empirical study
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first impr...
Pierre Hansen, Nenad Mladenovic
GEOINFORMATICA
2006
94views more  GEOINFORMATICA 2006»
13 years 8 months ago
Spatial Query Estimation without the Local Uniformity Assumption
Existing estimation approaches for spatial databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, the...
Yufei Tao, Christos Faloutsos, Dimitris Papadias
GEOINFORMATICA
2006
103views more  GEOINFORMATICA 2006»
13 years 8 months ago
Building and Querying a P2P Virtual World
Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment. One peer is introduced to the system by each participant. However current P2P app...
Egemen Tanin, Aaron Harwood, Hanan Samet, Deepa Na...
IJON
2006
85views more  IJON 2006»
13 years 8 months ago
From outliers to prototypes: Ordering data
We propose simple and fast methods based on nearest neighbors that order objects from high-dimensional data sets from typical points to untypical points. On the one hand, we show ...
Stefan Harmeling, Guido Dornhege, David M. J. Tax,...