»ã±¨Ö÷Ì⣺»ùÓڷǹ⻬ÓÅ»¯µÄ°ë¼à¶½¾ÛÀàËã·¨

»ã±¨ÈË£º°×¸»Éú ½ÌÊÚ £¨³ÁÇìʦ·¶´óѧ£©

»ã±¨¹¦·ò£º2020Äê7ÔÂ29ÈÕ£¨ÖÜÈý£© 9:00-11:00

²Î»á·½Ê½£ºZoom »áÒé

https://cernet.zoom.com.cn/j/8649755986

»áÒéID£º864 975 5986

Ö÷°ì²¿ÃÅ£ºÀíѧԺÊýѧϵ

»ã±¨ÌáÒª£ºA novel model for semi-supervised clustering (SSC) problems with pairwise constraints is proposed. The model is formulated as a nonconvex nonsmooth optimization problem. To solve the problem, an auxiliary SSC problem is formulated to generate starting points. An incremental SSC algorithm is then developed. The adoption of the incremental approach allows us to deal with the nonconvexity of the SSC problem by generating good initial points to approximate the solution. The discrete gradient method is applied to solve both the auxiliary SSC and the underlying problems. The performance of the incremental SSC algorithm is evaluated and compared with four benchmarking SSC algorithms on twelve real-world data sets from the UCI Machine Learning Repository. Numerical results show that the presented algorithm outperforms the other four algorithms in identifying compact and well-separated clusters with high constraints satisfaction rate.

Ó­½ÓÀÏʦ¡¢Ñ§Éú²ÎÓ룡