Searching for "Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin" – sorted by Relevance.
-
Corrigendum to “Efficient Similarity Search and Classification via Rank Aggregation ” by Ronald
- Corrigendum to “Efficient Similarity Search and Classification via Rank Aggregation” by Ronald
- Add To MetaCart
-
Efficient Similarity Search and Classification Via Rank Aggregation
- Efficient similarity search and classification via rank aggregation Ronald Fagin Ravi Kumar D
- Cited by 68 (3 self) – Add To MetaCart
-
Comparing and Aggregating Rankings with Ties
- Comparing and Aggregating Rankings with Ties Ronald Fagin ∗ Ravi Kumar ∗ Mohammad Mahdian † D
- Cited by 25 (1 self) – Add To MetaCart
-
Efficient Pairwise Classification and Ranking
- , Johannes Fürnkranz Efficient Pairwise Classification and Ranking A short version of this paper appeared as
- Add To MetaCart
-
Efficient aggregation of ranked inputs
- Efficient Aggregation of Ranked Inputs ∗ Nikos Mamoulis, Kit Hung Cheng, Man Lung Yiu, and David W
- Cited by 7 (3 self) – Add To MetaCart
-
Rank Aggregation Methods for the Web
- , and aggregate these rankings. 1.2 Challenges The ideal scenario for rank aggregation is when each judge (search
- Cited by 140 (4 self) – Add To MetaCart
-
Ranking Aggregates
- aggregation ranking queries efficiently. Hence, in this paper we propose new algorithms to handle this problem
- Cited by 4 (1 self) – Add To MetaCart
-
Efficient PageRank Approximation via Graph Aggregation
- Efficient PageRank Approximation via Graph Aggregation ABSTRACT Andrei Z. Broder ∗ IBM T.J. Watson
- Add To MetaCart
-
Similarity search via combinatorial nets
- Similarity Search via Combinatorial Nets Yury Lifshits ∗ Shengyu Zhang † California Institute
- Cited by 1 (0 self) – Add To MetaCart
-
An Efficient Reduction of Ranking to Classification
- TR2007-903 An Efficient Reduction of Ranking to Classification Nir Ailon 1 and Mehryar Mohri 2,1 1
- Cited by 2 (0 self) – Add To MetaCart

