1. 类中心极大的多视角极大熵聚类算法.
- Author
-
丁健宇, 祁云嵩, and 赵呈祥
- Subjects
- *
PROBLEM solving , *ENTROPY , *PUNISHMENT , *ALGORITHMS , *MAXIMUM entropy method , *SCARCITY - Abstract
In the face of sparse data, high data dimensions and multi view clustering tasks, the traditional maximum entropy clustering algorithm will cause clustering failure because the class center tends to be consistent. In order to solve this problem, based on the traditional maximum entropy clustering algorithm, this paper introduced the class center punishment mechanism, integrated the weight matrix to achieve multi perspective division and integration, and constructed a multi view maximum entropy clustering algorithm with class center maximum. The algorithm reflected the importance of a certain perspective by adjusting the weight on each perspective, and solved the problem that the class center on each perspective tends to be consistent due to the scarcity of data and high data dimension in the multi perspective clustering task. Through a large number of experiments, it further proves that the clustering effect of this algorithm is significantly better than the traditional clustering algorithm when dealing with high-dimensional, sparse data, interference data participating and multi view data sets. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF