A Multi-Objective Community Detection Algorithm for Directed Network Based on Random Walk
Uncovering community structure is an important technique for studying complex networks. While a large bulk of algorithms have been proposed for community detection in recent years, most of them were designed for undirected networks. Considering many real-world networks are by nature directed, it is...
Main Authors: | Xuyun Wen, Ying Lin |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8892511/ |
Similar Items
-
Efficient algorithm to compute Markov transitional probabilities for a desired PageRank
by: Gábor Berend
Published: (2020-07-01) -
Combining the Two-Layers PageRank Approach with the APA Centrality in Networks with Data
by: Taras Agryzkov, et al.
Published: (2018-12-01) -
Extending the Adapted PageRank Algorithm Centrality to Multiplex Networks with Data Using the PageRank Two-Layer Approach
by: Taras Agryzkov, et al.
Published: (2019-02-01) -
Toward Efficient Hub-Less Real Time Personalized PageRank
by: Matin Pirouz, et al.
Published: (2017-01-01) -
Estimating PageRank deviations in crawled graphs
by: Helge Holzmann, et al.
Published: (2019-10-01)