Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...
In this paper we propose extensions to the match propagation algorithm which is a technique for computing quasidense point correspondences between two views. The extensions make t...
— One feature that classification algorithms typically lack is the ability to know what they do not know. With this knowledge an algorithm would be able to operate in any domain...