Adaptive Hierarchical Clustering Using Ordinal Queries.
SODA '18: Symposium on Discrete Algorithms New Orleans Louisiana January, 2018(2018)
摘要
In many applications of clustering (for example, ontologies or clusterings of animal or plant species), hierarchical clusterings are more descriptive than a flat clustering. A hierarchical clustering over n elements is represented by a rooted binary tree with n leaves, each corresponding to one element. The subtrees rooted at interior nodes capture the clusters. In this paper, we study active learning of a hierarchical clustering using only ordinal queries. An ordinal query consists of a set of three elements, and the response to a query reveals the two elements (among the three elements in the query) which are "closer" to each other than to the third one. We say that elements x and x' are closer to each other than x" if there exists a cluster containing x and x', but not x".
When all the query responses are correct, there is a deterministic algorithm that learns the underlying hierarchical clustering using at most n log2n adaptive ordinal queries. We generalize this algorithm to be robust in a model in which each query response is correct independently with probability [Equation], and adversarially incorrect with probability 1 − p. We show that in the presence of noise, our algorithm outputs the correct hierarchical clustering with probability at least 1 − δ, using O(n log n + n log(1/δ)) adaptive ordinal queries. For our results, adaptivity is crucial: we prove that even in the absence of noise, every non-adaptive algorithm requires Ω(n3) ordinal queries in the worst case.
更多查看译文
关键词
adaptive hierarchical clustering
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要