Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Evaluating strategies for similarity search on the web
Proceedings of the 11th international conference on World Wide Web
Condorcet fusion for improved retrieval
Proceedings of the eleventh international conference on Information and knowledge management
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Cranking: Combining Rankings Using Conditional Probability Models on Permutations
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
WWW '03 Proceedings of the 12th international conference on World Wide Web
Efficient similarity search and classification via rank aggregation
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Web metasearch: rank vs. score based rank aggregation methods
Proceedings of the 2003 ACM symposium on Applied computing
Journal of Artificial Intelligence Research
Link analysis ranking: algorithms, theory, and experiments
ACM Transactions on Internet Technology (TOIT)
Building an open source meta-search engine
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
To randomize or not to randomize: space optimal summaries for hyperlink analysis
Proceedings of the 15th international conference on World Wide Web
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Ordering the attributes of query results
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithms for discovering bucket orders from data
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Supplement of partial ranks to the data fusion
WebMedia '06 Proceedings of the 12th Brazilian Symposium on Multimedia and the web
Rank Distance with Applications in Similarity of Natural Languages
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
An outranking approach for rank aggregation in information retrieval
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Aggregation of partial rankings, p-ratings and top-m lists
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A personalized search engine based on Web-snippet hierarchical clustering
Software—Practice & Experience
Discovering bucket orders from full rankings
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Label Ranking in Case-Based Reasoning
ICCBR '07 Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Mining search engine query logs via suggestion sampling
Proceedings of the VLDB Endowment
A user-friendly interface for evaluating preference queries over tabular data
Proceedings of the 26th annual ACM international conference on Design of communication
Finding Total and Partial Orders from Data for Seriation
DS '08 Proceedings of the 11th International Conference on Discovery Science
Developing Preference Band Model to Manage Collective Preferences
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Flexible and efficient querying and ranking on hyperlinked data sources
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
ICCPOL '09 Proceedings of the 22nd International Conference on Computer Processing of Oriental Languages. Language Technology for the Knowledge-based Economy
Top-k queries on uncertain data: on score distribution and typical answers
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Generating a non-English subjectivity lexicon: relations that matter
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Preferential text classification: learning algorithms and evaluation measures
Information Retrieval
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Median based network selection in heterogeneous wireless networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Visualizing sets of partial rankings
IDA'07 Proceedings of the 7th international conference on Intelligent data analysis
Joint cutoff probabilistic estimation using simulation: a mailing campaign application
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
Order-based equivalence degrees for similarity and distance measures
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
A survey on representation, composition and application of preferences in database systems
ACM Transactions on Database Systems (TODS)
Using medians to generate consensus rankings for biological data
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
ECML'06 Proceedings of the 17th European conference on Machine Learning
Hybrid voting protocols and hardness of manipulation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
PolarityRank: Finding an equilibrium between followers and contraries in a network
Information Processing and Management: an International Journal
Cognition-Inspired fuzzy modelling
WCCI'12 Proceedings of the 2012 World Congress conference on Advances in Computational Intelligence
Rank Distance with Applications in Similarity of Natural Languages
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Experiments on hybrid corpus-based sentiment lexicon acquisition
HYBRID '12 Proceedings of the Workshop on Innovative Hybrid Approaches to the Processing of Textual Data
A model of uncertainty for near-duplicates in document reference networks
ECDL'07 Proceedings of the 11th European conference on Research and Advanced Technology for Digital Libraries
Relevance ranking metrics for learning objects
EC-TEL'07 Proceedings of the Second European conference on Technology Enhanced Learning: creating new learning experiences on a global scale
Information Systems
Bulk sorted access for efficient top-k retrieval
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Penguins in sweaters, or serendipitous entity search on user-generated content
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
Rank aggregation has recently been proposed as a useful abstraction that has several applications, including meta-search, synthesizing rank functions from multiple indices, similarity search, and classification. In database applications (catalog searches, fielded searches, parametric searches, etc.), the rankings are produced by sorting an underlying database according to various fields. Typically, there are a number of fields that each have very few distinct values, and hence the corresponding rankings have many ties in them. Known methods for rank aggregation are poorly suited to this context, and the difficulties can be traced back to the fact that we do not have sound mathematical principles to compare two partial rankings, that is, rankings that allow ties.In this work, we provide a comprehensive picture of how to compare partial rankings, We propose several metrics to compare partial rankings, present algorithms that efficiently compute them, and prove that they are within constant multiples of each other. Based on these concepts, we formulate aggregation problems for partial rankings, and develop a highly efficient algorithm to compute the top few elements of a near-optimal aggregation of multiple partial rankings. In a model of access that is suitable for databases, our algorithm reads essentially as few elements of each partial ranking as are necessary to determine the winner(s).