The Correlation Clustering Problem(CorCP) is a significant clustering problem based on the similarity of data.It has significant applications in different fields,such as machine learning,biology,and data mining,and ma...The Correlation Clustering Problem(CorCP) is a significant clustering problem based on the similarity of data.It has significant applications in different fields,such as machine learning,biology,and data mining,and many different problems in other areas.In this paper,the Balanced 2-CorCP(B2-CorCP) is introduced and examined,and a new interesting variant of the CorCP is described.The goal of this clustering problem is to partition the vertex set into two clusters with equal size,such that the number of disagreements is minimized.We first present a polynomial time algorithm for the B2-CorCP on M-positive edge dominant graphs(M≥ 3).Then,we provide a series of numerical experiments,and the results show the effectiveness of our algorithm.展开更多
基金supported by the National Natural Science Foundation of China (Nos. 12131003,12101594,11771386,11728104,and 11201333)the Beijing Natural Science Foundation Project (No. Z200002)+1 种基金the China Postdoctoral Science Foundation (No. 2021M693337)the Natural Sciences and Engineering Research Council of Canada (NSERC) (No. 06446)。
文摘The Correlation Clustering Problem(CorCP) is a significant clustering problem based on the similarity of data.It has significant applications in different fields,such as machine learning,biology,and data mining,and many different problems in other areas.In this paper,the Balanced 2-CorCP(B2-CorCP) is introduced and examined,and a new interesting variant of the CorCP is described.The goal of this clustering problem is to partition the vertex set into two clusters with equal size,such that the number of disagreements is minimized.We first present a polynomial time algorithm for the B2-CorCP on M-positive edge dominant graphs(M≥ 3).Then,we provide a series of numerical experiments,and the results show the effectiveness of our algorithm.
