Optimal framework for clustering with noisy queries

DOI10.1007/978-981-95-0215-8_16MaRDI QIDQ6867276zbMATH OpenFDO

Authors Jinghui Xia, Zengfeng Huang

Publication date 28 January 2026

Full work available at URL https://doi.org/10.1007/978-981-95-0215-8_16

zbMATH Keywords

clusteringcomplexitymulti-armed bandit

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems
• Approximate correlation clustering using same-cluster queries
• Community detection and stochastic block models: recent developments
• Correlation clustering
• Correlation clustering with same-cluster queries bounded by optimal cost
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: Optimal framework for clustering with noisy queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6867276)