-
Notifications
You must be signed in to change notification settings - Fork 6
/
Copy pathupdateU.m
24 lines (19 loc) · 963 Bytes
/
updateU.m
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
%-------------------------------------------------------------------------------------------------------------------------------------
% Contributed by Jinglin Xu
% Ref:
% [1] Multi-View K-Means Clustering on Big Data. (IJCAI,2013).
% [2] Discriminatively Embedded K-Means for Multi-view Clustering. (CVPR,2016)
% [3] Robust and Sparse Fuzzy K-Means Clustering. (IJCAI2016)
% [4] A new simplex sparse learning model to measure data similarity for clustering (AAAI2015)
%--------------------------------------------------------------------------------------------------------------------------------------
function [Ut,D] = updateU(X,V,Alpha,q,gama,numview)
[~,n] = size(X{1}); [~,c] = size(V{1});
Ut = zeros(c,n); B = zeros(c,n); H = zeros(n,c);
for p = 1:numview
D{p} = pdist2(X{p}',V{p}');
H = H+(Alpha(p)^q)*D{p};
end
for i = 1:n
B(:,i) = -0.5.*H(i,:)'/gama;
[Ut(:,i),~] = EProjSimplex_new(B(:,i),1);
end