2016Unpublished venueRequires access

PrefRank: Quantification and Aggregation of Subjective User Preferences

Anirban Basu, Shinsaku Kiyomoto, Jaideep S. Vaidya, Stephen Marsh

Open publisher page 0 citations

Abstract

User-contributed content on the Internet has been growing at an extraordinary pace. Ranking vast amounts of such content, such as digital photographs, is handled well through user-driven ranking. It helps speeding up the ranking process while reflecting the opinions of the community. However, user-driven ranking can be often subjective and difficult to compare. We solve this using a well-known mathematical technique called the analytic hierarchy process. Due to the massive size of the user-contributed content, it is often not possible for all users to rank all items. Thus, finding a global ranking is a problem of rank aggregation of partially ranked lists. In this position paper, we propose a solution - PrefRank - based on eigenvector centrality that helps aggregating partially ranked lists. Our proposed approach can be used in other application scenarios involving qualitative judgement and ranking, such as reviewing academic papers for a conference.

About this research paper

What this paper is about

User-contributed content on the Internet has been growing at an extraordinary pace. Ranking vast amounts of such content, such as digital photographs, is handled well through user-driven ranking. It helps speeding up the ranking process while reflecting the opinions of the community. However, user-driven ranking can be often subjective and difficult to compare. We solve this using a well-known mathematical technique called the analytic hierarchy process. Due to the massive size of the user-contributed content, it is often not possible for all users to rank all items. Thus, finding a global ranking is a problem of rank aggregation of partially ranked lists. In this position paper, we propose a solution - PrefRank - based on eigenvector centrality that helps aggregating partially ranked lists. Our proposed approach can be used in other application scenarios involving qualitative judgement and ranking, such as reviewing academic papers for a conference.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

User-contributed content on the Internet has been growing at an extraordinary pace. Ranking vast amounts of such content, such as digital photographs, is handled well through user-driven ranking. It helps speeding up the ranking process while reflecting the opinions of the community. However, user-driven ranking can be often subjective and difficult to compare. We solve this using a well-known mathematical technique called the analytic hierarchy process. Due to the massive size of the user-contributed content, it is often not possible for all users to rank all items. Thus, finding a global ranking is a problem of rank aggregation of partially ranked lists. In this position paper, we propose a solution - PrefRank - based on eigenvector centrality that helps aggregating partially ranked lists. Our proposed approach can be used in other application scenarios involving qualitative judgement and ranking, such as reviewing academic papers for a conference.

Key concepts: Ranking (information retrieval), Computer science, Information retrieval, Rank (graph theory), Centrality, Analytic hierarchy process, Judgement, Pace

Related papers

Back to paper searchBrowse research topicsOriginal source
PrefRank: Quantification and Aggregation of Subjective User Preferences — Research Paper | ScholarLens