An approximate algorithm for maximizing modularity by estimating the domain of influence
As social networks grow, they become more and more complex and analyzing them becomes complicated. One way to reduce this complexity is to divide the network into subnets, which are also called communities. Dividing social networks into desirable communities can help the analysts and experts to unde...
Main Authors: | Seyfollah Soleimani, Rouhollah Javadpour Boroujeni |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2022-09-01
|
Series: | هوش محاسباتی در مهندسی برق |
Subjects: | |
Online Access: | https://isee.ui.ac.ir/article_25856_ab9d50db732166f473b9918d5624c22c.pdf |
Similar Items
-
Spreading Social Influence with both Positive and Negative Opinions in Online Networks
by: Jing (Selena) He, et al.
Published: (2019-06-01) -
Centrality in modular networks
by: Zakariya Ghalmane, et al.
Published: (2019-05-01) -
Identifying Influential Nodes in Complex Networks Based on Local Effective Distance
by: Junkai Zhang, et al.
Published: (2019-10-01) -
Identifying Influential Nodes in Complex Networks Based on Multiple Local Attributes and Information Entropy
by: Jinhua Zhang, et al.
Published: (2022-02-01) -
A Community-Based Method for Identifying Influential Nodes Using Network Embedding
by: Narges Vafaei, et al.
Published: (2022-03-01)