Sciweavers

2100 search results - page 211 / 420
» Learning to rank on graphs
Sort
View
PRL
2007
100views more  PRL 2007»
15 years 6 months ago
Visible models for interactive pattern recognition
The bottleneck in interactive visual classification is the exchange of information between human and machine. We introduce the concept of the visible model, which is an ion of an ...
Jie Zou, George Nagy
IR
2010
15 years 5 months ago
Adapting boosting for information retrieval measures
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...
Qiang Wu, Christopher J. C. Burges, Krysta Marie S...
ICASSP
2011
IEEE
14 years 10 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...
PAMI
2012
13 years 9 months ago
CPMC: Automatic Object Segmentation Using Constrained Parametric Min-Cuts
—We present a novel framework to generate and rank plausible hypotheses for the spatial extent of objects in images using bottom-up computational processes and mid-level selectio...
João Carreira, Cristian Sminchisescu
AIRWEB
2008
Springer
15 years 8 months ago
Web spam identification through content and hyperlinks
We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as we...
Jacob Abernethy, Olivier Chapelle, Carlos Castillo