检索结果-内蒙古大学图书馆

COVID-19 Pandemic: A Worldwide Critical Review with the Machine Learning Model-Based Prediction

Journal of The Institution of Engineers (India): Series B 2025年第1期106卷 339-349页

作者： Misra, Neeraj Kumar Das, Sanchali Satpathy, Sambit Addula, Santosh Reddy Trivedi, Munesh Chandra School of Electronics Engineering VIT-AP University Andhra Pradesh Amaravathi522237 India School of Computer Science Engineering and Technology Bennett University Greater Noida India Computer Science and Engineering Galgotias College of Engineering and Technology Greater Noida India Information Technology University of the Cumberlands Williamsburg United States Computer Science and Engineering PSSCIVE Bhopal Bhopal India

Machine learning (ML) with data analysis has many successful applications and is widely employed daily. Additionally, they have played a significant role in combating the global coronavirus (COVID-19) outbreak. International occurrences of the COVID-19 pandemic have resulted from the rapid global spread of the SARS-CoV-2 virus. In this study, we examine the ML and data analysis techniques for diagnosis, treatment, and impact of COVID-19, which are based on artificial intelligence (AI). Moreover, we provide an overview of the current state of the art in AI-based machine learning and deep learning techniques as well as the datasets, tools, and performance of the tools that can be used to combat COVID-19. In this survey, we have attempted to provide a comprehensive overview of the most recent state-of-the-art approaches available to researchers in Mathematical and Statistical analysis and the larger medical community as a whole. It also includes information on how data and ML can be used to improve COVID-19 status and encourage further research to prevent COVID-19 outbreaks. Future directions and problems are also described in detail. © The Institution of Engineers (India) 2024.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

Improved Dynamic Johnson Sequencing Algorithm(DJS)in Cloud Computing Environment for Efficient Resource Scheduling for Distributed Overloading

引用

Journal of Systems Science and Systems engineering 2024年第4期33卷 391-424页

作者： Anurag Sinha Pallab Banerjee Sharmistha Roy Nitasha Rathore Narendra Pratap Singh Mueen Uddin Maha Abdelhaq Raed Alsaqour Department of Computer Science Engineering ICFAI Tech SchoolICFAI UniversityJharkhandRanchi834004India Department of Computer Science Engineering Amity UniversityJharkhandRanchi835303India Department of Computing and Information Technology Usha Martin UniversityRanchi835103India Department of Information Technology Bharti Vidyapeeth’s College of EngineeringPaschim ViharNew DelhiIndia Department of CSE Delhi UniversityNew DelhiIndia College of Computing and Information Technology University of Doha for Science and TechnologyDoha24449Qatar Department of Information Technology College of Computer and Information SciencesPrincess Nourah Bint Abdurrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Department of Information Technology College of Computing and InformaticsSaudi Electronic University93499RiyadhSaudi Arabia

This study introduces an innovative approach to optimize cloud computing job distribution using the Improved Dynamic Johnson Sequencing Algorithm(DJS).Emphasizing on-demand resource sharing,typical to Cloud Service Providers(CSPs),the research focuses on minimizing job completion delays through efficient task *** Johnson’s rule from operations research,the study addresses the challenge of resource availability post-task *** advocates for queuing models with multiple servers and finite capacity to improve job scheduling models,subsequently reducing wait times and queue *** Dynamic Johnson Sequencing Algorithm and the M/M/c/K queuing model are applied to optimize task sequences,showcasing their efficacy through comparative *** research evaluates the impact of makespan calculation on data file transfer times and assesses vital performance indicators,ultimately positioning the proposed technique as superior to existing approaches,offering a robust framework for enhanced task scheduling and resource allocation in cloud computing.

关键词： First come first served(FCFS)scheduling round robin task scheduling queuing model Johnson scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

A geometric-approach based Combinatorial Transformative Scalogram analysis for multiclass identification of pathologies in a voice signal

引用

Multimedia Tools and Applications 2024年 1-21页

作者： Khumukcham, Ranita Nongmeikapam, Kishorjit Department of Electronics and Communication Engineering Indian Institute of Information Technology Mantripukhri Manipur Imphal795002 India Department of Computer Science and Engineering Indian Institute of Information Technology Mantripukhri Manipur Imphal795002 India

