首页 > 最新文献

Journal of Supercomputing最新文献

英文 中文
Supercomputing: 7th Russian Supercomputing Days, RuSCDays 2021, Moscow, Russia, September 27–28, 2021, Revised Selected Papers 超级计算:第七届俄罗斯超级计算日,RuSCDays 2021,莫斯科,俄罗斯,2021年9月27-28日,修订论文选集
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-92864-3
{"title":"Supercomputing: 7th Russian Supercomputing Days, RuSCDays 2021, Moscow, Russia, September 27–28, 2021, Revised Selected Papers","authors":"","doi":"10.1007/978-3-030-92864-3","DOIUrl":"https://doi.org/10.1007/978-3-030-92864-3","url":null,"abstract":"","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"35 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75696313","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}
引用次数: 0
A two-step rumor detection model based on the supernetwork theory about Weibo. 基于微博超级网络理论的两步式谣言检测模型。
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-01-01 Epub Date: 2021-04-01 DOI: 10.1007/s11227-021-03748-x
Xuefan Dong, Ying Lian, Yuxue Chi, Xianyi Tang, Yijun Liu

Based on the supernetwork theory, a two-step rumor detection model was proposed. The first step was the classification of users on the basis of user-based features. In the second step, non-user-based features, including psychology-based features, content-based features, and parts of supernetwork-based features, were used to detect rumors posted by different types of users. Four machine learning methods, namely, Naive Bayes, Neural Network, Support Vector Machine, and Logistic Regression, were applied to train the classifier. Four real cases and several assessment metrics were employed to verify the effectiveness of the proposed model. Performance of the model regarding early rumor detection was also evaluated by separating the datasets according to the posting time of posts. Results showed that this model exhibited better performance in rumor detection compared to five benchmark models, mainly owing to the application of the supernetwork theory and the two-step mechanism.

在超级网络理论的基础上,提出了一个分两步走的谣言检测模型。第一步是基于用户特征的用户分类。第二步,利用非用户特征,包括心理特征、内容特征和部分超网络特征,检测不同类型用户发布的谣言。在训练分类器时,采用了四种机器学习方法,即 Naive Bayes、神经网络、支持向量机和逻辑回归。通过四个真实案例和几个评估指标来验证所提模型的有效性。此外,还根据帖子的发布时间对数据集进行了分离,从而评估了该模型在早期谣言检测方面的性能。结果表明,与五个基准模型相比,该模型在谣言检测方面表现出更好的性能,这主要归功于超级网络理论和两步机制的应用。
{"title":"A two-step rumor detection model based on the supernetwork theory about Weibo.","authors":"Xuefan Dong, Ying Lian, Yuxue Chi, Xianyi Tang, Yijun Liu","doi":"10.1007/s11227-021-03748-x","DOIUrl":"10.1007/s11227-021-03748-x","url":null,"abstract":"<p><p>Based on the supernetwork theory, a two-step rumor detection model was proposed. The first step was the classification of users on the basis of user-based features. In the second step, non-user-based features, including psychology-based features, content-based features, and parts of supernetwork-based features, were used to detect rumors posted by different types of users. Four machine learning methods, namely, Naive Bayes, Neural Network, Support Vector Machine, and Logistic Regression, were applied to train the classifier. Four real cases and several assessment metrics were employed to verify the effectiveness of the proposed model. Performance of the model regarding early rumor detection was also evaluated by separating the datasets according to the posting time of posts. Results showed that this model exhibited better performance in rumor detection compared to five benchmark models, mainly owing to the application of the supernetwork theory and the two-step mechanism.</p>","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"77 10","pages":"12050-12074"},"PeriodicalIF":3.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8014906/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"25564589","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}
引用次数: 0
Thinking in Parallel: foreword. 平行思考:前言。
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-01-01 Epub Date: 2021-05-06 DOI: 10.1007/s11227-021-03848-8
Vicente Matellán Olivera, José Luis González-Sánchez
{"title":"Thinking in Parallel: foreword.","authors":"Vicente Matellán Olivera,&nbsp;José Luis González-Sánchez","doi":"10.1007/s11227-021-03848-8","DOIUrl":"https://doi.org/10.1007/s11227-021-03848-8","url":null,"abstract":"","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"77 12","pages":"13992-13994"},"PeriodicalIF":3.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11227-021-03848-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"38968741","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}
引用次数: 0
A novel LSTM-CNN-grid search-based deep neural network for sentiment analysis. 基于lstm - cnn -网格搜索的情感分析深度神经网络。
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-01-01 Epub Date: 2021-05-05 DOI: 10.1007/s11227-021-03838-w
Ishaani Priyadarshini, Chase Cotton

