Sciweavers

990 search results - page 115 / 198
» Learning with non-positive kernels
Sort
View
ICDM
2007
IEEE
184views Data Mining» more  ICDM 2007»
15 years 4 months ago
Bayesian Folding-In with Dirichlet Kernels for PLSI
Probabilistic latent semantic indexing (PLSI) represents documents of a collection as mixture proportions of latent topics, which are learned from the collection by an expectation...
Alexander Hinneburg, Hans-Henning Gabriel, Andr&eg...
ICDM
2003
IEEE
135views Data Mining» more  ICDM 2003»
15 years 3 months ago
An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and its Application to Kernel Machines
The Support Vector Machine (SVM) solution corresponds to the centre of the largest sphere inscribed in version space. Alternative approaches like Bayesian Point Machines (BPM) and...
Frédéric Maire
NIPS
2004
14 years 11 months ago
The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkabl...
Robert Jenssen, Deniz Erdogmus, José Carlos...
ICASSP
2010
IEEE
14 years 10 months ago
Fixed-budget kernel recursive least-squares
We present a kernel-based recursive least-squares (KRLS) algorithm on a fixed memory budget, capable of recursively learning a nonlinear mapping and tracking changes over time. I...
Steven Van Vaerenbergh, Ignacio Santamaría,...
ICPR
2006
IEEE
15 years 11 months ago
On Kernel Selection in Relevance Vector Machines Using Stability Principle
In this paper we propose an alternative interpretation of Bayesian learning based on maximal evidence principle. We establish a notion of local evidence which can be viewed as a c...
Dmitry Kropotov, Nikita Ptashko, Oleg Vasiliev, Dm...