Visualizing Sets of Partial Rankings
published: Oct. 8, 2007, recorded: September 2007, views: 3604
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Partial rankings are totally ordered subsets of a set of items. They arise in different applications, such as clickstream analysis and collaborative filtering, but can be difficult to analyze with traditional data analysis techniques as they are combinatorial structures. We propose a method for creating scatterplots of sets of partial rankings by first representing them in a high-dimensional space and then applying known dimensionality reduction methods. We compare different approaches by using quantitative measures and demonstrate the methods on real data sets from different application domains. Despite their simplicity the proposed methods can produce useful visualizations that are easy to interpret.
Download slides: ida07_ljubljana_ukkonen_antti.pdf (595.0 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !
Write your own review or comment: