Persistent Homology Combined with Machine Learning for Social Network Activity Analysis.

IF 2.1 3区 物理与天体物理 Q2 PHYSICS, MULTIDISCIPLINARY Entropy Pub Date : 2024-12-30 DOI:10.3390/e27010019
Zhijian Zhang, Yuqing Sun, Yayun Liu, Lin Jiang, Zhengmi Li
{"title":"Persistent Homology Combined with Machine Learning for Social Network Activity Analysis.","authors":"Zhijian Zhang, Yuqing Sun, Yayun Liu, Lin Jiang, Zhengmi Li","doi":"10.3390/e27010019","DOIUrl":null,"url":null,"abstract":"<p><p>Currently, the rapid development of social media enables people to communicate more and more frequently in the network. Classifying user activities in social networks helps to better understand user behavior in social networks. This paper first creates an ego network for each user, encodes the higher-order topological features of the ego network as persistence diagrams using persistence homology, and computes the persistence entropy. Then, based on the persistence entropy, this paper defines the Norm Entropy-NE(X) to represent the complexity of the topological features of the ego network, a larger NE(X) indicates a higher topological complexity, i.e., the higher the activity of the nodes, thus indicating the degree of activity of the nodes. The paper uses the extracted set of feature vectors to train the machine learning model to classify the users in the social network. Numerical experiments are conducted to evaluate the performance of clustering quality metrics such as profile coefficients. The results show that the proposed algorithm can effectively classify social network users into different groups, which provides a good foundation for further research and application.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 1","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11764698/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Entropy","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.3390/e27010019","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Currently, the rapid development of social media enables people to communicate more and more frequently in the network. Classifying user activities in social networks helps to better understand user behavior in social networks. This paper first creates an ego network for each user, encodes the higher-order topological features of the ego network as persistence diagrams using persistence homology, and computes the persistence entropy. Then, based on the persistence entropy, this paper defines the Norm Entropy-NE(X) to represent the complexity of the topological features of the ego network, a larger NE(X) indicates a higher topological complexity, i.e., the higher the activity of the nodes, thus indicating the degree of activity of the nodes. The paper uses the extracted set of feature vectors to train the machine learning model to classify the users in the social network. Numerical experiments are conducted to evaluate the performance of clustering quality metrics such as profile coefficients. The results show that the proposed algorithm can effectively classify social network users into different groups, which provides a good foundation for further research and application.

Abstract Image

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
结合机器学习的持久同源性社会网络活动分析。
目前,社交媒体的快速发展使得人们在网络上的交流越来越频繁。对社交网络中的用户活动进行分类有助于更好地理解社交网络中的用户行为。本文首先为每个用户创建一个自我网络,利用持久性同调将自我网络的高阶拓扑特征编码为持久性图,并计算持久性熵。然后,基于持续熵,本文定义了Norm熵-NE(X)来表示自我网络拓扑特征的复杂度,NE(X)越大表示拓扑复杂度越高,即节点的活跃度越高,从而表示节点的活跃程度。本文利用提取的特征向量集训练机器学习模型对社交网络中的用户进行分类。通过数值实验对聚类质量指标(如轮廓系数)的性能进行了评价。结果表明,该算法能够有效地将社交网络用户划分为不同的群体,为进一步的研究和应用提供了良好的基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Entropy
Entropy PHYSICS, MULTIDISCIPLINARY-
CiteScore
4.90
自引率
11.10%
发文量
1580
审稿时长
21.05 days
期刊介绍: Entropy (ISSN 1099-4300), an international and interdisciplinary journal of entropy and information studies, publishes reviews, regular research papers and short notes. Our aim is to encourage scientists to publish as much as possible their theoretical and experimental details. There is no restriction on the length of the papers. If there are computation and the experiment, the details must be provided so that the results can be reproduced.
期刊最新文献
Data-Driven Quantification of Quantum k-Entanglement via Machine Learning. Cross-Code Verification for Improved Thermophysical Properties of Argon, Krypton and Xenon Plasmas. SPA-QNAS: Improving Search Efficiency and Stability in Evolutionary Quantum Neural Architecture Search. Image Encryption via DDPM Skipping-Step Diffusion Based on a Six-Dimensional Hyperchaotic System with Feedback Control. A Class of Robust Estimators for Moment Condition Models.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1