DEARank: a data-envelopment-analysis-based ranking method
Gespeichert in:
Verfasser / Beitragende:
[Chunheng Jiang, Wenbin Lin]
Ort, Verlag, Jahr:
2015
Enthalten in:
Machine Learning, 101/1-3(2015-10-01), 415-435
Format:
Artikel (online)
Online Zugang:
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605477841 | ||
| 003 | CHVBK | ||
| 005 | 20210128100403.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20151001xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s10994-014-5442-3 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s10994-014-5442-3 | ||
| 245 | 0 | 0 | |a DEARank: a data-envelopment-analysis-based ranking method |h [Elektronische Daten] |c [Chunheng Jiang, Wenbin Lin] |
| 520 | 3 | |a A new weak-ranker construction method based on Data Envelopment Analysis technique is presented. Each weak ranker represents a feature subset drawn from the complete feature space. Two linear programming models are formulated, both of which treat the documents to be ranked as the decision making units. By solving the models, we constructa pool of weak-ranker candidates from the optimal weight vectors, and then develop DEARank algorithm based on Boosting technique. We conduct extensive experiments on LETOR 3.0 and LETOR 4.0 collections, with twelve well-known algorithms as the baselines. The experimental results indicate that DEARank is a competitive learning to rank algorithm. | |
| 540 | |a The Author(s), 2014 | ||
| 690 | 7 | |a Learning to rank |2 nationallicence | |
| 690 | 7 | |a Listwise |2 nationallicence | |
| 690 | 7 | |a Data envelopment analysis |2 nationallicence | |
| 690 | 7 | |a Boosting |2 nationallicence | |
| 700 | 1 | |a Jiang |D Chunheng |u School of Mathematics, Southwest Jiaotong University, Chengdu, China |4 aut | |
| 700 | 1 | |a Lin |D Wenbin |u School of Physical Science and Technology, Southwest Jiaotong University, Chengdu, China |4 aut | |
| 773 | 0 | |t Machine Learning |d Springer US; http://www.springer-ny.com |g 101/1-3(2015-10-01), 415-435 |x 0885-6125 |q 101:1-3<415 |1 2015 |2 101 |o 10994 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s10994-014-5442-3 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s10994-014-5442-3 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Jiang |D Chunheng |u School of Mathematics, Southwest Jiaotong University, Chengdu, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Lin |D Wenbin |u School of Physical Science and Technology, Southwest Jiaotong University, Chengdu, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Machine Learning |d Springer US; http://www.springer-ny.com |g 101/1-3(2015-10-01), 415-435 |x 0885-6125 |q 101:1-3<415 |1 2015 |2 101 |o 10994 | ||