Ranking algorithms are deployed widely to order a set of items in applications such as
search engines, news feeds, and recommendation systems. Recent studies, however, have …

Spearman's footrule and Kendall's tau are two well established distances between rankings.
They, however, fail to take into account concepts crucial to evaluating a result set in …

Recommender systems have become an important personalization technique on the web
and are widely used especially in e-commerce applications. However, operators of web …

We study the problem of aggregating partial rankings. This problem is motivated by
applications such as meta-searching and information retrieval, search engine spam fighting …

Preferences have been traditionally studied in philosophy, psychology, and economics and
applied to decision making problems. Recently, they have attracted the attention of …

We consider the problem of finding a ranking of a set of elements that is “closest to” a given
set of input rankings of the elements; more precisely, we want to find a permutation that …

Given multiple individual rank orders over a set of candidates or items, where the candidates
belong to multiple (non-binary) protected groups, we study the classical rank aggregation …

We consider ranking and clustering problems related to the aggregation of inconsistent
information, in particular, rank aggregation,(weighted) feedback arc set in tournaments …

The frame approach for representing knowledge (ie, collection of frames are linked together
into frame-system) has been suggested by Marvin Minsky. In this approach, the frame …

In this paper, we present a new view of the PageRank algorithm inspired by multiplex
networks. This new approach allows to introduce a new centrality measure for classic …