As the number of users getting acquainted with the Internet is escalating rapidly, there is more user-generated content on the web. Comprehending hidden opinions, sentiments, and emotions in emails, tweets, reviews, and comments is a challenge and equally crucial for social media monitoring, brand monitoring, customer services, and market research. Sentiment analysis determines the emotional tone behind a series of words may essentially be used to understand the attitude, opinions, and emotions of users. We propose a novel long short-term memory (LSTM)-convolutional neural networks (CNN)-grid search-based deep neural network model for sentiment analysis. The study considers baseline algorithms like convolutional neural networks, K-nearest neighbor, LSTM, neural networks, LSTM-CNN, and CNN-LSTM which have been evaluated using accuracy, precision, sensitivity, specificity, and F-1 score, on multiple datasets. Our results show that the proposed model based on hyperparameter optimization outperforms other baseline models with an overall accuracy greater than 96%.

随着熟悉互联网的用户数量迅速增加,网络上有更多的用户生成的内容。理解电子邮件、推特、评论和评论中隐藏的观点、情绪和情绪是一项挑战,对社交媒体监控、品牌监控、客户服务和市场研究同样至关重要。情感分析决定了一系列词语背后的情感基调,本质上可以用来理解用户的态度、观点和情感。我们提出了一种新的基于长短期记忆(LSTM)-卷积神经网络(CNN)-网格搜索的深度神经网络情感分析模型。该研究考虑了卷积神经网络、k近邻、LSTM、神经网络、LSTM- cnn和CNN-LSTM等基线算法,这些算法已经在多个数据集上使用准确性、精密度、灵敏度、特异性和F-1评分进行了评估。结果表明,基于超参数优化的模型优于其他基准模型,总体精度大于96%。
{"title":"A novel LSTM-CNN-grid search-based deep neural network for sentiment analysis.","authors":"Ishaani Priyadarshini,&nbsp;Chase Cotton","doi":"10.1007/s11227-021-03838-w","DOIUrl":"https://doi.org/10.1007/s11227-021-03838-w","url":null,"abstract":"<p><p>As the number of users getting acquainted with the Internet is escalating rapidly, there is more user-generated content on the web. Comprehending hidden opinions, sentiments, and emotions in emails, tweets, reviews, and comments is a challenge and equally crucial for social media monitoring, brand monitoring, customer services, and market research. Sentiment analysis determines the emotional tone behind a series of words may essentially be used to understand the attitude, opinions, and emotions of users. We propose a novel long short-term memory (LSTM)-convolutional neural networks (CNN)-grid search-based deep neural network model for sentiment analysis. The study considers baseline algorithms like convolutional neural networks, <i>K</i>-nearest neighbor, LSTM, neural networks, LSTM-CNN, and CNN-LSTM which have been evaluated using accuracy, precision, sensitivity, specificity, and F-1 score, on multiple datasets. Our results show that the proposed model based on hyperparameter optimization outperforms other baseline models with an overall accuracy greater than 96%.</p>","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"77 12","pages":"13911-13932"},"PeriodicalIF":3.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11227-021-03838-w","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"38964576","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}
引用次数: 87
Burst: real-time events burst detection in social text stream. 突发:社交文本流中的实时事件突发检测。
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-01-01 Epub Date: 2021-03-22 DOI: 10.1007/s11227-021-03717-4
Tajinder Singh, Madhu Kumari

Gigantic growth of social media and unbeatable trend of progress in the direction of the web seeking user's interests have generated a storm of social text streams. Seeking information to know the phenomenon of various events in the early stages is quite interesting. Various kinds of social media live streams attract users to participate in real-time events to become a part of an immense crowd. However, the vast amount of text is present on social media, the unnecessary information bogs a social text stream filtering to extract the appropriate topics and events effectively. Therefore, detecting, classifying, and identifying burst events is quite challenging due to the sparse and noisy text of Twitter. The researchers' significant open challenges are the effective cleaning and profound representation of the text stream data. This research article's main contribution is to provide a detailed study and explore bursty event detection in the social text stream. Thus, this work's main motive is to present a concise approach that classifies and detects the event keywords and maintains the record of the event based on related features. These features permit the approach to successfully determine the booming pattern of events scrupulously at different time span. Experiments are conducted and compared with the state-of-the-art methods, which reveals that the proposed approach is proficient to detect valuable patterns of interest and also achieve better scoresto extract burst events on social media posted by various users.

