Community Detection in Complex Networks Using Learning Automata

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Vahidipour s. Mehdi; Salimiyan Zahra

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT) Year:2023 | Volume:12 | Issue:3 Page(s): 1-16

Download Full-Text

Persian Verion

View:

Download:

Cites:

Information Journal Paper

Title

Community Detection in Complex Networks Using Learning Automata

Author(s)

Vahidipour s. Mehdi | Salimiyan Zahra | Issue Writer Certificate

Keywords

Social Networks

community discovery

Learning Automata

similarity measure

Abstract

Social Networks are one of the types of complex networks. Identifying communities in Social Networks is an effective way to use their information, for which several algorithms have been presented so far. In this paper, novel algorithms are designed, in which a learning automaton is attached to each node; The number of actions of Learning Automata is fixed and equal to the estimate of the number of network communities. At each step, each of the Learning Automata chooses an action from its set of actions. Choosing any of these actions means assigning the label of that community to the node. The action chosen by each automaton is evaluated based on the chosen actions of its neighbors ((local attention) and/or communities detected by the entire method (global screening). The result of the evaluation leads to generate rewards or punish signal for the automata. By receiving a reward, the probability of re-choosing the chosen action by the automaton, or the community label, increases, and otherwise, by receiving a fine, the probability of this action decreases. By repeating the algorithm, the optimal action is determined as long as no change occurs in the selected label of the corresponding automata of each node with more iterations, and as a result, the optimal communities are determined as the output of the algorithm. The comparison of the results of the experiments shows the effectiveness of the proposed methods in comparison with the previous methods.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans