Sciweavers

3837 search results - page 23 / 768
» Learning Approximate Consistencies
Sort
View
ICML
2010
IEEE
14 years 10 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
MLG
2007
Springer
15 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
LWA
2007
14 years 11 months ago
Parameter Learning for a Readability Checking Tool
This paper describes the application of machine learning methods to determine parameters for DeLite, a readability checking tool. DeLite pinpoints text segments that are difficul...
Tim vor der Brück, Johannes Leveling
IDA
2002
Springer
14 years 9 months ago
Evolutionary model selection in unsupervised learning
Feature subset selection is important not only for the insight gained from determining relevant modeling variables but also for the improved understandability, scalability, and pos...
YongSeog Kim, W. Nick Street, Filippo Menczer
PRL
2008
118views more  PRL 2008»
14 years 9 months ago
Bayes Machines for binary classification
In this work we propose an approach to binary classification based on an extension of Bayes Point Machines. Particularly, we take into account the whole set of hypotheses that are...
Daniel Hernández-Lobato, José Miguel...