scientific article; zbMATH DE number 2079318

MaRDI QIDQ4471270zbMATH OpenFDO

Authors Ronald Fagin, Ravi Kumar, D. Sivakumar

Publication date 28 July 2004

zbMATH Keywords

rank aggregation problem

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Combinatorics in computer science (68R05)

Recommendations

• Comparing Top k Lists
• An efficient approach for the rank aggregation problem
• Comparing Partial Rankings
• Computing distances between partial rankings
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists

Cited in

(15)

• Clustering-based multipopulation approaches in MOEA/D for many-objective problems
• Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking
• Influence ranking of road segments in urban road traffic networks
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Detecting the end of agreement between two long ranked lists
• Supporting various top-k queries over uncertain datasets
• Traps and Pitfalls of Topic-Biased PageRank
• Comparing Top k Lists
• HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
• Properties of distance spaces with power triangle inequalities
• Top-\(k\) list aggregation: mathematical formulations and polyhedral comparisons
• Comparing and aggregating partially resolved trees
• A scalable re-ranking method for content-based image retrieval
• How to choose a non-controversial list with \(k\) names
• Choose the damping, choose the ranking?

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471270)