社交媒体的巨大增长和网络追求用户兴趣的不可阻挡的发展趋势产生了社交文本流的风暴。在早期阶段寻找信息了解各种事件的现象是很有趣的。各种各样的社交媒体直播吸引用户参与实时事件,成为庞大人群的一部分。然而,社交媒体上存在着大量的文本,不必要的信息阻碍了社交文本流的过滤,以有效地提取合适的主题和事件。因此,由于Twitter文本的稀疏和噪声,检测、分类和识别突发事件是相当具有挑战性的。研究人员面临的重大挑战是文本流数据的有效清洗和深度表示。本文的主要贡献在于对社交文本流中的突发事件检测进行了详细的研究和探索。因此,本工作的主要动机是提出一种简洁的方法,对事件关键字进行分类和检测,并根据相关特征维护事件的记录。这些特征使该方法能够成功地确定事件在不同时间跨度内的蓬勃发展模式。实验结果表明,本文提出的方法能够熟练地检测有价值的兴趣模式,并在提取各种用户发布的社交媒体上的突发事件方面取得了更好的分数。
{"title":"Burst: real-time events burst detection in social text stream.","authors":"Tajinder Singh,&nbsp;Madhu Kumari","doi":"10.1007/s11227-021-03717-4","DOIUrl":"https://doi.org/10.1007/s11227-021-03717-4","url":null,"abstract":"<p><p>Gigantic growth of social media and unbeatable trend of progress in the direction of the web seeking user's interests have generated a storm of social text streams. Seeking information to know the phenomenon of various events in the early stages is quite interesting. Various kinds of social media live streams attract users to participate in real-time events to become a part of an immense crowd. However, the vast amount of text is present on social media, the unnecessary information bogs a social text stream filtering to extract the appropriate topics and events effectively. Therefore, detecting, classifying, and identifying burst events is quite challenging due to the sparse and noisy text of Twitter. The researchers' significant open challenges are the effective cleaning and profound representation of the text stream data. This research article's main contribution is to provide a detailed study and explore bursty event detection in the social text stream. Thus, this work's main motive is to present a concise approach that classifies and detects the event keywords and maintains the record of the event based on related features. These features permit the approach to successfully determine the booming pattern of events scrupulously at different time span. Experiments are conducted and compared with the state-of-the-art methods, which reveals that the proposed approach is proficient to detect valuable patterns of interest and also achieve better scoresto extract burst events on social media posted by various users.</p>","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"77 10","pages":"11228-11256"},"PeriodicalIF":3.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11227-021-03717-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"25537956","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
Terminal and broadcast reliability analysis of direct 2-D symmetric torus network. 直接二维对称环面网络的终端和广播可靠性分析。
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-01-01 Epub Date: 2020-05-20 DOI: 10.1007/s11227-020-03311-0
Abhilasha Sharma, R G Sangeetha

Reliability analysis is one of the crucial issues for any scalable optical interconnection network. Torus is a highly scalable optical interconnect for data centre networks. The traditional torus network has XY routing algorithm. We have proposed a novel optimised routing algorithm. This paper focuses on the time-dependent and time-independent analysis for both terminal and broadcast reliabilities of the torus network using XY and optimised routing algorithm under various network sizes ( N × N where N = 8 , 16 , 32 , 64 ). The results are evaluated and compared considering nodes failures in MATLAB.

可靠性分析是任何可扩展光互连网络的关键问题之一。Torus是用于数据中心网络的高度可扩展的光互连。传统环面网络采用XY路由算法。我们提出了一种新的优化路由算法。本文重点研究了在不同网络规模(N × N,其中N = 8,16,32,64)下,采用XY和优化路由算法对环面网络的终端可靠性和广播可靠性的时变和非时变分析。在MATLAB中对考虑节点故障的结果进行了评估和比较。
{"title":"Terminal and broadcast reliability analysis of direct 2-D symmetric torus network.","authors":"Abhilasha Sharma,&nbsp;R G Sangeetha","doi":"10.1007/s11227-020-03311-0","DOIUrl":"https://doi.org/10.1007/s11227-020-03311-0","url":null,"abstract":"<p><p>Reliability analysis is one of the crucial issues for any scalable optical interconnection network. Torus is a highly scalable optical interconnect for data centre networks. The traditional torus network has XY routing algorithm. We have proposed a novel optimised routing algorithm. This paper focuses on the time-dependent and time-independent analysis for both terminal and broadcast reliabilities of the torus network using XY and optimised routing algorithm under various network sizes ( <math><mrow><mi>N</mi> <mo>×</mo> <mi>N</mi></mrow> </math> where <math><mrow><mi>N</mi> <mo>=</mo> <mn>8</mn> <mo>,</mo> <mn>16</mn> <mo>,</mo> <mn>32</mn> <mo>,</mo> <mn>64</mn></mrow> </math> ). The results are evaluated and compared considering nodes failures in MATLAB.</p>","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"77 2","pages":"1517-1536"},"PeriodicalIF":3.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11227-020-03311-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"38297615","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
Exploratory study of introducing HPC to non-ICT researchers: institutional strategy is possibly needed for widespread adaption. 向非ict研究人员引入HPC的探索性研究:可能需要制度性策略来广泛适应。
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-01-01 Epub Date: 2020-09-28 DOI: 10.1007/s11227-020-03438-0
Bence Ferdinandy, Ángel Manuel Guerrero-Higueras, Éva Verderber, Francisco Javier Rodríguez-Lera, Ádám Miklósi

Machine learning algorithms are becoming more and more useful in many fields of science, including many areas where computational methods are rarely used. High-performance Computing (HPC) is the most powerful solution to get the best results using these algorithms. HPC requires various skills to use. Acquiring this knowledge might be intimidating and take a long time for a researcher with small or no background in information and communications technologies (ICTs), even if the benefits of such knowledge is evident for the researcher. In this work, we aim to assess how a specific method of introducing HPC to such researchers enables them to start using HPC. We gave talks to two groups of non-ICT researchers that introduced basic concepts focusing on the necessary practical steps needed to use HPC on a specific cluster. We also offered hands-on trainings for one of the groups which aimed to guide participants through the first steps of using HPC. Participants filled out questionnaires partly based on Kirkpatrick's training evaluation model before and after the talk, and after the hands-on training. We found that the talk increased participants' self-reported likelihood of using HPC in their future research, but this was not significant for the group where participation was voluntary. On the contrary, very few researchers participated in the hands-on training, and for these participants neither the talk, nor the hands-on training changed their self-reported likelihood of using HPC in their future research. We argue that our findings show that academia and researchers would benefit from an environment that not only expects researchers to train themselves, but provides structural support for acquiring new skills.

机器学习算法在许多科学领域变得越来越有用,包括许多很少使用计算方法的领域。高性能计算(HPC)是使用这些算法获得最佳结果的最强大的解决方案。HPC需要各种技能来使用。对于一个在信息通信技术(ict)方面背景很少或没有背景的研究人员来说,获得这些知识可能是令人生畏的,并且需要很长时间,即使这些知识对研究人员来说是显而易见的好处。在这项工作中,我们的目标是评估如何将HPC介绍给这些研究人员的特定方法使他们能够开始使用HPC。我们与两组非ict研究人员进行了会谈,介绍了基本概念,重点介绍了在特定集群上使用HPC所需的必要实际步骤。我们还为其中一个小组提供了实践培训,旨在指导参与者完成使用HPC的第一步。参与者在讲座前后和实践培训后填写了部分基于Kirkpatrick培训评估模型的问卷。我们发现,谈话增加了参与者在未来研究中使用HPC的自我报告可能性,但这对于自愿参与的小组来说并不显著。相反,很少有研究人员参加了实践培训,对于这些参与者来说,无论是演讲还是实践培训都没有改变他们在未来研究中使用HPC的自我报告可能性。我们认为,我们的研究结果表明,学术界和研究人员将受益于一个不仅期望研究人员训练自己,而且为获得新技能提供结构性支持的环境。
{"title":"Exploratory study of introducing HPC to non-ICT researchers: institutional strategy is possibly needed for widespread adaption.","authors":"Bence Ferdinandy,&nbsp;Ángel Manuel Guerrero-Higueras,&nbsp;Éva Verderber,&nbsp;Francisco Javier Rodríguez-Lera,&nbsp;Ádám Miklósi","doi":"10.1007/s11227-020-03438-0","DOIUrl":"https://doi.org/10.1007/s11227-020-03438-0","url":null,"abstract":"<p><p>Machine learning algorithms are becoming more and more useful in many fields of science, including many areas where computational methods are rarely used. High-performance Computing (HPC) is the most powerful solution to get the best results using these algorithms. HPC requires various skills to use. Acquiring this knowledge might be intimidating and take a long time for a researcher with small or no background in information and communications technologies (ICTs), even if the benefits of such knowledge is evident for the researcher. In this work, we aim to assess how a specific method of introducing HPC to such researchers enables them to start using HPC. We gave talks to two groups of non-ICT researchers that introduced basic concepts focusing on the necessary practical steps needed to use HPC on a specific cluster. We also offered hands-on trainings for one of the groups which aimed to guide participants through the first steps of using HPC. Participants filled out questionnaires partly based on Kirkpatrick's training evaluation model before and after the talk, and after the hands-on training. We found that the talk increased participants' self-reported likelihood of using HPC in their future research, but this was not significant for the group where participation was voluntary. On the contrary, very few researchers participated in the hands-on training, and for these participants neither the talk, nor the hands-on training changed their self-reported likelihood of using HPC in their future research. We argue that our findings show that academia and researchers would benefit from an environment that not only expects researchers to train themselves, but provides structural support for acquiring new skills.</p>","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"77 5","pages":"4317-4331"},"PeriodicalIF":3.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11227-020-03438-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"38454072","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}
引用次数: 3
Accurate computation: COVID-19 rRT-PCR positive test dataset using stages classification through textual big data mining with machine learning. 精确计算:COVID-19 rRT-PCR 阳性测试数据集,通过机器学习的文本大数据挖掘进行阶段分类。
IF 2.5 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2021-01-01 Epub Date: 2021-01-04 DOI: 10.1007/s11227-020-03586-3
Shalini Ramanathan, Mohan Ramasundaram

In every field of life, advanced technology has become a rapid outcome, particularly in the medical field. The recent epidemic of the coronavirus disease 2019 (COVID-19) has promptly become outbreaks to identify early action from suspected cases at the primary stage over the risk prediction. It is overbearing to progress a control system that will locate the coronavirus. At present, the confirmation of COVID-19 infection by the ideal standard test of reverse transcription-polymerase chain reaction (rRT-PCR) by the extension of RNA viral, although it presents identified from deficiencies of long reversal time to generate results in 2-4 h of corona with a necessity of certified laboratories. In this proposed system, a machine learning (ML) algorithm is used to classify the textual clinical report into four classes by using the textual data mining method. The algorithm of the ensemble ML classifier has performed feature extraction using the advanced techniques of term frequency-inverse document frequency (TF/IDF) which is an effective information retrieval technique from the corona dataset. Humans get infected by coronaviruses in three ways: first, mild respiratory disease which is globally pandemic, and human coronaviruses are caused by HCoV-NL63, HCoV-OC43, HCoV-HKU1, and HCoV-229E; second, the zoonotic Middle East respiratory syndrome coronavirus (MERS-CoV); and finally, higher case casualty rate defined as severe acute respiratory syndrome coronavirus (SARS-CoV). By using the machine learning techniques, the three-way COVID-19 stages are classified by the extraction of the feature using the data retrieval process. The TF/IDF is used to measure and evaluate statistically the text data mining of COVID-19 patient's record list for classification and prediction of the coronavirus. This study established the feasibility of techniques to analyze blood tests and machine learning as an alternative to rRT-PCR for detecting the category of COVID-19-positive patients.

在生活的各个领域,先进的技术已经成为一种快速的成果,尤其是在医疗领域。近期流行的2019年冠状病毒病(COVID-19)及时成为疫情,从疑似病例的初级阶段识别早期行动超过风险预测。推进冠状病毒定位的防控体系建设是霸道。目前,通过延长 RNA 病毒的反转录聚合酶链反应(rRT-PCR)的理想标准测试确认 COVID-19 感染,虽然它呈现确定从反转时间长的缺陷,生成结果在 2-4 h 的电晕与认证实验室的必要性。在这个拟议的系统中,使用了机器学习(ML)算法,通过文本数据挖掘方法将文本临床报告分为四类。集合式 ML 分类器的算法使用术语频率-反向文档频率(TF/IDF)的先进技术进行特征提取,这是从冠状病毒数据集中进行有效信息检索的技术。人类通过三种方式感染冠状病毒:首先是全球流行的轻度呼吸道疾病,人类冠状病毒主要由 HCoV-NL63、HCoV-OC43、HCoV-HKU1 和 HCoV-229E 引起;其次是人畜共患的中东呼吸综合征冠状病毒(MERS-CoV);最后是病例伤亡率较高的严重急性呼吸综合征冠状病毒(SARS-CoV)。通过使用机器学习技术,在数据检索过程中提取特征,对 COVID-19 的三个阶段进行分类。使用 TF/IDF 对 COVID-19 患者记录列表的文本数据挖掘进行统计测量和评估,以对冠状病毒进行分类和预测。这项研究确定了分析血液检测和机器学习技术作为 rRT-PCR 检测 COVID-19 阳性患者类别的替代方法的可行性。
{"title":"Accurate computation: COVID-19 rRT-PCR positive test dataset using stages classification through textual big data mining with machine learning.","authors":"Shalini Ramanathan, Mohan Ramasundaram","doi":"10.1007/s11227-020-03586-3","DOIUrl":"10.1007/s11227-020-03586-3","url":null,"abstract":"<p><p>In every field of life, advanced technology has become a rapid outcome, particularly in the medical field. The recent epidemic of the coronavirus disease 2019 (COVID-19) has promptly become outbreaks to identify early action from suspected cases at the primary stage over the risk prediction. It is overbearing to progress a control system that will locate the coronavirus. At present, the confirmation of COVID-19 infection by the ideal standard test of reverse transcription-polymerase chain reaction (rRT-PCR) by the extension of RNA viral, although it presents identified from deficiencies of long reversal time to generate results in 2-4 h of corona with a necessity of certified laboratories. In this proposed system, a machine learning (ML) algorithm is used to classify the textual clinical report into four classes by using the textual data mining method. The algorithm of the ensemble ML classifier has performed feature extraction using the advanced techniques of term frequency-inverse document frequency (TF/IDF) which is an effective information retrieval technique from the corona dataset. Humans get infected by coronaviruses in three ways: first, mild respiratory disease which is globally pandemic, and human coronaviruses are caused by HCoV-NL63, HCoV-OC43, HCoV-HKU1, and HCoV-229E; second, the zoonotic Middle East respiratory syndrome coronavirus (MERS-CoV); and finally, higher case casualty rate defined as severe acute respiratory syndrome coronavirus (SARS-CoV). By using the machine learning techniques, the three-way COVID-19 stages are classified by the extraction of the feature using the data retrieval process. The TF/IDF is used to measure and evaluate statistically the text data mining of COVID-19 patient's record list for classification and prediction of the coronavirus. This study established the feasibility of techniques to analyze blood tests and machine learning as an alternative to rRT-PCR for detecting the category of COVID-19-positive patients.</p>","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"77 7","pages":"7074-7088"},"PeriodicalIF":2.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7781398/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"38801977","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}
引用次数: 0
A novel clustering algorithm by clubbing GHFCM and GWO for microarray gene data 基于GHFCM和GWO的微阵列基因数据聚类算法
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2020-08-01 DOI: 10.1007/S11227-019-02953-Z
P. Dhas, B. Gomathi
{"title":"A novel clustering algorithm by clubbing GHFCM and GWO for microarray gene data","authors":"P. Dhas, B. Gomathi","doi":"10.1007/S11227-019-02953-Z","DOIUrl":"https://doi.org/10.1007/S11227-019-02953-Z","url":null,"abstract":"","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"30 1","pages":"5679-5693"},"PeriodicalIF":3.3,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75190193","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
Supercomputing: 6th Russian Supercomputing Days, RuSCDays 2020, Moscow, Russia, September 21–22, 2020, Revised Selected Papers 超级计算:第六届俄罗斯超级计算日,RuSCDays 2020,莫斯科,俄罗斯,2020年9月21-22日,修订论文选集
IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2020-02-02 DOI: 10.1007/978-3-030-64616-5
A. Ivanov, V. Levchenko, B. Korneev, A. Perepelkina
{"title":"Supercomputing: 6th Russian Supercomputing Days, RuSCDays 2020, Moscow, Russia, September 21–22, 2020, Revised Selected Papers","authors":"A. Ivanov, V. Levchenko, B. Korneev, A. Perepelkina","doi":"10.1007/978-3-030-64616-5","DOIUrl":"https://doi.org/10.1007/978-3-030-64616-5","url":null,"abstract":"","PeriodicalId":50034,"journal":{"name":"Journal of Supercomputing","volume":"17 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2020-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87472271","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
期刊
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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1