Creating a Maximal Clique Graph to Improve Community Detection in SCoDA and OSLOM Algorithms
Community detection is one of the important topics regarding complex network study. There are many community detection algorithms such as Streaming Community Detection Algorithm (SCoDA) and Order Statistics Local Optimization Method (OSLOM). However, the performance of these algorithms, in overlap c...
Main Authors: | Sasan Sabour, Ali Moeini |
---|---|
Format: | Article |
Language: | English |
Published: |
Iran Telecom Research Center
2019-12-01
|
Series: | International Journal of Information and Communication Technology Research |
Subjects: | |
Online Access: | http://ijict.itrc.ac.ir/article-1-447-en.html |
Similar Items
-
On clique convergence of graphs
by: S.M. Hegde, et al.
Published: (2016-12-01) -
On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
by: Charles A. Phillips, et al.
Published: (2019-01-01) -
Local Optimization for Clique-Based Overlapping Community Detection in Complex Networks
by: Jian Ma, et al.
Published: (2020-01-01) -
Clique roots of K4-free chordal graphs
by: Hossein Teimoori Faal
Published: (2019-04-01) -
An Efficient Influence Maximization Algorithm Based on Clique in Social Networks
by: Huan Li, et al.
Published: (2019-01-01)