Sciweavers

2100 search results - page 183 / 420
» Learning to rank on graphs
Sort
View
JMLR
2006
124views more  JMLR 2006»
15 years 6 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
ACL
2004
15 years 8 months ago
Enriching the Output of a Parser Using Memory-based Learning
We describe a method for enriching the output of a parser with information available in a corpus. The method is based on graph rewriting using memorybased learning, applied to dep...
Valentin Jijkoun, Maarten de Rijke
ECML
2007
Springer
16 years 21 days ago
An Improved Model Selection Heuristic for AUC
Abstract. The area under the ROC curve (AUC) has been widely used to measure ranking performance for binary classification tasks. AUC only employs the classifier’s scores to ra...
Shaomin Wu, Peter A. Flach, Cèsar Ferri Ram...
MLDM
2007
Springer
16 years 20 days ago
Ensemble-based Feature Selection Criteria
Recursive Feature Elimination (RFE) combined with feature ranking is an effective technique for eliminating irrelevant features when the feature dimension is large, but it is diffi...
Terry Windeatt, Matthew Prior, Niv Effron, Nathan ...
GROUP
2010
ACM
15 years 4 months ago
Searching for reputable source code on the web
Looking for source code on the Web is a common practice among software developers. Previous research has shown that developers use social cues over technical cues to evaluate sour...
Rosalva E. Gallardo-Valencia, Phitchayaphong Tanti...