SSL-EDA: semi-supervised learning algorithm based on estimation of distribution algorithm
by Jian-cong Fan; Yong-quan Liang
International Journal of Innovative Computing and Applications (IJICA), Vol. 4, No. 2, 2012

Abstract: Estimation of distribution algorithm (EDA) is a new branch of evolutionary algorithms. EDA replaces search operators with the estimation of the distribution of selected individuals + sampling from this distribution. A semi-supervised learning algorithm based on EDA (abbr. SSL-EDA) is designed. SSL-EDA uses a few data samples with class labels to estimate class distributions of a mount of data instances without class labels. Each data is an individual and the initial labelled individuals are treated as initial population. The optimum individuals can be obtained from the probabilistic distributions of former generation. The local classification rules are produced according to the properties of the optimum individuals. New individuals without labels are selected according to the local classification rules and added with labels to compose new population combined with the optimum individuals. SSL-EDA is compared with several classification algorithms in error rates of classification and also with standard genetic algorithms. The experimental and analytical results show SSL-EDA is better than or comparable with other algorithms in classification accuracy.

Online publication date: Mon, 07-May-2012

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email