Aggregating inconsistent information
From MaRDI portal
Publication:5899505
DOI10.1145/1411509.1411513zbMath1325.68102OpenAlexW2091858563MaRDI QIDQ5899505
Alantha Newman, Moses Charikar, Nir Ailon
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1411509.1411513
Related Items (92)
Comparison-based interactive collaborative filtering ⋮ Fair correlation clustering with global and local guarantees ⋮ Rank aggregation: new bounds for MCx ⋮ Comparison-Based Interactive Collaborative Filtering ⋮ An improved approximation algorithm for capacitated correlation clustering problem ⋮ Approximation algorithm for min-max correlation clustering problem with outliers ⋮ Approximation algorithms for two variants of correlation clustering problem ⋮ Robust Learning of Consumer Preferences ⋮ SingleCross-clustering: an algorithm for finding elongated clusters with automatic estimation of outliers and number of clusters ⋮ Cluster Editing ⋮ A linear ordering problem of sets ⋮ Predicting link directions via a recursive subgraph-based ranking ⋮ Parameterized algorithms for min-max 2-cluster editing ⋮ A data-driven matching algorithm for ride pooling problem ⋮ Space reduction constraints for the median of permutations problem ⋮ Kernel and fast algorithm for dense triplet inconsistency ⋮ Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds ⋮ A statistical view of clustering performance through the theory of \(U\)-processes ⋮ A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings ⋮ Recurring Comparison Faults: Sorting and Finding the Minimum ⋮ Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? ⋮ Correlation clustering and two-edge-connected augmentation for planar graphs ⋮ A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings ⋮ Evaluating balancing on social networks through the efficient solution of correlation clustering problems ⋮ A parameterized algorithm for subset feedback vertex set in tournaments ⋮ Byzantine preferential voting ⋮ On the hardness of labeled correlation clustering problem: a parameterized complexity view ⋮ Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number ⋮ Computing a feedback arc set using PageRank ⋮ Unnamed Item ⋮ Graph clustering with a constraint on cluster sizes ⋮ A randomized PTAS for the minimum consensus clustering with a fixed number of clusters ⋮ Approximate Condorcet partitioning: solving large-scale rank aggregation problems ⋮ Beyond the worst case: semi-random complexity analysis of winner determination ⋮ A combinatorial multi-armed bandit approach to correlation clustering ⋮ Effective Computation of a Feedback Arc Set Using PageRank ⋮ Computing kemeny rankings from \(d\)-Euclidean preferences ⋮ Exploring the median of permutations problem ⋮ Randomized Algorithms for Lexicographic Inference ⋮ Unnamed Item ⋮ Beyond rankings: comparing directed acyclic graphs ⋮ Automedian sets of permutations: direct sum and shuffle ⋮ Finding the closest ultrametric ⋮ Tight bounds for parameterized complexity of cluster editing with a small number of clusters ⋮ Using extension sets to aggregate partial rankings in a flexible setting ⋮ The feedback arc set problem with triangle inequality is a vertex cover problem ⋮ Ranking and Drawing in Subexponential Time ⋮ Stochastic transitivity: axioms and models ⋮ Proportional Approval Voting, Harmonic k-median, and Negative Association ⋮ A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization ⋮ Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions ⋮ On a semi-superwized graph clustering problem ⋮ APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM ⋮ Branch-and-cut approaches for \(p\)-cluster editing ⋮ Approximate association via dissociation ⋮ Algorithms and complexity results for labeled correlation clustering problem ⋮ Linear programming based approximation algorithms for feedback set problems in bipartite tournaments ⋮ On the approximability of Dodgson and Young elections ⋮ Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order ⋮ Unnamed Item ⋮ Branch-and-price for \(p\)-cluster editing ⋮ Fixed-parameter tractability results for feedback set problems in tournaments ⋮ Clustering with partial information ⋮ On the hardness of maximum rank aggregation problems ⋮ Average parameterization and partial kernelization for computing medians ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Partial Kernelization for Rank Aggregation: Theory and Experiments ⋮ Cluster Editing: Kernelization Based on Edge Cuts ⋮ Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem ⋮ Medians of Permutations: Building Constraints ⋮ Ranking tournaments with no errors. I: Structural description ⋮ Correlation clustering in data streams ⋮ Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs ⋮ Quantum bridge analytics. I: A tutorial on formulating and using QUBO models ⋮ Quantum bridge analytics. I: A tutorial on formulating and using QUBO models ⋮ A unified framework for clustering constrained data without locality property ⋮ Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems ⋮ The Branch and Cut Method for the Clique Partitioning Problem ⋮ A simple and improved parameterized algorithm for bicluster editing ⋮ Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number ⋮ An Algorithmic View of Voting ⋮ The rankability of weighted data from pairwise comparisons ⋮ Fixed-parameter algorithms for Kemeny rankings ⋮ Improved Parameterized Algorithms for the Kemeny Aggregation Problem ⋮ A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis ⋮ A constructive solution to a problem of ranking tournaments ⋮ Time-homogeneous top-K ranking using tensor decompositions ⋮ A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation ⋮ Metric-Constrained Optimization for Graph Clustering Algorithms ⋮ A fast branching algorithm for cluster vertex deletion ⋮ Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index)
This page was built for publication: Aggregating inconsistent information
