OAK

Clustering-based probabilistic model fitting in estimation of distribution algorithms

Metadata Downloads
Abstract
An efficient clustering strategy for estimation of distribution algorithms (EDAs) is presented. It is used for properly fitting probabilistic models that play an important role in guiding search direction. To this end, a fitness-aided ordering scheme is devised for deciding the input sequence of samples (i.e., individuals) for clustering. It can effectively categorise the individuals by using the (available) information about fitness landscape. Moreover, a virtual leader is introduced for providing a reliable reference for measuring the distance from samples to its own cluster. The proposed algorithm incorporates them within the framework of random the leader algorithm (RLA). Experimental results demonstrate that the proposed approach is more effective than the existing ones with regard to probabilistic model fitting.
Author(s)
Ahn, Chang WookRamakrishna, Rudrapatna Subramanyam
Issued Date
2006-01
Type
Article
DOI
10.1093/ietisy/e89-d.1.381
URI
https://scholar.gist.ac.kr/handle/local/17963
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Citation
Ieice Transactions on Information and Systems, v.E89D, no.1, pp.381 - 383
ISSN
1745-1361
Appears in Collections:
Department of AI Convergence > 1. Journal Articles
Graduate School of AI Policy and Strategy > 1. Journal Articles
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.