QQ客服 官方微博 反馈留言

	Symmetric graph regularized constraint propagation
	Fu, Zhenyong ; Lu, Zhiwu ; Ip, Horace H. S. ; Peng, Yuxin ; Lu, Hongtao
	2011
英文摘要	This paper presents a novel symmetric graph regularization framework for pairwise constraint propagation. We first decompose the challenging problem of pairwise constraint propagation into a series of two-class label propagation subproblems and then deal with these subproblems by quadratic optimization with symmetric graph regularization. More importantly, we clearly show that pairwise constraint propagation is actually equivalent to solving a Lyapunov matrix equation, which is widely used in Control Theory as a standard continuous-time equation. Different from most previous constraint propagation methods that suffer from severe limitations, our method can directly be applied to multi-class problem and also can effectively exploit both must-link and cannot-link constraints. The propagated constraints are further used to adjust the similarity between data points so that they can be incorporated into subsequent clustering. The proposed method has been tested in clustering tasks on six real-life data sets and then shown to achieve significant improvements with respect to the state of the arts. Copyright ? 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.; EI; 0
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/411307]
专题	计算机科学技术研究所
推荐引用方式 GB/T 7714	Fu, Zhenyong,Lu, Zhiwu,Ip, Horace H. S.,et al. Symmetric graph regularized constraint propagation. 2011-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。