Many researchers have preferred non-invasive techniques for recognizing the exact type of physiological abnormality in the vocal tract by training machine learning algorithms with feature descriptors extracted from the voice signal. However, until now, most techniques have been limited to classifying whether a voice is normal or abnormal. It is crucial that the trained Artificial Intelligence (AI) be able to identify the exact pathology associated with voice for implementation in a realistic environment. Another issue is the need to suppress the ambient noise that could be mixed up with the spectra of the voice. Current work proposes a robust, less time-consuming and non-invasive technique for the identification of pathology associated with a laryngeal voice signal. More specifically, a two-stage signal filtering approach that encompasses a score-based geometric approach and a glottal inverse filtering method is applied to the input voice signal. The aim here is to estimate the noise spectra, to regenerate a clean signal and finally to deliver a completely fundamental glottal flow-derived signal. For the next stage, clean glottal derivative signals are used in the formation of a novel fused-scalogram which is currently referred to as the "Combinatorial Transformative Scalogram (CTS)." The CTS is a time-frequency domain plot which is a combination of two time-frequency scalograms. There is a thorough investigation of the performance of the two individual scalograms as well as that of the CTS *** classification metrics are used to investigate performance, which are: sensitivity, mean accuracy, error, precision, false positive rate, specificity, Cohen’s kappa, Matthews Correlation Coefficient, and F1 score. Implementation of the VOice ICar fEDerico II (VOICED) standard database provided the highest mean accuracy of 94.12% with a sensitivity of 93.85% and a specificity of 97.96% against other existing techniques. The current method performed well despite the d

关键词： Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

Identify information sources with different start times in complex networks based on sparse observers

引用

Chinese Physics B 2024年第11期33卷 467-479页

作者： Yuan-Zhang Deng Zhao-Long Hu Feilong Lin Chang-Bing Tang Hui Wang Yi-Zhen Huang School of Computer Science and Technology Zhejiang Normal UniversityJinhua 321004China School of Physics and Electronic Information Engineering Zhejiang Normal UniversityJinhua 321004China School of Information Engineering Jinhua PolytechnicJinhua 321016China

The dissemination of information across various locations is an ubiquitous occurrence,however,prevalent methodologies for multi-source identification frequently overlook the fact that sources may initiate dissemination at distinct initial *** there are many research results of multi-source identification,the challenge of locating sources with varying initiation times using a limited subset of observational nodes remains *** this study,we provide the backward spread tree theorem and source centrality theorem,and develop a backward spread centrality algorithm to identify all the information sources that trigger the spread at different start *** proposed algorithm does not require prior knowledge of the number of sources,however,it can estimate both the initial spread moment and the spread *** core concept of this algorithm involves inferring suspected sources through source centrality theorem and locating the source from the suspected sources with linear *** experiments from synthetic and real network simulation corroborate the superiority of our method in terms of both efficacy and ***,we find that our method maintains robustness irrespective of the number of sources and the average degree of *** with classical and state-of-the art source identification methods,our method generally improves the AUROC value by 0.1 to 0.2.

关键词： complex networks information spread source identification backward spread centricity

来源：评论

学校读者我要写书评

暂无评论

Artificial intelligence-inspired comprehensive framework for desertification prediction

引用

International Journal of Cognitive Computing in engineering 2025年 6卷 462-476页

作者： Alsubai, Shtwai Mosleh, Mogeeb A.A. Al-Hadhrami, Suheer A. Bhatia, Munish College of Computer Engineering and Sciences Prince Sattam bin Abdulaziz University Alkharj Saudi Arabia Faculty of Engineering & Computing University of Science & Technology Aden Yemen Faculty of Engineering and Information Technology Taiz Univeristy Taiz Yemen Department of Computer Engineering College of Engineering Al Mukalla Hadhramout Yemen Department of Computer Applications National Institute of Technology Kurukshetra India

