Sciweavers

990 search results - page 61 / 198
» Learning with non-positive kernels
Sort
View
JMLR
2010
119views more  JMLR 2010»
14 years 4 months ago
Semi-Supervised Learning via Generalized Maximum Entropy
Various supervised inference methods can be analyzed as convex duals of the generalized maximum entropy (MaxEnt) framework. Generalized MaxEnt aims to find a distribution that max...
Ayse Erkan, Yasemin Altun
ML
2010
ACM
185views Machine Learning» more  ML 2010»
14 years 4 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
NIPS
2001
14 years 11 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio
MLG
2007
Springer
15 years 4 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
ICCV
2009
IEEE
14 years 7 months ago
Bayesian Poisson regression for crowd counting
Poisson regression models the noisy output of a counting function as a Poisson random variable, with a log-mean parameter that is a linear function of the input vector. In this wo...
Antoni B. Chan, Nuno Vasconcelos