Sciweavers

1387 search results - page 177 / 278
» Convexity in Discrete Space
Sort
View
ICML
2002
IEEE
14 years 9 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 9 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
IJCNN
2007
IEEE
14 years 3 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
MLG
2007
Springer
14 years 3 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
SIAMJO
2010
107views more  SIAMJO 2010»
13 years 7 months ago
Second-Order Analysis of Polyhedral Systems in Finite and Infinite Dimensions with Applications to Robust Stability of Variation
Abstract. This paper concerns second-order analysis for a remarkable class of variational systems in finite-dimensional and infinite-dimensional spaces, which is particularly imp...
René Henrion, Boris S. Mordukhovich, Nguyen...