A MODEL FOR MULTI-LAYER DYNAMIC SOCIAL NETWORKS TO DISCOVER INFLUENTIAL GROUPS BASED ON A COMBINATION OF META-HEURISTIC ALGORITHM AND C-MEANS CLUSTERING

Lida Naderlou, Zahra Tayyebi Qasabeh
{"title":"A MODEL FOR MULTI-LAYER DYNAMIC SOCIAL NETWORKS TO DISCOVER INFLUENTIAL GROUPS BASED ON A COMBINATION OF META-HEURISTIC ALGORITHM AND C-MEANS CLUSTERING","authors":"Lida Naderlou, Zahra Tayyebi Qasabeh","doi":"10.32010/26166127.2022.5.1.72.86","DOIUrl":null,"url":null,"abstract":"Science and technology are proliferating, and complex networks have become a necessity in our daily life, so separating people from complex networks built on the fundamental needs of human life is almost impossible. This research presented a multi-layer dynamic social networks model to discover influential groups based on a developing frog-leaping algorithm and C-means clustering. We collected the data in the first step. Then, we conducted data cleansing and normalization to identify influential individuals and groups using the optimal data by forming a decision matrix. Hence, we used the matrix to identify and cluster (based on phase clustering) and determined each group’s importance. The frog-leaping algorithm was used to improve the identification of influence parameters, which led to improvement in node’s importance, to discover influential individuals and groups in social networks, In the measurement and simulation of clustering section, the proposed method was contrasted against the K-means method, and its equilibrium value in cluster selection resulted from 5. The proposed method presented a more genuine improvement compared to the other methods. However, measuring precision indicators for the proposed method had a 3.3 improvement compared to similar methods and a 3.8 improvement compared to the M-ALCD primary method.","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"140 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Azerbaijan Journal of High Performance Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32010/26166127.2022.5.1.72.86","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Science and technology are proliferating, and complex networks have become a necessity in our daily life, so separating people from complex networks built on the fundamental needs of human life is almost impossible. This research presented a multi-layer dynamic social networks model to discover influential groups based on a developing frog-leaping algorithm and C-means clustering. We collected the data in the first step. Then, we conducted data cleansing and normalization to identify influential individuals and groups using the optimal data by forming a decision matrix. Hence, we used the matrix to identify and cluster (based on phase clustering) and determined each group’s importance. The frog-leaping algorithm was used to improve the identification of influence parameters, which led to improvement in node’s importance, to discover influential individuals and groups in social networks, In the measurement and simulation of clustering section, the proposed method was contrasted against the K-means method, and its equilibrium value in cluster selection resulted from 5. The proposed method presented a more genuine improvement compared to the other methods. However, measuring precision indicators for the proposed method had a 3.3 improvement compared to similar methods and a 3.8 improvement compared to the M-ALCD primary method.
基于元启发式算法和c均值聚类的多层动态社交网络影响力群体发现模型
科学技术日新月异,复杂的网络已经成为我们日常生活的必需品,因此将人与建立在人类生活基本需求之上的复杂网络分离开来几乎是不可能的。本文提出了一种基于发展中的青蛙跳跃算法和c均值聚类的多层动态社会网络模型来发现有影响力的群体。我们在第一步收集了数据。然后,我们通过形成决策矩阵,对数据进行清洗和归一化,利用最优数据识别有影响力的个人和群体。因此,我们使用矩阵来识别和聚类(基于相位聚类),并确定每个组的重要性。利用蛙跳算法改进对影响参数的识别,从而提高节点的重要性,发现社会网络中有影响力的个体和群体。在聚类截面的测量和仿真中,将所提出的方法与K-means方法进行对比,其在聚类选择中的均衡值为5。与其他方法相比,所提出的方法有了更真实的改进。然而,与同类方法相比,该方法的测量精度指标提高了3.3,与M-ALCD主要方法相比提高了3.8。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信