Studies on Ordinal Ranking with Regression
碩士 === 國立臺灣大學 === 資訊網路與多媒體研究所 === 99 === Ranking is a popular research problem in recent years and has been used in wide range of applications including web-search engines and recommendation systems. In this thesis, we study on two ranking problems, the ordinal ranking problem and the top-rank probl...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/92435005019182336531 |
id |
ndltd-TW-099NTU05641007 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-099NTU056410072015-10-16T04:02:49Z http://ndltd.ncl.edu.tw/handle/92435005019182336531 Studies on Ordinal Ranking with Regression 迴歸於序數評等之研究 Yu-Xun Ruan 阮昱勳 碩士 國立臺灣大學 資訊網路與多媒體研究所 99 Ranking is a popular research problem in recent years and has been used in wide range of applications including web-search engines and recommendation systems. In this thesis, we study on two ranking problems, the ordinal ranking problem and the top-rank problem. We propose a novel ranking approach, cost-sensitive ordinal classification via regression (COCR), which respects the discrete nature of the ordinal ranks in real-world data sets. In particular, COCR applies a theoretically-sound reduction from ordinal to binary classification and solves the binary classification sub-tasks with point-wise regression. Furthermore, COCR allows specifying mis-ranking costs to further boost the ranking performance. We conduct experiments on two ranking problems respectively. On the ordinal ranking problem, we compare different approaches based on decision trees. The results show that the proposed COCR can perform better on many data sets when coupled with the appropriate cost. Furthermore, on the top-rank problem, we derive the corresponding cost of a popular ranking criterion, Expected Reciprocal Rank (ERR), and plug the cost into the COCR approach. The resulting ERR-tuned COCR enjoys the benefits of both efficiency by using point-wise regression and top-rank prediction accuracy from the ERR criterion. Evaluations on two large-scale data sets, including ``Yahoo! Learning to Rank Challenge'' and ``Microsoft Learning to Rank'', verify that some basic COCR settings outperform commonly-used regression approaches significantly. In addition, even better performance can often be achieved by the ERR-tuned COCR. Hsuan-Tien Lin 林軒田 2011 學位論文 ; thesis 53 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣大學 === 資訊網路與多媒體研究所 === 99 === Ranking is a popular research problem in recent years and has been used in wide range of applications including
web-search engines and recommendation systems.
In this thesis, we study on two ranking problems, the ordinal ranking problem and the top-rank problem.
We propose a novel ranking approach, cost-sensitive ordinal classification via regression (COCR), which respects the discrete nature of the ordinal ranks in real-world data sets. In particular, COCR applies a theoretically-sound reduction from ordinal to binary classification
and solves the binary classification sub-tasks with point-wise regression. Furthermore, COCR allows specifying mis-ranking costs to further boost the ranking performance.
We conduct experiments on two ranking problems respectively.
On the ordinal ranking problem, we compare different approaches based on decision trees.
The results show that the proposed COCR can perform better on many data sets when coupled with the appropriate cost.
Furthermore, on the top-rank problem, we derive the corresponding cost of a popular ranking criterion, Expected Reciprocal Rank (ERR), and plug the cost into the COCR approach. The resulting ERR-tuned COCR enjoys the benefits of both efficiency by using point-wise regression and top-rank prediction accuracy from the ERR criterion.
Evaluations on two large-scale data sets, including
``Yahoo! Learning to Rank Challenge'' and ``Microsoft Learning to Rank'', verify that some basic COCR settings outperform commonly-used regression approaches significantly. In addition, even better performance can often be achieved by the ERR-tuned COCR.
|
author2 |
Hsuan-Tien Lin |
author_facet |
Hsuan-Tien Lin Yu-Xun Ruan 阮昱勳 |
author |
Yu-Xun Ruan 阮昱勳 |
spellingShingle |
Yu-Xun Ruan 阮昱勳 Studies on Ordinal Ranking with Regression |
author_sort |
Yu-Xun Ruan |
title |
Studies on Ordinal Ranking with Regression |
title_short |
Studies on Ordinal Ranking with Regression |
title_full |
Studies on Ordinal Ranking with Regression |
title_fullStr |
Studies on Ordinal Ranking with Regression |
title_full_unstemmed |
Studies on Ordinal Ranking with Regression |
title_sort |
studies on ordinal ranking with regression |
publishDate |
2011 |
url |
http://ndltd.ncl.edu.tw/handle/92435005019182336531 |
work_keys_str_mv |
AT yuxunruan studiesonordinalrankingwithregression AT ruǎnyùxūn studiesonordinalrankingwithregression AT yuxunruan huíguīyúxùshùpíngděngzhīyánjiū AT ruǎnyùxūn huíguīyúxùshùpíngděngzhīyánjiū |
_version_ |
1718091593727082496 |