Approximate correlation clustering using same-cluster queries
From MaRDI portal
Abstract: Ashtiani et al. (NIPS 2016) introduced a semi-supervised framework for clustering (SSAC) where a learner is allowed to make same-cluster queries. More specifically, in their model, there is a query oracle that answers queries of the form given any two vertices, do they belong to the same optimal cluster?. Ashtiani et al. showed the usefulness of such a query framework by giving a polynomial time algorithm for the k-means clustering problem where the input dataset satisfies some separation condition. Ailon et al. extended the above work to the approximation setting by giving an efficient (1+eps)-approximation algorithm for k-means for any small eps > 0 and any dataset within the SSAC framework. In this work, we extend this line of study to the correlation clustering problem. Correlation clustering is a graph clustering problem where pairwise similarity (or dissimilarity) information is given for every pair of vertices and the objective is to partition the vertices into clusters that minimise the disagreement (or maximises agreement) with the pairwise information given as input. These problems are popularly known as MinDisAgree and MaxAgree problems, and MinDisAgree[k] and MaxAgree[k] are versions of these problems where the number of optimal clusters is at most k. There exist Polynomial Time Approximation Schemes (PTAS) for MinDisAgree[k] and MaxAgree[k] where the approximation guarantee is (1+eps) for any small eps and the running time is polynomial in the input parameters but exponential in k and 1/eps. We obtain an (1+eps)-approximation algorithm for any small eps with running time that is polynomial in the input parameters and also in k and 1/eps. We also give non-trivial upper and lower bounds on the number of same-cluster queries, the lower bound being based on the Exponential Time Hypothesis (ETH).
Recommendations
- Approximate Clustering with Same-Cluster Queries
- Correlation clustering with same-cluster queries bounded by optimal cost
- On the approximation of correlation clustering and consensus clustering
- Approximation algorithms for two variants of correlation clustering problem
- Approximate clustering in very large relational data
- Approximate range queries for clustering
- A note on the inapproximability of correlation clustering
- Algorithms and Computation
Cited in
(9)- Exact \(k\)-NN queries on clustered SVD datasets
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
- Approximate Clustering with Same-Cluster Queries
- Semi-supervised algorithms for approximately optimal and accurate clustering
- Correlation clustering with same-cluster queries bounded by optimal cost
- Realizable learning is all you need
- Optimal framework for clustering with noisy queries
- Learning partitions using rank queries
- Approximating Dasgupta cost in sublinear time from a few random seeds
This page was built for publication: Approximate correlation clustering using same-cluster queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294677)
