Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Link prediction in fuzzy social networks using distributed learning automata
Moradabadi B., Meybodi M. Applied Intelligence47 (3):837-849,2017.Type:Article
Date Reviewed: Nov 28 2017

Link prediction is an active area within the broader research on social network analysis (SNA) that tries to predict future links using a social network structure. The purpose of link prediction is to use the current structure of the social network to predict interaction between the nodes that will be generated in the future. A mathematical formulation of link prediction methods can be articulated as: “Given a pair of nodes u and v in the current social network, how likely is it that u will interact with v in the future?”

This paper is an interesting work that uses a distributed learning automata–based approach in conjunction with fuzzy concepts for link prediction. While distributed learning automata and fuzzy set theory have both been studied in detail earlier, this is the first work that combines these two concepts for the purpose of link prediction.

Additional strengths of the paper are the detailed preliminary information and description of the problem space and the commonly used similarity measures. This establishes the context for the reader in great detail, and exposes new students to this field of study in a gentle manner. Another strength is the detailed empirical results that use five different datasets and compare the proposed algorithm to 10-plus previously known algorithms.

A concern regarding the proposed algorithm is that the running time is almost two orders of magnitude higher than the other algorithms used in the comparative analysis. This then raises the secondary concern that it may be possible to reconfigure the other algorithms to trade execution time for higher prediction accuracy. Therefore, it remains unclear how the proposed algorithm would compete against the reconfigured versions of algorithms used in comparative analysis.

An obvious idea for a future extension of this work is to compare the proposed model with an ensemble model that simply combines the results of the three best previously known algorithms. Considering the fact that the proposed algorithm takes a significantly longer time, it is conceivable that three prior known algorithms and the ensemble model together take less time than the proposed approach and deliver higher quality results.

Reviewer:  Amrinder Arora Review #: CR145674 (1802-0088)
Bookmark and Share
 
Automata (F.1.1 ... )
 
 
Social Networking (H.3.4 ... )
 
 
Uncertainty, “Fuzzy,” And Probabilistic Reasoning (I.2.3 ... )
 
 
Learning (I.2.6 )
 
Would you recommend this review?
yes
no
Other reviews under "Automata": Date
The congruence theory of closure properties of regular tree languages
Tirri S. Theoretical Computer Science 76(2-3): 261-271, 2001. Type: Article
Jun 1 1991
Distribution and synchronized automata
Petit A. Theoretical Computer Science 76(2-3): 285-308, 2001. Type: Article
Feb 1 1992
Efficient simulation of finite automata by neural nets
Alon N., Dewdney A., Ott T. Journal of the ACM 38(2): 495-514, 1991. Type: Article
Dec 1 1991
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy