arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1201.6462cs.LG
收藏

基于$\eps$ -光滑相对遗憾近似的边信息主动学习曲面拟合

Active Learning of Custering with Side Information Using $\eps$-Smooth Relative Regret Approximations

Nir Ailon, Ron Begleiter

摘要:

聚类被认为是一种非监督学习设置,其目标是将数据点的集合划分为不相交的聚类。通常,从业者给出或假设聚类数量的界限$k$。这个问题的许多版本已经被定义,最著名的是$k$ -均值和$k$ -中位数。聚类的无监督性质的一个潜在问题是确定相似性函数。缓解这种困难的一种方法被称为边信息聚类,或者半监督聚类。在这里,从业者以数据点对的“必须被聚类”或“必须被分离”标签的形式并入辅助信息。每一条这样的信息都有一个“查询成本”(通常涉及人工响应请求)。然后,将标签的集合作为严格约束或软约束并入通常的聚类算法中,可能向所选择的聚类目标添加成对约束惩罚函数。我们的工作主要是与边信息聚类。我们问如何选择数据点对。我们的分析产生了一种方法,证明比简单地随机选择它们更好。粗略地说,我们表明,分布必须是有偏见的,以便更多的重量放在对事件的元素在较小的集群中的一些最佳解决方案。当然,我们不知道最优解,因此我们不知道偏差。使用最近推出的方法$\eps$ -光滑的相对遗憾近似的Ailon,Begleiter和以斯拉,我们可以显示一个迭代的过程,提高了集群和偏见串联。该过程可证明收敛到最优解的速度(查询成本方面)比算法选择对一致。

英文摘要:

Clustering is considered a non-supervised learning setting, in which the goal is to partition a collection of data points into disjoint clusters. Often a bound $k$ on the number of clusters is given or assumed by the practitioner. Many versions of this problem have been defined, most notably $k$-means and $k$-median. An underlying problem with the unsupervised nature of clustering it that of determining a similarity function. One approach for alleviating this difficulty is known as clustering with side information, alternatively, semi-supervised clustering. Here, the practitioner incorporates side information in the form of "must be clustered" or "must be separated" labels for data point pairs. Each such piece of information comes at a "query cost" (often involving human response solicitation). The collection of labels is then incorporated in the usual clustering algorithm as either strict or as soft constraints, possibly adding a pairwise constraint penalty function to the chosen clustering objective. Our work is mostly related to clustering with side information. We ask how to choose the pairs of data points. Our analysis gives rise to a method provably better than simply choosing them uniformly at random. Roughly speaking, we show that the distribution must be biased so as more weight is placed on pairs incident to elements in smaller clusters in some optimal solution. Of course we do not know the optimal solution, hence we don't know the bias. Using the recently introduced method of $\eps$-smooth relative regret approximations of Ailon, Begleiter and Ezra, we can show an iterative process that improves both the clustering and the bias in tandem. The process provably converges to the optimal solution faster (in terms of query cost) than an algorithm selecting pairs uniformly.

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

↑