Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...
Abstract. We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orde...
Abstract. We present first experiments using Support Vector Regression as function approximator for an on-line, sarsa-like reinforcement learner. To overcome the batch nature of S...
Knowledge-intensive CBR assumes that cases are enriched with general domain knowledge. In CREEK, there is a very strong coupling between cases and general domain knowledge, in that...
: Rich, structured annotations of video recordings enable interesting uses, but existing techniques for manual, and even semi-automated, tagging can be too time-consuming. We prese...