년 - 년
Study on Traditional Flower Design Based on Genetic Algorithm Optimized by K-medoids Algorithm
보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.9 No.10 2016.10 pp.269-280
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
With the continuous improvement of the economic level, people pay more and more attention to the appreciation of art. Art of flower arranging is an art following certain laws of creation and it has a long history. At present, the flower shape depends mainly on the arrangements’ experience and personal preferences. This paper attempts to use genetic algorithm optimized by the K-medoids algorithm for its research, through the replacement of the genetic algorithm to get more design solutions, so as to broaden the designer's ideas, to achieve the innovation of art design. Experiments show that the beauty of floral works produced by the optimized genetic algorithm is better than that produced by traditional genetic algorithm.
A K-means-like Algorithm for K-medoids Clustering
[Kisti 연계] 한국경영과학회 한국경영과학회 학술대회논문집 2005 pp.51-54
※ 협약을 통해 무료로 제공되는 자료로, 원문이용 방식은 연계기관의 정책을 따르고 있습니다.
Clustering analysis is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. In this paper we propose a new algorithm for K-medoids clustering which runs like the K-means algorithm. The new algorithm calculates distance matrix once and uses it for finding new medoids at every iterative step. We evaluate the proposed method using real and synthetic data and compare with the results of other algorithms. The proposed algorithm takes reduced time in computation and better performance than others.
0개의 논문이 장바구니에 담겼습니다.
선택하신 파일을 압축중입니다.
잠시만 기다려 주십시오.