首页 > 最新文献

Journal of Supercomputing最新文献

英文 中文
Intelligent malware detection based on graph convolutional network. 基于图卷积网络的恶意软件智能检测。
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2022-01-01 Epub Date: 2021-08-24 DOI: 10.1007/s11227-021-04020-y
Shanxi Li, Qingguo Zhou, Rui Zhou, Qingquan Lv

Malware has seriously threatened the safety of computer systems for a long time. Due to the rapid development of anti-detection technology, traditional detection methods based on static analysis and dynamic analysis have limited effects. With its better predictive performance, AI-based malware detection has been increasingly used to deal with malware in recent years. However, due to the diversity of malware, it is difficult to extract feature from malware, which make malware detection not conductive to the application of AI technology. To solve the problem, a malware classifier based on graph convolutional network is designed to adapt to the difference of malware characteristics. The specific method is to firstly extract the API call sequence from the malware code and generate a directed cycle graph, then use the Markov chain and principal component analysis method to extract the feature map of the graph, and design a classifier based on graph convolutional network, and finally analyze and compare the performance of the method. The results show that the method has better performance in most detection, and the highest accuracy is 98.32 % , compared with existing methods, our model is superior to other methods in terms of FPR and accuracy. It is also stable to deal with the development and growth of malware.

长期以来,恶意软件严重威胁着计算机系统的安全。由于反检测技术的快速发展,传统的基于静态分析和动态分析的检测方法效果有限。近年来,基于人工智能的恶意软件检测由于具有较好的预测性能,越来越多地用于恶意软件的处理。然而,由于恶意软件的多样性,很难从恶意软件中提取特征,这使得恶意软件检测不利于人工智能技术的应用。为了解决这一问题,设计了一种基于图卷积网络的恶意软件分类器,以适应恶意软件特征的差异。具体方法是首先从恶意软件代码中提取API调用序列并生成有向循环图,然后利用马尔可夫链和主成分分析法提取图的特征映射,并设计基于图卷积网络的分类器,最后对方法的性能进行分析和比较。结果表明,该方法在大多数检测中具有较好的性能,最高准确率为98.32%,与现有方法相比,该模型在FPR和准确率方面均优于其他方法。它在处理恶意软件的发展和增长方面也很稳定。
{"title":"Intelligent malware detection based on graph convolutional network.","authors":"Shanxi Li,&nbsp;Qingguo Zhou,&nbsp;Rui Zhou,&nbsp;Qingquan Lv","doi":"10.1007/s11227-021-04020-y","DOIUrl":"https://doi.org/10.1007/s11227-021-04020-y","url":null,"abstract":"<p><p>Malware has seriously threatened the safety of computer systems for a long time. Due to the rapid development of anti-detection technology, traditional detection methods based on static analysis and dynamic analysis have limited effects. With its better predictive performance, AI-based malware detection has been increasingly used to deal with malware in recent years. However, due to the diversity of malware, it is difficult to extract feature from malware, which make malware detection not conductive to the application of AI technology. To solve the problem, a malware classifier based on graph convolutional network is designed to adapt to the difference of malware characteristics. The specific method is to firstly extract the API call sequence from the malware code and generate a directed cycle graph, then use the Markov chain and principal component analysis method to extract the feature map of the graph, and design a classifier based on graph convolutional network, and finally analyze and compare the performance of the method. The results show that the method has better performance in most detection, and the highest accuracy is <math><mrow><mn>98.32</mn> <mo>%</mo></mrow> </math> , compared with existing methods, our model is superior to other methods in terms of FPR and accuracy. It is also stable to deal with the development and growth of malware.</p>","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"78 3","pages":"4182-4198"},"PeriodicalIF":3.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11227-021-04020-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39364630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Impact of second-order network motif on online social networks. 二阶网络母题对在线社交网络的影响。
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2022-01-01 Epub Date: 2021-09-24 DOI: 10.1007/s11227-021-04079-7
Sankhamita Sinha, Subhayan Bhattacharya, Sarbani Roy

The behaviour of individual users in an online social network is a major contributing factor in determining the outcome of multiple network phenomenon. Group formation, growth of the network, information propagation, and rumour blocking are some of the many network behavioural traits that are influenced by the interaction patterns of the users in the network. Network motifs capture one such interaction pattern between users in online social networks (OSNs). For this work, four second-order (two-edged) network motifs have been considered, namely, message receiving pattern, message broadcasting pattern, message passing pattern, and reciprocal message pattern, to analyse user behaviour in online social networks. This work provides and utilizes a node interaction pattern-finding algorithm to identify the frequency of aforementioned second-order network motifs in six real-life online social networks (Facebook, GPlus, GNU, Twitter, Enron Email, and Wiki-vote). The frequency of network motifs participated in by a node is considered for the relative ranking of all nodes in the online social networks. The highest-rated nodes are considered seeds for information propagation. The performance of using network motifs for ranking nodes as seeds for information propagation is validated using statistical metrics Z-score, concentration, and significance profile and compared with baseline ranking methods in-degree centrality, out-degree centrality, closeness centrality, and PageRank. The comparative study shows the performance of centrality measures to be similar or better than second-order network motifs as seed nodes in information diffusion. The experimental results on finding frequencies and importance of different interaction patterns provide insights on the significance and representation of each such interaction pattern and how it varies from network to network.

在线社交网络中个体用户的行为是决定多重网络现象结果的主要因素。群体的形成、网络的成长、信息的传播和谣言的阻断是许多网络行为特征中的一些,这些特征受网络中用户的交互模式的影响。网络主题捕捉了在线社交网络(osn)中用户之间的一种这样的交互模式。在这项工作中,考虑了四个二阶(双刃)网络基序,即消息接收模式、消息广播模式、消息传递模式和互惠消息模式,以分析在线社交网络中的用户行为。这项工作提供并利用了一个节点交互模式查找算法来识别六个现实生活中的在线社交网络(Facebook、GPlus、GNU、Twitter、安然电子邮件和维基投票)中上述二阶网络基序的频率。一个节点参与网络母题的频率被认为是在线社交网络中所有节点的相对排名。评级最高的节点被认为是信息传播的种子。使用网络主题作为信息传播种子对节点排序的性能进行了验证,使用统计指标Z-score、浓度和显著性概况,并与基线排序方法进行了度中心性、度外中心性、接近中心性和PageRank的比较。对比研究表明,中心性测度在信息扩散中的表现与作为种子节点的二阶网络基序相似或优于二阶网络基序。在寻找不同交互模式的频率和重要性方面的实验结果提供了对每种交互模式的意义和表示以及它如何在网络之间变化的见解。
{"title":"Impact of second-order network motif on online social networks.","authors":"Sankhamita Sinha,&nbsp;Subhayan Bhattacharya,&nbsp;Sarbani Roy","doi":"10.1007/s11227-021-04079-7","DOIUrl":"https://doi.org/10.1007/s11227-021-04079-7","url":null,"abstract":"<p><p>The behaviour of individual users in an online social network is a major contributing factor in determining the outcome of multiple network phenomenon. Group formation, growth of the network, information propagation, and rumour blocking are some of the many network behavioural traits that are influenced by the interaction patterns of the users in the network. Network motifs capture one such interaction pattern between users in online social networks (OSNs). For this work, four second-order (two-edged) network motifs have been considered, namely, message receiving pattern, message broadcasting pattern, message passing pattern, and reciprocal message pattern, to analyse user behaviour in online social networks. This work provides and utilizes a node interaction pattern-finding algorithm to identify the frequency of aforementioned second-order network motifs in six real-life online social networks (Facebook, GPlus, GNU, Twitter, Enron Email, and Wiki-vote). The frequency of network motifs participated in by a node is considered for the relative ranking of all nodes in the online social networks. The highest-rated nodes are considered seeds for information propagation. The performance of using network motifs for ranking nodes as seeds for information propagation is validated using statistical metrics Z-score, concentration, and significance profile and compared with baseline ranking methods in-degree centrality, out-degree centrality, closeness centrality, and PageRank. The comparative study shows the performance of centrality measures to be similar or better than second-order network motifs as seed nodes in information diffusion. The experimental results on finding frequencies and importance of different interaction patterns provide insights on the significance and representation of each such interaction pattern and how it varies from network to network.</p>","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"78 4","pages":"5450-5478"},"PeriodicalIF":3.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8461152/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39467272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Innate immune memory and its application to artificial immune systems. 先天免疫记忆及其在人工免疫系统中的应用。
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2022-01-01 Epub Date: 2022-02-16 DOI: 10.1007/s11227-021-04295-1
Dongmei Wang, Yiwen Liang, Hongbin Dong, Chengyu Tan, Zhenhua Xiao, Sai Liu

The study of innate immune-based algorithms is an important research domain in Artificial Immune System (AIS), such as Dendritic Cell Algorithm (DCA), Toll-Like Receptor algorithm (TLRA). The parameters in these algorithms usually require either manually pre-defined usually provided by the immunologists, or empirically derived from the training dataset, and result in poor self-adaptation and self-learning. The fundamental reason is that the original innate immune mechanisms lack adaptive biological theory. To solve this problem, a theory called ‘Trained Immunity™ or Innate Immune Memory (IIM)™ that thinks innate immunity can also build immunological memory to enhance the immune system™s learning and adaptive reactions to the second stimulus is introduced into AIS to improve the innate immune algorithms™ adaptability. In this study, we present an overview of IIM with particular emphasis on analogies in the AIS world, and a modified DCA with an effective automated tuning mechanism based on IIM (IIM-DCA) to optimize migration threshold of DCA. The migration threshold of Dendritic Cells (DCs) determines the lifespan of the antigen collected by DCs, and directly affect the detection speed and accuracy of DCA. Experiments on real datasets show that our proposed IIM-DCA which integrates Innate Immune Memory mechanism delivers more accurate results.

基于先天免疫的算法研究是人工免疫系统(AIS)的一个重要研究领域,如树突状细胞算法(DCA)、toll样受体算法(TLRA)等。这些算法中的参数通常要么需要由免疫学家手动预定义,要么需要从训练数据集中经验推导,导致自适应和自学习能力差。其根本原因在于原有的先天免疫机制缺乏适应性生物学理论。为了解决这一问题,将一种称为训练免疫™或先天免疫记忆(IIM)™的理论引入AIS,该理论认为先天免疫也可以建立免疫记忆,以增强免疫系统对第二刺激的学习和适应性反应,以提高先天免疫算法的适应性。在本研究中,我们介绍了IIM的概述,特别强调了AIS世界中的类比,以及基于IIM的改进的DCA (IIM-DCA),该DCA具有有效的自动调优机制,以优化DCA的迁移阈值。树突状细胞(Dendritic Cells, dc)的迁移阈值决定了树突状细胞收集抗原的寿命,直接影响到DCA的检测速度和准确性。在真实数据集上的实验表明,我们所提出的集成了先天免疫记忆机制的IIM-DCA可以提供更准确的结果。
{"title":"Innate immune memory and its application to artificial immune systems.","authors":"Dongmei Wang,&nbsp;Yiwen Liang,&nbsp;Hongbin Dong,&nbsp;Chengyu Tan,&nbsp;Zhenhua Xiao,&nbsp;Sai Liu","doi":"10.1007/s11227-021-04295-1","DOIUrl":"https://doi.org/10.1007/s11227-021-04295-1","url":null,"abstract":"<p><p>The study of innate immune-based algorithms is an important research domain in Artificial Immune System (AIS), such as Dendritic Cell Algorithm (DCA), Toll-Like Receptor algorithm (TLRA). The parameters in these algorithms usually require either manually pre-defined usually provided by the immunologists, or empirically derived from the training dataset, and result in poor self-adaptation and self-learning. The fundamental reason is that the original innate immune mechanisms lack adaptive biological theory. To solve this problem, a theory called ‘Trained Immunity™ or Innate Immune Memory (IIM)™ that thinks innate immunity can also build immunological memory to enhance the immune system™s learning and adaptive reactions to the second stimulus is introduced into AIS to improve the innate immune algorithms™ adaptability. In this study, we present an overview of IIM with particular emphasis on analogies in the AIS world, and a modified DCA with an effective automated tuning mechanism based on IIM (IIM-DCA) to optimize migration threshold of DCA. The migration threshold of Dendritic Cells (DCs) determines the lifespan of the antigen collected by DCs, and directly affect the detection speed and accuracy of DCA. Experiments on real datasets show that our proposed IIM-DCA which integrates Innate Immune Memory mechanism delivers more accurate results.</p>","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"78 9","pages":"11680-11701"},"PeriodicalIF":3.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8852961/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39642080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A cloud-based mobile payment system using identity-based signature providing key revocation 一种基于云的移动支付系统,使用基于身份的签名提供密钥撤销
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-07-01 DOI: 10.1007/S11227-021-03830-4
Fatemeh Alidadi Shamsabadi, S. B. Chehelcheshmeh
{"title":"A cloud-based mobile payment system using identity-based signature providing key revocation","authors":"Fatemeh Alidadi Shamsabadi, S. B. Chehelcheshmeh","doi":"10.1007/S11227-021-03830-4","DOIUrl":"https://doi.org/10.1007/S11227-021-03830-4","url":null,"abstract":"","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"36 1","pages":"2503-2527"},"PeriodicalIF":3.3,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73672048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
$hbox {E}^{2}hbox {M}^{3}$: energy-efficient massive MIMO-MISO 5G HetNet using Stackelberg game $hbox {E}^{2}hbox {M}^{3}$:节能大规模MIMO-MISO 5G HetNet使用Stackelberg游戏
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-04-28 DOI: 10.1007/S11227-021-03809-1
Subhankar Ghosh, D. De
{"title":"$hbox {E}^{2}hbox {M}^{3}$: energy-efficient massive MIMO-MISO 5G HetNet using Stackelberg game","authors":"Subhankar Ghosh, D. De","doi":"10.1007/S11227-021-03809-1","DOIUrl":"https://doi.org/10.1007/S11227-021-03809-1","url":null,"abstract":"","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"57 1","pages":"13549-13583"},"PeriodicalIF":3.3,"publicationDate":"2021-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82841678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Multi-criteria decision-making for controller placement in software-defined wide-area networks 软件定义广域网中控制器布局的多准则决策
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-04-26 DOI: 10.1007/S11227-021-03815-3
A. A. Seyedkolaei, S. Hosseini-Seno
{"title":"Multi-criteria decision-making for controller placement in software-defined wide-area networks","authors":"A. A. Seyedkolaei, S. Hosseini-Seno","doi":"10.1007/S11227-021-03815-3","DOIUrl":"https://doi.org/10.1007/S11227-021-03815-3","url":null,"abstract":"","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"29 1","pages":"13447-13473"},"PeriodicalIF":3.3,"publicationDate":"2021-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73152478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
An efficient query optimization technique in big data using σ-ANFIS load balancer and CaM-BW optimizer 基于σ-ANFIS负载均衡器和CaM-BW优化器的大数据查询优化技术
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-04-19 DOI: 10.1007/S11227-021-03793-6
D. Kumar, V. Jha
{"title":"An efficient query optimization technique in big data using σ-ANFIS load balancer and CaM-BW optimizer","authors":"D. Kumar, V. Jha","doi":"10.1007/S11227-021-03793-6","DOIUrl":"https://doi.org/10.1007/S11227-021-03793-6","url":null,"abstract":"","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"72 1","pages":"13018-13045"},"PeriodicalIF":3.3,"publicationDate":"2021-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84156741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Analysis of blockchain system based on $hbox {M}/(hbox {M}_1, hbox {M}_2)/1$ vacation queueing model 基于$hbox {M}/(hbox {M}_1, hbox {M}_2)/1$假期排队模型的区块链系统分析
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-04-01 DOI: 10.1007/s11227-020-03408-6
Jiaqi Fan, Zhanyou Ma, Yang Zhang, Changzhen Zhang
{"title":"Analysis of blockchain system based on $hbox {M}/(hbox {M}_1, hbox {M}_2)/1$ vacation queueing model","authors":"Jiaqi Fan, Zhanyou Ma, Yang Zhang, Changzhen Zhang","doi":"10.1007/s11227-020-03408-6","DOIUrl":"https://doi.org/10.1007/s11227-020-03408-6","url":null,"abstract":"","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"173 1","pages":"3673-3694"},"PeriodicalIF":3.3,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76644646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
N-version of the neutrosophic cubic set: application in the negative influences of Internet 中性立方集的n -版本:在互联网负面影响中的应用
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-03-24 DOI: 10.1007/S11227-020-03615-1
M. Gulistan, A. Elmoasry, N. Yaqoob
{"title":"N-version of the neutrosophic cubic set: application in the negative influences of Internet","authors":"M. Gulistan, A. Elmoasry, N. Yaqoob","doi":"10.1007/S11227-020-03615-1","DOIUrl":"https://doi.org/10.1007/S11227-020-03615-1","url":null,"abstract":"","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"1 1","pages":"11410-11431"},"PeriodicalIF":3.3,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84555728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Epidemic zone of COVID-19 from social media using hypergraph with weighting factor (HWF). 利用带加权因子的超图(HWF)从社交媒体中获取COVID-19疫区。
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-01-01 Epub Date: 2021-03-29 DOI: 10.1007/s11227-021-03726-3
S Pradeepa, K R Manjula

Online social network is one of the most prominent media that holds information about society's epidemic problem. Due to privacy reasons, most of the users will not disclose their location. Detecting the location of the tweet users is required to track the geographic location of the spreading diseases. This work aims to detect the spreading location of the COVID-19 disease from the Twitter users and content discussed in the tweet. COVID-19 is a disease caused by the "novel coronavirus." About 80% of confirmed cases recover from the disease. However, one out of every six people who get COVID-19 can become seriously ill, stated by the World health organization. Inferring the user location for identifying the spreading location for the disease is a very challenging task. This paper proposes a new technique based on a hypergraph model to detect the Twitter user's locations based on the spreading disease. This model uses hypergraph with weighting factor technique to infer the spreading disease's spatial location. The accuracy of prediction can be improved when a massive volume of streaming data is analyzed. The Helly property of the hypergraph was applied to discard less potential words from the text analysis, which claims this work of unique nature. A weighting factor was introduced to calculate the score of each location for a particular user. The location of each user is predicted based on the one that possesses the highest weighting factor. The proposed framework has been evaluated and tested for various measures like precision, recall and F-measure. The promising results obtained have substantiated the claim for this work compared to the state-of-the-art methodologies.

在线社交网络是承载社会流行病信息的最重要的媒体之一。由于隐私原因,大多数用户不会透露他们的位置。为了追踪疾病传播的地理位置,需要检测推特用户的位置。这项工作旨在从推特用户和推文中讨论的内容中检测COVID-19疾病的传播位置。COVID-19是一种由“新型冠状病毒”引起的疾病。约80%的确诊病例可痊愈。然而,世界卫生组织表示,每六名COVID-19患者中就有一人可能会患上重病。推断用户位置以确定疾病的传播位置是一项非常具有挑战性的任务。本文提出了一种基于超图模型的基于疾病传播的Twitter用户位置检测方法。该模型采用超图加权因子技术来推断疾病传播的空间位置。当分析大量的流数据时,可以提高预测的准确性。超图的Helly性质被用于从文本分析中丢弃较少的潜在词,这声称这项工作具有独特性。引入加权因子来计算特定用户在每个位置的得分。每个用户的位置是根据拥有最高权重因子的用户来预测的。提出的框架已经被评估和测试了各种措施,如精度,召回率和F-measure。与最先进的方法相比,获得的有希望的结果证实了这项工作的主张。
{"title":"Epidemic zone of COVID-19 from social media using hypergraph with weighting factor (HWF).","authors":"S Pradeepa,&nbsp;K R Manjula","doi":"10.1007/s11227-021-03726-3","DOIUrl":"https://doi.org/10.1007/s11227-021-03726-3","url":null,"abstract":"<p><p>Online social network is one of the most prominent media that holds information about society's epidemic problem. Due to privacy reasons, most of the users will not disclose their location. Detecting the location of the tweet users is required to track the geographic location of the spreading diseases. This work aims to detect the spreading location of the COVID-19 disease from the Twitter users and content discussed in the tweet. COVID-19 is a disease caused by the \"novel coronavirus.\" About 80% of confirmed cases recover from the disease. However, one out of every six people who get COVID-19 can become seriously ill, stated by the World health organization. Inferring the user location for identifying the spreading location for the disease is a very challenging task. This paper proposes a new technique based on a hypergraph model to detect the Twitter user's locations based on the spreading disease. This model uses hypergraph with weighting factor technique to infer the spreading disease's spatial location. The accuracy of prediction can be improved when a massive volume of streaming data is analyzed. The Helly property of the hypergraph was applied to discard less potential words from the text analysis, which claims this work of unique nature. A weighting factor was introduced to calculate the score of each location for a particular user. The location of each user is predicted based on the one that possesses the highest weighting factor. The proposed framework has been evaluated and tested for various measures like precision, recall and F-measure. The promising results obtained have substantiated the claim for this work compared to the state-of-the-art methodologies.</p>","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"77 10","pages":"11738-11755"},"PeriodicalIF":3.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11227-021-03726-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"25557599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
期刊
Journal of Supercomputing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1