Zhang Zhijian, Sun Yuqing, Liu Yayun, Jiang Lin, Li Zhengmi
Faculty of Science, Kunming University of Science and Technology, Kunming 650500, China.
Research Center for Mathematics and Interdisciplinary Sciences, Kunming University of Science and Technology, Kunming 650500, China.
Entropy (Basel). 2024 Dec 30;27(1):19. doi: 10.3390/e27010019.
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.
当前,社交媒体的快速发展使人们能够在网络中越来越频繁地交流。对社交网络中的用户活动进行分类有助于更好地理解用户在社交网络中的行为。本文首先为每个用户创建一个自我网络,使用持久同调将自我网络的高阶拓扑特征编码为持久图,并计算持久熵。然后,基于持久熵,本文定义范数熵-NE(X)来表示自我网络拓扑特征的复杂性,NE(X)越大表明拓扑复杂性越高,即节点的活动越高,从而表明节点的活跃程度。本文使用提取的特征向量集训练机器学习模型,以对社交网络中的用户进行分类。进行数值实验以评估诸如轮廓系数等聚类质量指标的性能。结果表明,所提出的算法能够有效地将社交网络用户分类到不同的组中,这为进一步的研究和应用提供了良好的基础。