ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2207.05376
  4. Cited By
Optimal Clustering with Noisy Queries via Multi-Armed Bandit

Optimal Clustering with Noisy Queries via Multi-Armed Bandit

12 July 2022
Jinghui Xia
Zengfeng Huang
ArXivPDFHTML

Papers citing "Optimal Clustering with Noisy Queries via Multi-Armed Bandit"

4 / 4 papers shown
Title
Learning-augmented Maximum Independent Set
Learning-augmented Maximum Independent Set
Vladimir Braverman
Prathamesh Dharangutte
Vihan Shah
Chen Wang
32
2
0
16 Jul 2024
Active Learning with Simple Questions
Active Learning with Simple Questions
Vasilis Kontonis
Mingchen Ma
Christos Tzamos
VLM
40
3
0
13 May 2024
Query-Efficient Correlation Clustering with Noisy Oracle
Query-Efficient Correlation Clustering with Noisy Oracle
Yuko Kuroki
Atsushi Miyauchi
Francesco Bonchi
Wei Chen
26
2
0
02 Feb 2024
Recovering Unbalanced Communities in the Stochastic Block Model With
  Application to Clustering with a Faulty Oracle
Recovering Unbalanced Communities in the Stochastic Block Model With Application to Clustering with a Faulty Oracle
Chandra Sekhar Mukherjee
Pan Peng
Jiapeng Zhang
11
7
0
17 Feb 2022
1