{"title":"基于元启发式算法和c均值聚类的多层动态社交网络影响力群体发现模型","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":"{\"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}","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}
A MODEL FOR MULTI-LAYER DYNAMIC SOCIAL NETWORKS TO DISCOVER INFLUENTIAL GROUPS BASED ON A COMBINATION OF META-HEURISTIC ALGORITHM AND C-MEANS CLUSTERING
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.