Multi-view clustering method based on non-negative matrix factorization and partition adaptive fusion
A technology of non-negative matrix decomposition and clustering method, which is applied in the field of multi-view clustering based on non-negative matrix decomposition and partition adaptive fusion, which can solve the problems of destroying independence and unsatisfactory global clustering results.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0039] The invention belongs to an unsupervised clustering method in a big data environment, and is an efficient multiplication update method.
[0040] The present invention introduces Shannon entropy regularization term. As an uncertainty measure, Shannon entropy is effectively used for clustering. When dividing uncertainty, it is generally believed that when the entropy reaches the maximum and there is no prior information, the division is optimal. On the other hand, when other information is available, it is expected that there is a trade-off between the indeterminate partition obtained from the available information and the partition obtained in the maximum entropy case.
[0041] The present invention will be further described below in conjunction with the accompanying drawings of the description.
[0042] In order to verify the effectiveness of the present invention, in this invention, an attempt is made to prove the effectiveness of the proposed multi-view clustering a...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


