Sciweavers

877 search results - page 46 / 176
» Classifier learning with a new locality regularization metho...
Sort
View
88
Voted
ECAI
2010
Springer
14 years 8 months ago
Describing the Result of a Classifier to the End-User: Geometric-based Sensitivity
This paper addresses the issue of supporting the end-user of a classifier, when it is used as a decision support system, to classify new cases. We consider several kinds of classif...
Isabelle Alvarez, Sophie Martin, Salma Mesmoudi
ML
2000
ACM
150views Machine Learning» more  ML 2000»
14 years 10 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew
ICML
2006
IEEE
15 years 11 months ago
Cost-sensitive learning with conditional Markov networks
There has been a recent, growing interest in classification and link prediction in structured domains. Methods such as conditional random fields and relational Markov networks sup...
Prithviraj Sen, Lise Getoor
ICML
2009
IEEE
15 years 11 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...
ATMOS
2007
163views Optimization» more  ATMOS 2007»
14 years 11 months ago
Branching Strategies to Improve Regularity of Crew Schedules in Ex-Urban Public Transit
We discuss timetables in ex-urban bus traffic that consist of many trips serviced every day together with some exceptions that do not repeat daily. Traditional optimization methods...
Ingmar Steinzen, Leena Suhl, Natalia Kliewer