
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
The process of rank aggregation is intimately intertwined with
the structure of skewsymmetric matrices.
We apply recent advances in the theory and algorithms of matrix completion
to skewsymmetric matrices. This combination of ideas
produces a new method for ranking a set of items. The essence
of our idea is that a rank aggregation describes a partially
filled skewsymmetric matrix. We extend an algorithm for
matrix completion to handle skewsymmetric data and use that
to extract ranks for each item.
Our algorithm applies to both pairwise comparison and rating data.
Because it is based on matrix completion, it is robust to
both noise and incomplete data. We show a formal
recovery result for the noiseless case and
present a detailed study of the algorithm on synthetic
data and Netflix ratings.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment