[go: up one dir, main page]

Dwork et al., 2001 - Google Patents

Rank aggregation revisited

Dwork et al., 2001

View PDF
Document ID
3243852624201404927
Author
Dwork C
Kumar R
Naor M
Sivakumar D
Publication year

External Links

Snippet

The rank aggregation problem is to combine many different rank orderings on the same set of candidates, or alternatives, in order to obtain a “better” ordering. Rank aggregation has been studied extensively in the context of social choice theory, where several “voting …
Continue reading at rohitvaish.in (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30634—Querying
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • G06F17/30864—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems
    • G06F17/30867—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems with filtering and personalisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices

Similar Documents

Publication Publication Date Title
Dwork et al. Rank aggregation revisited
US7188106B2 (en) System and method for aggregating ranking results from various sources to improve the results of web searching
Dwork et al. Rank aggregation methods for the web
Schalekamp et al. Rank aggregation: Together we're strong
Conitzer Eliciting single-peaked preferences using comparison queries
Montague et al. Condorcet fusion for improved retrieval
Brandt et al. Bypassing combinatorial protections: Polynomial-time algorithms for single-peaked electorates
Gamson A theory of coalition formation
Fagin et al. Comparing and aggregating rankings with ties
Bailey et al. Retrieval consistency in the presence of query variations
Bredereck et al. Parameterized algorithmics for computational social choice: Nine research challenges
Procaccia et al. A maximum likelihood approach for selecting sets of alternatives
Dutta et al. Voting by successive elimination and strategic candidacy
Walsh et al. Lot-based voting rules.
Hammond Toward a general theory of hierarchy: Books, bureaucrats, basketball tournaments, and the administrative structure of the nation-state
Fishburn et al. An analysis of voting procedures with nonranked voting
Dey et al. Elicitation for preferences single peaked on trees
Chebotarev et al. Preference fusion when the number of alternatives exceeds two: indirect scoring procedures
van Den Brink et al. Digraph competitions and cooperative games
Hamilton et al. The many routes to the ubiquitous Bradley-Terry model
De Berg et al. On one-round discrete Voronoi games
Martignon et al. Simplicity and robustness of fast and frugal heuristics
Haggard Discrete mathematics for computer science
Balreira et al. An Oracle method to predict NFL games
Kozma Binary search trees, rectangles and patterns