Aggregation of partial rankings, p-ratings and top-m lists
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A user-friendly interface for evaluating preference queries over tabular data
Proceedings of the 26th annual ACM international conference on Design of communication
Computing distances between partial rankings
Information Processing Letters
Flexible and efficient querying and ranking on hyperlinked data sources
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Engineering search computing applications: vision and challenges
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
Mathematics of Operations Research
Preferential text classification: learning algorithms and evaluation measures
Information Retrieval
Generalized distances between rankings
Proceedings of the 19th international conference on World wide web
Deterministic algorithms for rank aggregation and other ranking and clustering problems
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Comparing and aggregating partially resolved trees
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Web search solved?: all result rankings the same?
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Kantorovich distances between rankings with applications to rank aggregation
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
A survey on representation, composition and application of preferences in database systems
ACM Transactions on Database Systems (TODS)
Picasso - to sing, you must close your eyes and draw
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
The nearest neighbor spearman footrule distance for bucket, interval, and partial orders
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Comparing and aggregating partially resolved trees
Theoretical Computer Science
PICASSO: automated soundtrack suggestion for multi-modal data
Proceedings of the 20th ACM international conference on Information and knowledge management
Reexamination of CBR hypothesis
ICCBR'10 Proceedings of the 18th international conference on Case-Based Reasoning Research and Development
Comparing and aggregating partial orders with kendall tau distances
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
A note on permutations and rank aggregation
Mathematical and Computer Modelling: An International Journal
Proceedings of the sixth ACM international conference on Web search and data mining
The Journal of Machine Learning Research
Incorporating the surfing behavior of web users into pagerank
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We provide a comprehensive picture of how to compare partial rankings, that is, rankings that allow ties. We propose several metrics to compare partial rankings and prove that they are within constant multiples of each other.