Sciweavers

2712 search results - page 386 / 543
» On learning algorithm selection for classification
Sort
View
88
Voted
ICANN
2003
Springer
15 years 6 months ago
Expectation-MiniMax Approach to Clustering Analysis
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
Yiu-ming Cheung
106
Voted
ICCV
2005
IEEE
15 years 6 months ago
Contour-Based Learning for Object Detection
We present a novel categorical object detection scheme that uses only local contour-based features. A two-stage, partially supervised learning architecture is proposed: a rudiment...
Jamie Shotton, Andrew Blake, Roberto Cipolla
ECAI
2000
Springer
15 years 5 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
FOIKS
2008
Springer
15 years 9 months ago
Cost-minimising strategies for data labelling : optimal stopping and active learning
Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$...
Christos Dimitrakakis, Christian Savu-Krohn
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 1 months ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims