Sciweavers

812 search results - page 111 / 163
» Preference-based learning to rank
Sort
View
COLING
2010
13 years 3 months ago
Boosting Relation Extraction with Limited Closed-World Knowledge
This paper presents a new approach to improving relation extraction based on minimally supervised learning. By adding some limited closed-world knowledge for confidence estimation...
Feiyu Xu, Hans Uszkoreit, Sebastian Krause, Hong L...
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 11 months ago
Rank-loss support instance machines for MIML instance annotation
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich
KDD
2005
ACM
130views Data Mining» more  KDD 2005»
14 years 8 months ago
Simple and effective visual models for gene expression cancer diagnostics
In the paper we show that diagnostic classes in cancer gene expression data sets, which most often include thousands of features (genes), may be effectively separated with simple ...
Gregor Leban, Minca Mramor, Ivan Bratko, Blaz Zupa...
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 8 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 3 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King