Pages that link to "Item:Q5899505"

The following pages link to Aggregating inconsistent information (Q5899505):

Displaying 50 items.

• A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
• Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index) (Q258462) (← links)
• Comparison-based interactive collaborative filtering (Q266268) (← links)
• Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
• A statistical view of clustering performance through the theory of \(U\)-processes (Q392047) (← links)
• A randomized PTAS for the minimum consensus clustering with a fixed number of clusters (Q418755) (← links)
• Finding the closest ultrametric (Q476304) (← links)
• The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
• A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
• Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
• Branch-and-cut approaches for \(p\)-cluster editing (Q505422) (← links)
• Approximate association via dissociation (Q505447) (← links)
• Linear programming based approximation algorithms for feedback set problems in bipartite tournaments (Q534571) (← links)
• Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order (Q543787) (← links)
• Average parameterization and partial kernelization for computing medians (Q716309) (← links)
• Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem (Q724004) (← links)
• Fair correlation clustering with global and local guarantees (Q832884) (← links)
• On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
• Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
• Rank aggregation: new bounds for MCx (Q1630773) (← links)
• Predicting link directions via a recursive subgraph-based ranking (Q1673061) (← links)
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems (Q1688940) (← links)
• Exploring the median of permutations problem (Q1711664) (← links)
• Beyond rankings: comparing directed acyclic graphs (Q1715891) (← links)
• Using extension sets to aggregate partial rankings in a flexible setting (Q1733690) (← links)
• Stochastic transitivity: axioms and models (Q1735993) (← links)
• On the approximability of Dodgson and Young elections (Q1761290) (← links)
• Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
• On the hardness of maximum rank aggregation problems (Q2018536) (← links)
• Correlation clustering in data streams (Q2037102) (← links)
• Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs (Q2039649) (← links)
• A simple and improved parameterized algorithm for bicluster editing (Q2059879) (← links)
• The rankability of weighted data from pairwise comparisons (Q2069943) (← links)
• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis (Q2079285) (← links)
• An improved approximation algorithm for capacitated correlation clustering problem (Q2149853) (← links)
• Approximation algorithm for min-max correlation clustering problem with outliers (Q2150588) (← links)
• Approximation algorithms for two variants of correlation clustering problem (Q2156281) (← links)
• A linear ordering problem of sets (Q2173116) (← links)
• Space reduction constraints for the median of permutations problem (Q2181257) (← links)
• A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings (Q2184062) (← links)
• Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? (Q2186825) (← links)
• Byzantine preferential voting (Q2190409) (← links)
• Automedian sets of permutations: direct sum and shuffle (Q2220835) (← links)
• Algorithms and complexity results for labeled correlation clustering problem (Q2253964) (← links)
• Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
• Clustering with partial information (Q2268879) (← links)
• Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• A constructive solution to a problem of ranking tournaments (Q2329199) (← links)
• Parameterized algorithms for min-max 2-cluster editing (Q2410027) (← links)