Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Weighted Kendall"”.

  1. A novel weighted rank aggregation algorithm with applications in gene prioritization

    … solution of rank aggregation problems based on weighted Kendall distances. The algorithms represent linear programming relaxations of integer programs that involve variables reflecting partial orders of three or more candidates. Our simulation results indicate that the linear programs give …

    uiuc Repository record for A novel weighted rank aggregation algorithm with applications in gene prioritization (opens in a new tab)

  2. Distances on rankings: from social choice to flash memories

    From social choice to statistics to coding theory, rankings are found to be a useful vehicle for storing and presenting information in modern data systems. Often, in order to process the information, an appropriately defined distance on rankings is required or at least helpful. For example, in …

    uiuc Repository record for Distances on rankings: from social choice to flash memories (opens in a new tab)