首页 | 本学科首页   官方微博 | 高级检索  
     


Using instance-level constraints in agglomerative hierarchical clustering: theoretical and empirical results
Authors:Ian Davidson  S S Ravi
Affiliation:(1) Department of Computer Science, The University of California - Davis, Davis, CA 95616, USA;(2) Department of Computer Science, University at Albany - State University of New York, Albany, NY 12222, USA
Abstract:Clustering with constraints is a powerful method that allows users to specify background knowledge and the expected cluster properties. Significant work has explored the incorporation of instance-level constraints into non-hierarchical clustering but not into hierarchical clustering algorithms. In this paper we present a formal complexity analysis of the problem and show that constraints can be used to not only improve the quality of the resultant dendrogram but also the efficiency of the algorithms. This is particularly important since many agglomerative style algorithms have running times that are quadratic (or faster growing) functions of the number of instances to be clustered. We present several bounds on the improvement in the running times of algorithms obtainable using constraints. A preliminary version of this paper appeared as Davidson and Ravi (2005b).
Keywords:Clustering  Constrained clustering  Semi-supervised learning
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号