Desertification greatly affects land deterioration, farming efficiency, economic growth, and health, especially in Gulf nations. Climate change has worsened desertification, making developmental issues in the area even more difficult. This research presents an enhanced framework utilizing the Internet of Things (IoT) for ongoing monitoring, data gathering, and analysis to evaluate desertification patterns. The framework utilizes Bayesian Belief Networks (BBN) to categorize IoT data, while a low-latency processing method on edge computing platforms enables effective detection of desertification trends. The classified data is subsequently analyzed using an Artificial Neural Network (ANN) optimized with a Genetic Algorithm (GA) for forecasting decisions. Using cloud computing infrastructure, the ANN-GA model examines intricate data connections to forecast desertification risk elements. Moreover, the Autoregressive Integrated Moving Average (ARIMA) model is employed to predict desertification over varied time intervals. Experimental simulations illustrate the effectiveness of the suggested framework, attaining enhanced performance in essential metrics: Temporal Delay (103.68 s), Classification Efficacy—Sensitivity (96.44 %), Precision (95.56 %), Specificity (96.97 %), and F-Measure (96.69 %)—Predictive Efficiency—Accuracy (97.76 %) and Root Mean Square Error (RMSE) (1.95 %)—along with Reliability (93.73 %) and Stability (75 %). The results of classification effectiveness and prediction performance emphasize the framework's ability to detect high-risk zones and predict the severity of desertification. This innovative method improves the comprehension of desertification processes and encourages sustainable land management practices, reducing the socio-economic impacts of desertification and bolstering at-risk ecosystems. The results of the study hold considerable importance for enhancing regional efforts in combating desertification, ensuring food security, and formulatin

关键词： Life on land Climate action Desertification Internet of things Artificial neural network

来源：评论

学校读者我要写书评

暂无评论

Sample-based relationship for assisting diagnosis of pneumonia in medical care

引用

Multimedia Tools and Applications 2025年第1期84卷 267-288页

作者： Chen, Hongkang Lu, Huijuan Zhu, Wenjie Zhou, Ye Yao, Yudong Wang, Renfeng College of Information Engineering China Jiliang University Zhejiang Hangzhou China Drore Information and Technology Co. LTD Zhejiang Hangzhou China Department of Electrical and Computer Engineering Stevens Institute of Technology HobokenNJ United States College of Computer Science and Technology Zhejiang University Zhejiang Hangzhou China

Deep neural networks have succeeded in learning balanced and imbalanced data in the field of pneumonia diagnosis. However, both require separate model designs in their respective domains. The pneumonia recognition methods have poor transfer performance between the two types of image distribution data. This paper proposes BeFormer, which focuses on sample relationships. BeFormer introduces two stages, feature extraction and establishing sample relationships, to solve the problem. Specifically, in the feature extraction stage, a new backbone network called PANet based on Multi-Scale Frequency Domain Attention (FPSA) is proposed. In establishing sample relationships, Deformable Transformer is used in parallel to model the relationships between partial regions of interest among the same and different samples in the pneumonia dataset. These two modules are connected in series to form BeFormer. Without making any changes to the model, this paper conducted experiments using BeFormer on both balanced and imbalanced pneumonia datasets. As compared to traditional pneumonia recognition models, the proposed method achieved significant improvements in the two different data distributions, demonstrating outstanding transfer performance. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Incremental Weighted Ensemble for Data Streams With Concept Drift

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第1期5卷 92-103页

作者： Jiao, Botao Guo, Yinan Yang, Cuie Pu, Jiayang Zheng, Zhiji Gong, Dunwei School of Electromechanical and Information Engineering Beijing100083 China China University of Mining and Technology School of Information and Control Engineering Xuzhou221116 China Victoria University of Wellington School of Engineering and Computer Wellington6140 New Zealand Electromechanical and Information Engineering Beijing100083 China Qingdao University of Science and Technology School of Information Science and Technology Qingdao266061 China

As a popular strategy to tackle concept drift, chunk-based ensemble method adapts a new concept by adjusting the weights of historical classifiers. However, most previous approaches normally evaluate the historical classifier based on an entire chunk newly arrived, which may cause delayed adaptation. To address the issue, two novel ensemble models, named incremental weighted ensemble (IWE) and incremental weighted ensemble for multi-classification (IWE-M), are proposed. At each time step, all base classifiers are incrementally updated on a newly arrived instance. Following that, the instance is collected into a cache array. Once a data chunk is formed, a new base classifier is created. More specially, a forgetting mechanism based on variable-size window is designed to adjust the weight of each base classifier in IWE in terms of its classification accuracy on the latest instances in an online manner. IWE-M, an extension of IWE, aims to solve multiclass problems with local concept drifts. In IWE-M, the weight of a base classifier is expanded to a weight vector. In this way, this ensemble model can retain specific historical information about nondrift regions from a local drift. Experimental results show that the proposed ensemble frameworks outperform six competitive approaches on accuracy and G-mean. © 2020 IEEE.

关键词： Classifiers

来源：评论

学校读者我要写书评

暂无评论

Drug-Target Interactions Prediction Based on Signed Heterogeneous Graph Neural Networks

引用

Chinese Journal of Electronics 2024年第1期33卷 231-244页

