2017 4th International Conference on Control, Decision and Information Technologies (CoDIT) 2017
DOI: 10.1109/codit.2017.8102624
|View full text |Cite
|
Sign up to set email alerts
|

Optimal initial partitionning for high quality hybrid hierarchical community detection in social networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…In fact, the introduced mixed hierarchical citizens clustering provided low energy function of the elements of SNOW Data Challenge, indicating good clustering quality. This high clustering performance can result from the fact that the detected citizens communities were very dependent on the initial citizens community structure relying on the detection of the optimal initial structure (Toujani and Akaichi, 2017). Besides, because the introduced mixed process allowed adjusting the number of clusters, the hierarchical classification process was more flexible for noise and burst detection.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…In fact, the introduced mixed hierarchical citizens clustering provided low energy function of the elements of SNOW Data Challenge, indicating good clustering quality. This high clustering performance can result from the fact that the detected citizens communities were very dependent on the initial citizens community structure relying on the detection of the optimal initial structure (Toujani and Akaichi, 2017). Besides, because the introduced mixed process allowed adjusting the number of clusters, the hierarchical classification process was more flexible for noise and burst detection.…”
Section: Discussionmentioning
confidence: 99%
“…It does not change the number of partitions, but it modifies the initial distribution. In our case, the generation of the initial community structure was obtained using the method suggested in Toujani and Akaichi (2017), which considers the initial partition as a combinatorial optimization issue and solves it by employing Tabu Search metaheuristic. Therefore, the initial generated citizens’ partition was injected as input to MCCM .…”
Section: Proposed Approachmentioning
confidence: 99%
“…Its running time on a network with n vertices is O(nlog 2 n). Toujani and Akaichi [13] propose a hybrid method to uncover the hierarchical community structure of complex networks. However, the method assumes the existence of an initial partition, which has significance influence to the final results.…”
Section: Related Workmentioning
confidence: 99%
“…Because of its excellent performance, agglomerative method has attracted many attentions. Typical agglomerative algorithms include: modularity optimization [13]- [16], density-based methods [17]- [21], game theory-based methods [22], [23], random walk-based methods [24]- [26], and NMF (Nonnegative Matrix Factorization)-based methods [27], [28]. These methods have achieved good performance in community detection, but there are still some defects among them.…”
Section: Introductionmentioning
confidence: 99%