Density-based rough set model for hesitant node clustering in overlapping community detection

Jun Wang*, Jiaxu Peng, Ou Liu

*Corresponding author for this work

Research output: Contribution to journalArticle

Abstract

Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years. A notion of hesitant node (HN) is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure. However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model (DBRSM) is proposed by combining the virtue of density-based algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further 'growth' of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.

Original languageEnglish
Pages (from-to)1089-1097
Number of pages9
JournalJournal of Systems Engineering and Electronics
Volume25
Issue number6
DOIs
Publication statusPublished - 1 Dec 2014

Fingerprint

Macros
Communication
Experiments

Bibliographical note

This is an open access article freely available on the publisher's website https://ieeexplore.ieee.org/document/7004653

Keywords

  • density-based rough set model (DBRSM)
  • hesitant node (HN)
  • overlapping community detection
  • rough set
  • trust path

Cite this

Wang, Jun ; Peng, Jiaxu ; Liu, Ou. / Density-based rough set model for hesitant node clustering in overlapping community detection. In: Journal of Systems Engineering and Electronics. 2014 ; Vol. 25, No. 6. pp. 1089-1097.
@article{6603375309074f28817abb561b6d2bab,
title = "Density-based rough set model for hesitant node clustering in overlapping community detection",
abstract = "Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years. A notion of hesitant node (HN) is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure. However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model (DBRSM) is proposed by combining the virtue of density-based algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further 'growth' of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.",
keywords = "density-based rough set model (DBRSM), hesitant node (HN), overlapping community detection, rough set, trust path",
author = "Jun Wang and Jiaxu Peng and Ou Liu",
note = "This is an open access article freely available on the publisher's website https://ieeexplore.ieee.org/document/7004653",
year = "2014",
month = "12",
day = "1",
doi = "10.1109/JSEE.2014.00125",
language = "English",
volume = "25",
pages = "1089--1097",
number = "6",

}

Wang, J, Peng, J & Liu, O 2014, 'Density-based rough set model for hesitant node clustering in overlapping community detection', Journal of Systems Engineering and Electronics, vol. 25, no. 6, pp. 1089-1097. https://doi.org/10.1109/JSEE.2014.00125

Density-based rough set model for hesitant node clustering in overlapping community detection. / Wang, Jun; Peng, Jiaxu; Liu, Ou.

In: Journal of Systems Engineering and Electronics, Vol. 25, No. 6, 01.12.2014, p. 1089-1097.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Density-based rough set model for hesitant node clustering in overlapping community detection

AU - Wang, Jun

AU - Peng, Jiaxu

AU - Liu, Ou

N1 - This is an open access article freely available on the publisher's website https://ieeexplore.ieee.org/document/7004653

PY - 2014/12/1

Y1 - 2014/12/1

N2 - Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years. A notion of hesitant node (HN) is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure. However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model (DBRSM) is proposed by combining the virtue of density-based algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further 'growth' of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.

AB - Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years. A notion of hesitant node (HN) is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure. However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model (DBRSM) is proposed by combining the virtue of density-based algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further 'growth' of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.

KW - density-based rough set model (DBRSM)

KW - hesitant node (HN)

KW - overlapping community detection

KW - rough set

KW - trust path

UR - http://www.scopus.com/inward/record.url?scp=84930652855&partnerID=8YFLogxK

U2 - 10.1109/JSEE.2014.00125

DO - 10.1109/JSEE.2014.00125

M3 - Article

AN - SCOPUS:84930652855

VL - 25

SP - 1089

EP - 1097

IS - 6

ER -

Wang J, Peng J, Liu O. Density-based rough set model for hesitant node clustering in overlapping community detection. Journal of Systems Engineering and Electronics. 2014 Dec 1;25(6):1089-1097. https://doi.org/10.1109/JSEE.2014.00125