Sciweavers

812 search results - page 125 / 163
» Preference-based learning to rank
Sort
View
DASFAA
2007
IEEE
139views Database» more  DASFAA 2007»
15 years 6 months ago
Self-tuning in Graph-Based Reference Disambiguation
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad M...
109
Voted
IJCNN
2006
IEEE
15 years 6 months ago
Leave-One-Out Cross-Validation Based Model Selection Criteria for Weighted LS-SVMs
Abstract— While the model parameters of many kernel learning methods are given by the solution of a convex optimisation problem, the selection of good values for the kernel and r...
Gavin C. Cawley
SAC
2010
ACM
15 years 5 months ago
Data stream anomaly detection through principal subspace tracking
We consider the problem of anomaly detection in multiple co-evolving data streams. In this paper, we introduce FRAHST (Fast Rank-Adaptive row-Householder Subspace Tracking). It au...
Pedro Henriques dos Santos Teixeira, Ruy Luiz Mili...
88
Voted
ACL
2007
15 years 1 months ago
Sparse Information Extraction: Unsupervised Language Models to the Rescue
Even in a massive corpus such as the Web, a substantial fraction of extractions appear infrequently. This paper shows how to assess the correctness of sparse extractions by utiliz...
Doug Downey, Stefan Schoenmackers, Oren Etzioni
102
Voted
TREC
2004
15 years 1 months ago
Conceptual Language Models for Context-Aware Text Retrieval
While participating in the HARD track our first question was, what an IR-application should look like that takes into account preference meta-data from the user, without the need ...
Henning Rode, Djoerd Hiemstra