Sciweavers

501 search results - page 68 / 101
» Kernel Nearest Neighbor Algorithm
Sort
View
IJON
2006
85views more  IJON 2006»
13 years 7 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,...
KES
2008
Springer
13 years 7 months ago
Distance-Based Classification in OWL Ontologies
Abstract. We propose inductive distance-based methods for instance classification and retrieval in ontologies. Casting retrieval as a classification problem with the goal of assess...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito
TKDE
2008
123views more  TKDE 2008»
13 years 7 months ago
Explaining Classifications For Individual Instances
We present a method for explaining predictions for individual instances. The presented approach is general and can be used with all classification models that output probabilities...
Marko Robnik-Sikonja, Igor Kononenko
ICDE
2011
IEEE
271views Database» more  ICDE 2011»
12 years 11 months ago
Authentication of moving kNN queries
— A moving kNN query continuously reports the k nearest neighbors of a moving query point. In addition to the query result, a service provider that evaluates moving queries often...
Man Lung Yiu, Eric Lo, Duncan Yung
GIS
2005
ACM
14 years 8 months ago
Improving the R*-tree with outlier handling techniques
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
Tian Xia, Donghui Zhang