Node Classification in Social Network by Distributed Learning Automata
Journal Title: Journal of Information Systems and Telecommunication - Year 2017, Vol 5, Issue 2
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.
Authors and Affiliations
Ahmad Rahnamazadeh, Mohammad Reza Meybodi, Masoud Taheri Kadkhoda
Keywords
Related Articles
- EP ID EP211836
- DOI -
- Views 122
- Downloads 0
Internet Banking, Cloud Computing: Opportunities, Threats
With the extension of Internet and its applications, internet banking is introduced as an efficient and cost effective way to provide services to customers. Towards the end of previous decade, cloud computing has been of...
A Learning Automata Approach to Cooperative Particle Swarm Optimizer
This paper presents a modification of Particle Swarm Optimization (PSO) technique based on cooperative behavior of swarms and learning ability of an automaton. The approach is called Cooperative Particle Swarm Optimizati...
Low Complexity Median Filter Hardware for Image Impulsive Noise Reduction
Median filters are commonly used for removal of the impulse noise from images. De-noising is a preliminary step in online processing of images, thus hardware implementation of median filters is of great interest. Hence,...
Joint Source and Channel Analysis for Scalable Video Coding Using Vector Quantization over OFDM System
Conventional wireless video encoders employ variable-length entropy encoding and predictive coding to achieve high compression ratio but these techniques render the extremely sensitive encoded bit-stream to channel error...
A New Upper Bound for Free Space Optical Channel Capacity Using a Simple Mathematical in Equality
In this paper, by using a simple mathematical inequality, we derive a $ new upper bound fkr the capacity of$ free space optical channel in coherent case. Then, by applying general fading distribution, we obtain an upper...