﻿<?xml version="1.0" encoding="utf-8"?>
<ArticleSet>
  <ARTICLE>
    <Journal>
      <PublisherName>مرکز منطقه ای اطلاع رسانی علوم و فناوری</PublisherName>
      <JournalTitle>Journal of Information Systems and Telecommunication (JIST) </JournalTitle>
      <ISSN>2322-1437</ISSN>
      <Volume>3</Volume>
      <Issue>9</Issue>
      <PubDate PubStatus="epublish">
        <Year>2015</Year>
        <Month>3</Month>
        <Day>24</Day>
      </PubDate>
    </Journal>
    <ArticleTitle>Fusion of Learning Automata to Optimize Multi-constraint Problem</ArticleTitle>
    <VernacularTitle>Fusion of Learning Automata to Optimize Multi-constraint Problem</VernacularTitle>
    <FirstPage>1</FirstPage>
    <LastPage>10</LastPage>
    <ELocationID EIdType="doi">10.7508/jist.2015.01.003</ELocationID>
    <Language>en</Language>
    <AuthorList>
      <Author>
        <FirstName>Sara</FirstName>
        <LastName>Motamed</LastName>
        <Affiliation>Islamic Azad</Affiliation>
      </Author>
      <Author>
        <FirstName>Ali</FirstName>
        <LastName>Ahmadi</LastName>
        <Affiliation>K.N. Toosi</Affiliation>
      </Author>
    </AuthorList>
    <History PubStatus="received">
      <Year>2014</Year>
      <Month>10</Month>
      <Day>27</Day>
    </History>
    <Abstract>This paper aims to introduce an effective classification method of learning for partitioning the data in statistical spaces. The work is based on using multi-constraint partitioning on the stochastic learning automata. Stochastic learning automata with fixed or variable structures are a reinforcement learning method. Having no information about optimized operation, such models try to find an answer to a problem. Converging speed in such algorithms in solving different problems and their route to the answer is so that they produce a proper condition if the answer is obtained. However, despite all tricks to prevent the algorithm involvement with local optimal, the algorithms do not perform well for problems with a lot of spread local optimal points and give no good answer. In this paper, the fusion of stochastic learning automata algorithms has been used to solve given problems and provide a centralized control mechanism. Looking at the results, is found that the recommended algorithm for partitioning constraints and finding optimization problems are suitable in terms of time and speed, and given a large number of samples, yield a learning rate of 97.92%. In addition, the test results clearly indicate increased accuracy and significant efficiency of recommended systems compared with single model systems based on different methods of learning automata.</Abstract>
    <ObjectList>
      <Object Type="Keyword">
        <Param Name="Value">Stochastic Automata with Fixed and Variable Structures; Discrete Generalized Pursuit Automata; Fusion Method; Parallel Processing</Param>
      </Object>
    </ObjectList>
    <ArchiveCopySource DocType="Pdf">http://jist.ir/fa/Article/Download/14861</ArchiveCopySource>
  </ARTICLE>
</ArticleSet>