NDLI: Comparing and aggregating rankings with ties

Please wait, while we are loading the content...

The Lixto data extraction project: back and forth between theory and practice

Conditional XPath, the first order complete XPath dialect

The past, present and future of web information retrieval

Comparing and aggregating rankings with ties

Specification and verification of data-driven web services

A characterization of first-order topological properties of planar spatial data

Clustering via matrix powering

On the memory requirements of XPath evaluation over XML streams

Trees, automata and XML

On the complexity of optimal K-anonymity

Adaptive sampling for geometric problems over data streams

On the decidability of containment of recursive datalog queries - preliminary report

Frontiers of tractability for typechecking simple XML transformations

Using non-linear dynamical systems for web searching and ranking

Composing schema mappings: second-order dependencies to the rescue

Roads, codes, and spatiotemporal queries

Computational complexity of itemset frequency satisfiability

Conjunctive queries over trees

Locally consistent transformations and query answering in data exchange

Flexible time management in data stream systems

Processing first-order queries under limited access patterns

Positive active XML

Foundations of semantic web databases

Replicated declustering of spatial data

k-means projective clustering

Synopses for query optimization: a space-complexity perspective

Logical foundations of peer-to-peer data integration

Power-conserving computation of order-statistics over sensor networks

On preservation under homomorphisms and unions of conjunctive queries

Deterministic wavelet thresholding for maximum-error metrics

Weighted hypertree decompositions and optimal query plans

Approximate counts and quantiles over sliding windows

Multi-valued dependencies in the presence of lists

Comparing and aggregating rankings with ties

Content Provider	ACM Digital Library
Author	Kumar, Ravi Vee, Erik Fagin, Ronald Mahdian, Mohammad Sivakumar, D.
Abstract	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).
Starting Page	47
Ending Page	58
Page Count	12
File Format	PDF
ISBN	158113858X
DOI	10.1145/1055558.1055568
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2004-06-14
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Comparing and Aggregating Rankings with Ties (2003)

Aggregating rankings with positional constraints

Relationships Between $l^1 $ Metrics on Rankings: The Case of Ties

A Weighted Correlation Index for Rankings with Ties

A weighted correlation index for rankings with ties (2014)

A cognitive model for aggregating people's rankings.

Comparing series of rankings with ties by using complex networks: An analysis of the spanish stock market (IBEX-35 index)

A New Correlation Coefficient for Aggregating Non-strict and Incomplete Rankings

Comparing and aggregating rankings with ties (2004)

Comparing and aggregating rankings with ties

Similar Documents

Comparing and Aggregating Rankings with Ties (2003)

Aggregating rankings with positional constraints

Relationships Between $l^1 $ Metrics on Rankings: The Case of Ties

A Weighted Correlation Index for Rankings with Ties

A weighted correlation index for rankings with ties (2014)

A cognitive model for aggregating people's rankings.

Comparing series of rankings with ties by using complex networks: An analysis of the spanish stock market (IBEX-35 index)

A New Correlation Coefficient for Aggregating Non-strict and Incomplete Rankings

Comparing and aggregating rankings with ties (2004)

Comparing and aggregating rankings with ties