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,...
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...
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...
— 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...
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...