Concept Stability Entropy: A Novel Group Cohesion Measure in Social Networks

IF 5.1 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Emerging Topics in Computing Pub Date : 2023-09-20 DOI:10.1109/TETC.2023.3315335
Fei Hao;Jie Gao;Yaguang Lin;Yulei Wu;Jiaxing Shang
{"title":"Concept Stability Entropy: A Novel Group Cohesion Measure in Social Networks","authors":"Fei Hao;Jie Gao;Yaguang Lin;Yulei Wu;Jiaxing Shang","doi":"10.1109/TETC.2023.3315335","DOIUrl":null,"url":null,"abstract":"Group cohesion is regarded as a central group property across both social psychology and sociology. It facilities the understanding of the organizational behavior of users, and in turn guides the users to work well together in order to achieve goals within a social network. Therefore, group cohesion assessment is a crucial research issue for social network analysis. Group cohesion is often viewed as network density in the current state-of-the-art. Due to the advantages of characterizing the cohesion of a network with concept stability, this article presents a novel group cohesion measure, called concept stability entropy inspired by Shannon Entropy. Particularly, the scale of concept stability entropy is investigated. Considering the dynamic nature of social networks, an incremental algorithm for concept stability entropy computation is devised. In addition, we explore the correlation between concept stability entropy and other related metrics, i.e., network density, average degree, and average clustering coefficient. Extensive experimental results first validate that the concept stability entropy falls into the range of \n<inline-formula><tex-math>$[0, log(k)]$</tex-math></inline-formula>\n (\n<inline-formula><tex-math>$k$</tex-math></inline-formula>\n is the number of formal concepts), and then demonstrate that the concept stability entropy has a positive correlation with the average degree and a negative correlation with the network density and average clustering coefficient. Practically, a case study on the COVID-2019 virus network is conducted for illustrating the usefulness of our proposed group cohesion assessment approach.","PeriodicalId":13156,"journal":{"name":"IEEE Transactions on Emerging Topics in Computing","volume":null,"pages":null},"PeriodicalIF":5.1000,"publicationDate":"2023-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10258038/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Group cohesion is regarded as a central group property across both social psychology and sociology. It facilities the understanding of the organizational behavior of users, and in turn guides the users to work well together in order to achieve goals within a social network. Therefore, group cohesion assessment is a crucial research issue for social network analysis. Group cohesion is often viewed as network density in the current state-of-the-art. Due to the advantages of characterizing the cohesion of a network with concept stability, this article presents a novel group cohesion measure, called concept stability entropy inspired by Shannon Entropy. Particularly, the scale of concept stability entropy is investigated. Considering the dynamic nature of social networks, an incremental algorithm for concept stability entropy computation is devised. In addition, we explore the correlation between concept stability entropy and other related metrics, i.e., network density, average degree, and average clustering coefficient. Extensive experimental results first validate that the concept stability entropy falls into the range of $[0, log(k)]$ ( $k$ is the number of formal concepts), and then demonstrate that the concept stability entropy has a positive correlation with the average degree and a negative correlation with the network density and average clustering coefficient. Practically, a case study on the COVID-2019 virus network is conducted for illustrating the usefulness of our proposed group cohesion assessment approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
概念稳定性熵:社交网络中一种新的群体凝聚力测量方法
在社会心理学和社会学中,群体凝聚力都被视为群体的核心属性。它有助于理解用户的组织行为,进而引导用户在社会网络中为实现目标而通力合作。因此,群体凝聚力评估是社会网络分析的一个重要研究课题。在当前最先进的技术中,群体凝聚力通常被视为网络密度。鉴于用概念稳定性来表征网络凝聚力的优势,本文受香农熵(Shannon Entropy)的启发,提出了一种新的群体凝聚力测量方法--概念稳定性熵。本文特别研究了概念稳定熵的尺度。考虑到社交网络的动态性质,我们设计了一种概念稳定熵计算的增量算法。此外,我们还探讨了概念稳定熵与其他相关指标(即网络密度、平均度和平均聚类系数)之间的相关性。大量实验结果首先验证了概念稳定熵的范围为 $[0,log(k)]$($k$ 为正式概念的个数),然后证明了概念稳定熵与平均度呈正相关,而与网络密度和平均聚类系数呈负相关。在实践中,我们对 COVID-2019 病毒网络进行了案例研究,以说明我们提出的群体凝聚力评估方法的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Emerging Topics in Computing
IEEE Transactions on Emerging Topics in Computing Computer Science-Computer Science (miscellaneous)
CiteScore
12.10
自引率
5.10%
发文量
113
期刊介绍: IEEE Transactions on Emerging Topics in Computing publishes papers on emerging aspects of computer science, computing technology, and computing applications not currently covered by other IEEE Computer Society Transactions. Some examples of emerging topics in computing include: IT for Green, Synthetic and organic computing structures and systems, Advanced analytics, Social/occupational computing, Location-based/client computer systems, Morphic computer design, Electronic game systems, & Health-care IT.
期刊最新文献
Table of Contents Front Cover IEEE Transactions on Emerging Topics in Computing Information for Authors Special Section on Emerging Social Computing DALTON - Deep Local Learning in SNNs via local Weights and Surrogate-Derivative Transfer
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1