سال انتشار: ۱۳۸۴

محل انتشار: یازدهمین کنفرانس سالانه انجمن کامپیوتر ایران

تعداد صفحات: ۷

نویسنده(ها):

R. Rastegar – Soft Computing Lab. Computer Engineering Department Amirkabir University of Technology, Tehran, Iran
M. R. Meybodi –

چکیده:

In this paper, we study some dynamical properties of population-based incremental learning (PBIL) algorithm when uses truncation, proportional or Boltzmann selection schemas. Our analysis shows that if population size tends to infinite, then with any learning rate, local optimum points of the function to be optimized are stable fixed points of PBIL.