Sciweavers

899 search results - page 34 / 180
» Is an ordinal class structure useful in classifier learning
Sort
View
ECAI
2010
Springer
13 years 6 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
ICMLA
2009
13 years 6 months ago
Learning Probabilistic Structure Graphs for Classification and Detection of Object Structures
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
Johannes Hartz
ICML
2007
IEEE
14 years 9 months ago
Sparse probabilistic classifiers
The scores returned by support vector machines are often used as a confidence measures in the classification of new examples. However, there is no theoretical argument sustaining ...
Romain Hérault, Yves Grandvalet
JSYML
2008
105views more  JSYML 2008»
13 years 8 months ago
Finite state automata and monadic definability of singular cardinals
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...
Itay Neeman
BMCBI
2010
176views more  BMCBI 2010»
13 years 8 months ago
TargetSpy: a supervised machine learning approach for microRNA target prediction
Background: Virtually all currently available microRNA target site prediction algorithms require the presence of a (conserved) seed match to the 5' end of the microRNA. Recen...
Martin Sturm, Michael Hackenberg, David Langenberg...