NeurIPS 2019
Sun Dec 8th through Sat the 14th, 2019 at Vancouver Convention Center
Paper ID:8768
Title:Flattening a Hierarchical Clustering through Active Learning

This paper studies an interesting theoretical question of clustering using two data sources: a hierarchy and interactive queries on link constraints. The reviewers appreciate the fact that the algorithm can achieve sharp query complexity guarantees under challenging noisy settings. The only weakness of the paper is motivation - what is a practical scenario where we have these two sources of data?