http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Suguru Yasutomi (검색결과 1 건)
- 무료
- 기관 내 무료
- 유료
-
Sparse Convex Clustering Based on ℓ₂-Norm Regularization on Probability Simplex
Suguru Yasutomi,Toshihisa Tanaka 대한전자공학회 2015 ITC-CSCC :International Technical Conference on Ci Vol.2015 No.6
Convex clustering is a clustering method that does not require the number of clusters in advance. This method is based on the mixture models which have all the samples as the means of clusters and clustering is achieved by finding sparse mixing weights. However, a large number of iterations are needed until convergence because its objective function does not evaluate the sparsity of the mixing weights. This article derives an efficient algorithm for convex clustering with regularization that represents sparsity. Focusing on the fact that sparse solutions on the probability simplex which is the solution space of the convex clustering have a large ℓ₂-norm, we use the ℓ₂-norm to regularize the solution. Experimental results show that the proposed method converges faster ones and the proposed regularization is adequate to represent sparsity.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
