Top-d Rank Aggregation in Web Meta-search Engine

DOI10.1007/978-3-642-14553-7_6MaRDI QIDQ3587334zbMATH OpenOpenAlexFDO

Authors Qizhi Fang, Han Xiao, Shanfeng Zhu

Publication date 7 September 2010

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14553-7_6

zbMATH Keywords

\(\mathcal {NP}\)-hardapproximate algorithmcoherenceKendall-\(\tau \) distancePTASrank aggregation

Mathematics Subject Classification ID

Internet topics (68M11) Information storage and retrieval of data (68P20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• SOFSEM 2005: Theory and Practice of Computer Science
• scientific article; zbMATH DE number 1982658
• An efficient approach to extracting and ranking the top K interesting target ranks from Web search engines
• scientific article; zbMATH DE number 2036268

Cited in

(6)

• Approximate and dynamic rank aggregation
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Approximate rank aggregation (preliminary version)
• Rank aggregation: together we're strong
• scientific article; zbMATH DE number 2200791 (Why is no real title available?)

This page was built for publication: Top-d Rank Aggregation in Web Meta-search Engine

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