mlsanityData to 7 Oct 2026

Learning to Cluster via Same-Cluster Queries

arXiv 2108.07383 ↗First posted 17 Aug 2021cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

We study the problem of learning to cluster data points using an oracle which can answer same-cluster queries. Different from previous approaches, we do not assume that the total number of clusters is known at the beginning and do not require that the true clusters are consistent with a predefined objective function such as the K-means. These relaxations are critical from the practical perspective and, meanwhile, make the problem more challenging. We propose two algorithms with provable theoretical guarantees and verify their effectiveness via an extensive set of experiments on both synthetic and real-world data.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 11 of its 20 references that are in the map. First posted on arXiv 17 Aug 2021.

Builds on

11 of 20 references.

References · 11

  1. 2017Clustering with Noisy Queriescited by 34
  2. 2016Clustering with Same-Cluster Queriescited by 29
  3. 2017Query Complexity of Clustering with Side Informationcited by 20
  4. 2019Correlation Clustering with Same-Cluster Queries Bounded by Optimal Costcited by 16
  5. 2020Exact Recovery of Mangled Clusters with Same-Cluster Queriescited by 13
  6. 2017Approximate Correlation Clustering Using Same-Cluster Queriescited by 11
  7. 2019Same-Cluster Querying for Overlapping Clusterscited by 11
  8. 2014Leveraging Transitive Relations for Crowdsourced Joinscited by 9
  9. 2018Query K-means Clustering and the Double Dixie Cup Problemcited by 8
  10. 2017Approximate Clustering with Same-Cluster Queriescited by 7
  11. 2018Semi-Supervised Algorithms for Approximately Optimal and Accurate Clusteringcited by 4

Built on by

Cited by year

Citing papers per year: 2022: 2.

2 papers.