arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.05896stat.MLcs.LG

Clustering with a Reject Option: Interactive Clustering as Bayesian Prior Elicitation

University of Edinburgh(爱丁堡大学);Microsoft Research(微软研究院);Massachusetts Institute of Technology(麻省理工学院);Harvard University(哈佛大学);Twitter(推特)

Akash Srivastava, James Zou, Ryan P. Adams, Charles Sutton

英文摘要:

A good clustering can help a data analyst to explore and understand a data set, but what constitutes a good clustering may depend on domain-specific and application-specific criteria. These criteria can be difficult to formalize, even when it is easy for an analyst to know a good clustering when they see one. We present a new approach to interactive clustering for data exploration called TINDER, based on a particularly simple feedback mechanism, in which an analyst can reject a given clustering and request a new one, which is chosen to be different from the previous clustering while fitting the data well. We formalize this interaction in a Bayesian framework as a method for prior elicitation, in which each different clustering is produced by a prior distribution that is modified to discourage previously rejected clusterings. We show that TINDER successfully produces a diverse set of clusterings, each of equivalent quality, that are much more diverse than would be obtained by randomized restarts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