Similarly, for , we also only need zero addition and mk multiplications for each of them.
besides, we also note that W u is a sparse matrix, if we use a p-nearest neighbor graph, the average nonzero elements on each row of W u is p. we only need mpk additions and mpk multiplications to compute W u U.