{"total":16,"rows":[{"id":"2102.05047","title":"Bounded Memory Active Learning through Enriched Queries","created":"2021-02-09","cited_by_count":8,"area":null},{"id":"2206.04583","title":"Clustering with Queries under Semi-Random Noise","created":"2022-06-09","cited_by_count":8,"area":null},{"id":"2402.01400","title":"Query-Efficient Correlation Clustering with Noisy Oracle","created":"2024-02-02","cited_by_count":7,"area":null},{"id":"2207.05376","title":"Optimal Clustering with Noisy Queries via Multi-Armed Bandit","created":"2022-07-12","cited_by_count":5,"area":null},{"id":"2302.10295","title":"Correlation Clustering with Active Learning of Pairwise Similarities","created":"2023-02-20","cited_by_count":5,"area":null},{"id":"2201.09433","title":"Active Learning Polynomial Threshold Functions","created":"2022-01-24","cited_by_count":3,"area":null},{"id":"2409.10908","title":"Clustering with Non-adaptive Subset Queries","created":"2024-09-17","cited_by_count":3,"area":null},{"id":"2106.04913","title":"On Margin-Based Cluster Recovery with Oracle Queries","created":"2021-06-09","cited_by_count":2,"area":null},{"id":"2108.07383","title":"Learning to Cluster via Same-Cluster Queries","created":"2021-08-17","cited_by_count":2,"area":null},{"id":"2402.14332","title":"Accelerating data-driven algorithm selection for combinatorial partitioning problems","created":"2024-02-22","cited_by_count":2,"area":null},{"id":"2505.05009","title":"Learning Partitions with Optimal Query and Round Complexities","created":"2025-05-08","cited_by_count":2,"area":null},{"id":"2402.03587","title":"Information-Theoretic Active Correlation Clustering","created":"2024-02-05","cited_by_count":1,"area":null},{"id":"2106.02212","title":"Fuzzy Clustering with Similarity Queries","created":"2021-06-04","cited_by_count":0,"area":null},{"id":"2305.13402","title":"Error-Tolerant Exact Query Learning of Finite Set Partitions with Same-Cluster Oracle","created":"2023-05-22","cited_by_count":0,"area":null},{"id":"2506.08405","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","created":"2025-06-10","cited_by_count":0,"area":null},{"id":"2602.05690","title":"Almost Asymptotically Optimal Active Clustering Through Pairwise Observations","created":"2026-02-05","cited_by_count":0,"area":null}],"next_cursor":null}