An unsupervised learning algorithm for rank aggregation

Alexandre Klementiev; Dan Roth; Kevin Small

doi:10.1007/978-3-540-74958-5_60

An unsupervised learning algorithm for rank aggregation

Alexandre Klementiev, Dan Roth, Kevin Small

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as opposed to a classification. Furthermore, for many such problems, multiple established ranking models have been well studied and it is desirable to combine their results into a joint ranking, a formalism denoted as rank aggregation. This work presents a novel unsupervised learning algorithm for rank aggregation (ULARA) which returns a linear combination of the individual ranking functions based on the principle of rewarding ordering agreement between the rankers. In addition to presenting ULARA, we demonstrate its effectiveness on a data fusion task across ad hoc retrieval systems.

Original language	English (US)
Title of host publication	Machine Learning
Subtitle of host publication	ECML 2007 - 18th European Conference on Machine Learning, Proceedings
Publisher	Springer
Pages	616-623
Number of pages	8
ISBN (Print)	9783540749578
DOIs	https://doi.org/10.1007/978-3-540-74958-5_60
State	Published - 2007
Event	18th European Conference on Machine Learning, ECML 2007 - Warsaw, Poland Duration: Sep 17 2007 → Sep 21 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4701 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	18th European Conference on Machine Learning, ECML 2007
Country/Territory	Poland
City	Warsaw
Period	9/17/07 → 9/21/07

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Online availability

10.1007/978-3-540-74958-5_60

Library availability

Discover UIUC Full Text

Cite this

Klementiev, A., Roth, D., & Small, K. (2007). An unsupervised learning algorithm for rank aggregation. In Machine Learning: ECML 2007 - 18th European Conference on Machine Learning, Proceedings (pp. 616-623). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4701 LNAI). Springer. https://doi.org/10.1007/978-3-540-74958-5_60

An unsupervised learning algorithm for rank aggregation. / Klementiev, Alexandre; Roth, Dan; Small, Kevin.
Machine Learning: ECML 2007 - 18th European Conference on Machine Learning, Proceedings. Springer, 2007. p. 616-623 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4701 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Klementiev, A, Roth, D & Small, K 2007, An unsupervised learning algorithm for rank aggregation. in Machine Learning: ECML 2007 - 18th European Conference on Machine Learning, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4701 LNAI, Springer, pp. 616-623, 18th European Conference on Machine Learning, ECML 2007, Warsaw, Poland, 9/17/07. https://doi.org/10.1007/978-3-540-74958-5_60

Klementiev A, Roth D, Small K. An unsupervised learning algorithm for rank aggregation. In Machine Learning: ECML 2007 - 18th European Conference on Machine Learning, Proceedings. Springer. 2007. p. 616-623. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-74958-5_60

@inproceedings{9c8d9a2cd697427fb70aa1c44ff66f24,

title = "An unsupervised learning algorithm for rank aggregation",

abstract = "Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as opposed to a classification. Furthermore, for many such problems, multiple established ranking models have been well studied and it is desirable to combine their results into a joint ranking, a formalism denoted as rank aggregation. This work presents a novel unsupervised learning algorithm for rank aggregation (ULARA) which returns a linear combination of the individual ranking functions based on the principle of rewarding ordering agreement between the rankers. In addition to presenting ULARA, we demonstrate its effectiveness on a data fusion task across ad hoc retrieval systems.",

author = "Alexandre Klementiev and Dan Roth and Kevin Small",

year = "2007",

doi = "10.1007/978-3-540-74958-5_60",

language = "English (US)",

isbn = "9783540749578",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "616--623",

booktitle = "Machine Learning",

address = "Germany",

}

TY - GEN

T1 - An unsupervised learning algorithm for rank aggregation

AU - Klementiev, Alexandre

AU - Roth, Dan

AU - Small, Kevin

PY - 2007

Y1 - 2007

N2 - Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as opposed to a classification. Furthermore, for many such problems, multiple established ranking models have been well studied and it is desirable to combine their results into a joint ranking, a formalism denoted as rank aggregation. This work presents a novel unsupervised learning algorithm for rank aggregation (ULARA) which returns a linear combination of the individual ranking functions based on the principle of rewarding ordering agreement between the rankers. In addition to presenting ULARA, we demonstrate its effectiveness on a data fusion task across ad hoc retrieval systems.

AB - Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as opposed to a classification. Furthermore, for many such problems, multiple established ranking models have been well studied and it is desirable to combine their results into a joint ranking, a formalism denoted as rank aggregation. This work presents a novel unsupervised learning algorithm for rank aggregation (ULARA) which returns a linear combination of the individual ranking functions based on the principle of rewarding ordering agreement between the rankers. In addition to presenting ULARA, we demonstrate its effectiveness on a data fusion task across ad hoc retrieval systems.

UR - http://www.scopus.com/inward/record.url?scp=38049129511&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38049129511&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-74958-5_60

DO - 10.1007/978-3-540-74958-5_60

M3 - Conference contribution

AN - SCOPUS:38049129511

SN - 9783540749578

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 616

EP - 623

BT - Machine Learning

PB - Springer

T2 - 18th European Conference on Machine Learning, ECML 2007

Y2 - 17 September 2007 through 21 September 2007

ER -

An unsupervised learning algorithm for rank aggregation

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this