﻿<?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>5</Volume>
      <Issue>18</Issue>
      <PubDate PubStatus="epublish">
        <Year>2017</Year>
        <Month>6</Month>
        <Day>23</Day>
      </PubDate>
    </Journal>
    <ArticleTitle>Node Classification in Social Network by Distributed Learning Automata</ArticleTitle>
    <VernacularTitle>Node Classification in Social Network by Distributed Learning Automata</VernacularTitle>
    <FirstPage>1</FirstPage>
    <LastPage>10</LastPage>
    <ELocationID EIdType="doi">10.7508/jist.2017.18.005</ELocationID>
    <Language>en</Language>
    <AuthorList>
      <Author>
        <FirstName>Ahmad</FirstName>
        <LastName>Rahnama Zadeh</LastName>
        <Affiliation>Qazvin Branch, Islamic Azad University, Qazvin, Iran</Affiliation>
      </Author>
      <Author>
        <FirstName>محمدرضا</FirstName>
        <LastName>میبدی</LastName>
        <Affiliation>صنعتی امیرکبیر</Affiliation>
      </Author>
      <Author>
        <FirstName>Masoud</FirstName>
        <LastName>Taheri Kadkhoda</LastName>
        <Affiliation>Qazvin Branch, Islamic Azad University, Qazvin, Iran</Affiliation>
      </Author>
    </AuthorList>
    <History PubStatus="received">
      <Year>2016</Year>
      <Month>9</Month>
      <Day>7</Day>
    </History>
    <Abstract>The aim of this article is improving the accuracy of node classification in social network using Distributed Learning Automata (DLA). In the proposed algorithm using a local similarity measure, new relations between nodes are created, then the supposed graph is partitioned according to the labeled nodes and a network of Distributed Learning Automata is corresponded on each partition. In each partition the maximal spanning tree is determined using DLA. Finally nodes are labeled according to the rewards of DLA. We have tested this algorithm on three real social network datasets, and results show that the expected accuracy of presented algorithm is achieved.</Abstract>
    <ObjectList>
      <Object Type="Keyword">
        <Param Name="Value">Social Network</Param>
      </Object>
      <Object Type="Keyword">
        <Param Name="Value"></Param>
      </Object>
      <Object Type="Keyword">
        <Param Name="Value">Classification</Param>
      </Object>
      <Object Type="Keyword">
        <Param Name="Value"></Param>
      </Object>
      <Object Type="Keyword">
        <Param Name="Value">Distributed Learning Automata</Param>
      </Object>
      <Object Type="Keyword">
        <Param Name="Value"></Param>
      </Object>
      <Object Type="Keyword">
        <Param Name="Value">Node Labeling.</Param>
      </Object>
    </ObjectList>
    <ArchiveCopySource DocType="Pdf">http://jist.ir/fa/Article/Download/14943</ArchiveCopySource>
  </ARTICLE>
</ArticleSet>