作者： Ming CHEN Yajian JIANG Xiujuan LEI Yi PAN Chunyan JI Wei JIANG College of Information Science and Engineering Hunan Normal University School of Computer Science Shaanxi Normal University Faculty of Computer Science and Control Engineering Shenzhen Institute of Advanced TechnologyChinese Academy of Sciences Computer Science Department BNU-HKBU United International College

Drug-target interactions(DTIs) prediction plays an important role in the process of drug *** computational methods treat it as a binary prediction problem, determining whether there are connections between drugs and targets while ignoring relational types information. Considering the positive or negative effects of DTIs will facilitate the study on comprehensive mechanisms of multiple drugs on a common target, in this work, we model DTIs on signed heterogeneous networks, through categorizing interaction patterns of DTIs and additionally extracting interactions within drug pairs and target protein pairs. We propose signed heterogeneous graph neural networks(SHGNNs), further put forward an end-to-end framework for signed DTIs prediction, called SHGNN-DTI,which not only adapts to signed bipartite networks, but also could naturally incorporate auxiliary information from drug-drug interactions(DDIs) and protein-protein interactions(PPIs). For the framework, we solve the message passing and aggregation problem on signed DTI networks, and consider different training modes on the whole networks consisting of DTIs, DDIs and PPIs. Experiments are conducted on two datasets extracted from Drug Bank and related databases, under different settings of initial inputs, embedding dimensions and training modes. The prediction results show excellent performance in terms of metric indicators, and the feasibility is further verified by the case study with two drugs on breast cancer.

关键词： Drug-target interactions Signed heterogeneous network Link sign prediction Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Harnessing Social Media Data for Text Classification During Emergency 2024

Harnessing Social Media Data for Text Classification During ...

引用

16th International Conference on Contemporary Computing, IC3 2024

作者： Dixit, Ankita Chawla, Indu Department of Computer Science & Engineering and Information Technology Jaypee Institute of Information Technology Noida India

ISBN: (纸本)9798400709722

Social media platforms offer a plethora of valuable resources in times of disaster. Social media platforms like Twitter allow the sharing of information by individuals in the time of crisis. In this study, highlights difficulty in differentiating between situation related tweets and are intend to investigate the belongingness of tweets that are related to the disaster or not related to the disaster. This work proposes an exploration of n-gram-based feature extraction in the form of unigram, bigram, and trigram. Further combinations of unigram, bigram and trigram have been taken with cut-off value 50%. To intensify performance, the two-step ensemble stacking method is implemented to categorize tweets by enhancing the diversity among the base learners and utilizing the meta-learner to merge the predictions made by base learners. To verify the approach, experimentation done with ensemble method and then compared with linear and non-linear machine learning algorithms. The obtained result shows stacking ensemble method with decision tree as meta learner gives the best results. The findings of the study revealed that our proposed method demonstrates a robust solution to help identify disaster related tweets during a disaster and empower individuals, groups, and organizations to improve communication during emergencies. © 2024 Copyright held by the owner/author(s).

关键词： Tweets

来源：评论

学校读者我要写书评

暂无评论

Click Fraud Detection Using Ensemble Classifier 1

引用

3rd International Conference on Artificial-Business Analytics, Quantum and Machine Learning: Trends, Perspectives, and Prospects, Com-IT-Con 2023

作者： Purwar, Archana Jain, Art Chawla, Indu Gupta, Ishita Raj, Mayank Jain, Divansh Department of Computer Science and Engineering and Information Technology Jaypee Institute of Information Technology Noida India

ISBN: (数字)9789819748600

ISBN: (纸本)9789819748594

Online advertising fraud is an emerging issue and has drawn researchers’ mind recently because it now poses a significant danger to an online advertising sector. A content publisher signs an agreement to place advertisements on various websites in exchange for commissions on the basis of the amount of traffic these advertisements generate. It may sometimes motivate fraudulent publishers to produce unauthorized clicks on their websites in order to maximize traffic to the advertisements, a practice known as click fraud. Although click fraud is identified as a huge issue, there are not many algorithms that have been able to effectively solve this problem. Our aim in this paper is to overcome the problem of click fraud and come up with an explicit model for the click fraud detection. In this paper, a model is proposed using recursive feature elimination (RFE) and ensemble classifier with Hellinger distance-based decision tree (HDDT). The proposed model is evaluated over the dataset hosted by a Chinese company TalkingData available freely from Kaggle and has resulted in an accuracy of 99.72% as compared to the traditional decision tree. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Marketing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：