0


监督聚类

Supervised Clustering
课程网址: http://videolectures.net/nips2010_zadeh_sc/  
主讲教师: Reza Bosagh Zadeh
开课单位: 斯坦福大学
开课时间: 2011-03-25
课程语种: 英语
中文简介:
尽管聚类作为无监督学习的工具无处不在,但尚未就形式理论达成共识,并且这方面的绝大多数工作都集中在无监督聚类上。我们研究了最近提出的监督聚类框架,其中可以访问教师。我们提供了一种改进的通用算法来聚类该模型中的任何概念类。我们的算法具有查询效率,因为它只涉及与教师的少量交互。我们还介绍和研究了该模型的两个自然概括。该模型假设教师对算法的反应是完美的。我们通过提出一个噪声模型来消除这种限制,并给出一个算法来聚类这个噪声模型中的间隔类。我们还提出了一个动态模型,教师可以看到这些点的随机子集。最后,对于满足弱到强属性的数据集,我们给出了查询边界,并显示包含单链接的一类聚类函数将在最强属性下找到目标聚类。
课程简介: Despite the ubiquity of clustering as a tool in unsupervised learning, there is not yet a consensus on a formal theory, and the vast majority of work in this direction has focused on unsupervised clustering. We study a recently proposed framework for supervised clustering where there is access to a teacher. We give an improved generic algorithm to cluster any concept class in that model. Our algorithm is query-efficient in the sense that it involves only a small amount of interaction with the teacher. We also present and study two natural generalizations of the model. The model assumes that the teacher response to the algorithm is perfect. We eliminate this limitation by proposing a noisy model and give an algorithm for clustering the class of intervals in this noisy model. We also propose a dynamic model where the teacher sees a random subset of the points. Finally, for datasets satisfying a spectrum of weak to strong properties, we give query bounds, and show that a class of clustering functions containing Single-Linkage will find the target clustering under the strongest property.
关 键 词: 聚类; 通用算法; 噪声模型
课程来源: 视频讲座网
最后编审: 2019-07-26:cwx
阅读次数: 194