PeerJ Computer Science最新文献

{"title":"Alzheimer's disease detection using a quantum deep neural network with Haralick feature extraction and simulated annealing optimization.","authors":"Sabari Vasan S, Jayalakshmi P","doi":"10.7717/peerj-cs.3387","DOIUrl":"https://doi.org/10.7717/peerj-cs.3387","url":null,"abstract":"<p><p>Alzheimer's disease (AD) is a neurodegenerative disorder that affects a wide range of individuals worldwide. It is of utmost importance to detect AD at an earlier stage and diagnose it to manage the disease effectively. Detecting AD using traditional methodologies is not cost-effective and time-consuming because of the clinical tests and neuroimaging methods involved. Over the last few years, quantum computing and deep learning (DL) have become practical approaches for detecting and diagnosing AD. Unlike conventional methods, quantum computing allows for faster solving complex and entangled computable problems. DL models have a high potential for automatically learning and extracting pertinent features even from larger datasets. Hence, a new approach combining multiple concepts such as deep neural network (DNN), quantum computing, simulated annealing (SA) optimisation, and Haralick feature extraction has been proposed in this work for detecting AD. A quantum deep neural network (QDNN) is introduced in this article to take over the extraordinary computational capability of quantum systems. Haralick feature extraction is implemented in this study to extract the texture features from the medical images, resulting in a rich feature set for the model. The dataset used in this study, The Best Alzheimer's MRI Dataset contains 11,519 axial MRI images in .jpg format with a resolution of 128 × 128 pixels, categorised into four balanced classes-no impairment, very mild impairment, mild impairment, and moderate impairment-each comprising 2,560 images. To optimise the Haralick features from medical images and to enhance the model's learning process with optimised parameters, a new feature-specific simulated annealing method (FSSA) has been introduced in this article. The experimental results proved that our model achieved an accuracy of 98%, a precision of 99%, a sensitivity of 97%, and a specificity of 98%. The results achieved in this study are better than the traditional model's performance, and thus better in all performance metrics. The results indicated that the proposed QDNN model is a good framework for AD detection.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"12 ","pages":"e3387"},"PeriodicalIF":2.5,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13067259/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147678202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A new era in identification of tick genera; artificial intelligence for precision and speed.","authors":"Ibrahim A Ame, Abdullahi Ibrahim Umar, Cenk S Ozverel, Erdal Şanlıdağ, Ayse Seyer, Fadi Al-Turjman, Tamer Sanlidag","doi":"10.7717/peerj-cs.3291","DOIUrl":"10.7717/peerj-cs.3291","url":null,"abstract":"<p><strong>Background: </strong>The occurrence of pandemics in the last 20 years highlighted the unpreparedness of healthcare systems. There is a worldwide increased trend in the vector borne diseases. Ticks are one of the most common organisms that play a vital role in global ecosystem as well as being vectors of diseases affecting human and livestock. They are able to carry infectious agents that might cause illnesses including paralysis and to some certain extend death. Therefore, it is crucial to identify different genera of ticks to track infectious agents. Conventionally, tick classification is done by acarologists who are experts in the field. For this reason, the identification process is carried out in a difficult and time-consuming manner.</p><p><strong>Method: </strong>The aim of the study was to develop a web-based application by using artificial intelligence-based algorithms to easily identify Hyalomma and Rhipicephalus ticks, which are the most abundant genera in Northern Cyprus, with high sensitivity and accuracy. The experimental procedure is structured based on five phases. Phase 1 revolves around data collection in which pictures of 35 identified ticks are taken by experienced acarologists and the curation of non-tick images (spiders, beetles, mites, mosquitos and scorpions). Phase 2 revolves around pre-processing steps and data split. Phase 3 involves training and testing custom Convolutional Neural Network (CNN), Visual Geometry Group 16 (VGG16), Residual Network 50 (ResNet-50) using 6,972 images (3,486 images for each class) for discrimination between ticks and non-ticks and 9,556 images (4,778 images for each class) for the discrimination between Hyalomma and Rhipicephalus. Phase 4 revolves around performance evaluation. Phase 5 is characterized by development of a web-based application (I-TickNet), created to enable a widespread use of the tick classifier.</p><p><strong>Results: </strong>The performance evaluation and comparison of the model performance has shown that ResNet50 achieved the best result for binary classification of tick and non-tick (experiment A) with accuracy of 100% and Area Under the Curve (AUC) score of 100%. Moreover, VGG16 achieved the best result for binary classification of ticks (experiment B) with an accuracy of 96.97% and AUC score of 99.55% respectively. All the three models were employed for the development of artificial intelligence/Internet of Things (AI/IoT) framework known as I-TickNet for real-time and on-spot classification of tick images. In conclusion, this study provided a web-based application that can identify two distinct tick genera with high accuracy and sensitivity. The application developed enabled a user-friendly interface to identify genera without requiring any expertise.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"12 ","pages":"e3291"},"PeriodicalIF":2.5,"publicationDate":"2026-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12851202/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146088006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"MS-YieldStackNet: multi-source data fusion for wheat yield estimation using a stacked ensemble neural network.","authors":"Waqas Ali, Zeeshan Ramzan, Muhammad Shahbaz, Qamar Ul Zaman Bhutta, Muhammad Talha, Mohammed J AlGhamdi","doi":"10.7717/peerj-cs.3434","DOIUrl":"10.7717/peerj-cs.3434","url":null,"abstract":"<p><p>Accurate crop yield prediction is vital for ensuring food security and informing agricultural policy, particularly in wheat-dependent regions like Pakistan where manual estimation methods are labor-intensive and imprecise. This study introduces a novel algorithmic framework, MS-YieldStackNet, to predict wheat yield with high spatial resolution by integrating multispectral satellite imagery, <i>in-situ</i> soil analytics, and meteorological variables. A unified feature space is constructed using Normalized Difference Vegetation Index (NDVI) and Difference Vegetation Index (DVI), soil physicochemical attributes, and temporal climate patterns, processed through a stacked ensemble neural architecture (MS-YieldStackNet) combining three parallel feed-forward neural networks (FFNNs) and a Random Forest meta-learner. The model achieved robust performance with an R-squared of 0.81, Mean Squared Error (MSE) of 6,114.30 kg/ha, root mean squared error (RMSE) of 78.19 kg/ha, mean absolute error (MAE) of 59.07 kg/ha, and mean absolute percentage error (MAPE) of 3.55%, demonstrating its potential for precise and scalable crop yield forecasting.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"12 ","pages":"e3434"},"PeriodicalIF":2.5,"publicationDate":"2026-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12818367/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146020675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A hybrid algorithmic model for enhancing security in intelligent reflecting surface-assisted wireless communication.","authors":"Sivasankar S, Markkandan S","doi":"10.7717/peerj-cs.3285","DOIUrl":"https://doi.org/10.7717/peerj-cs.3285","url":null,"abstract":"<p><p>This article introduces Synergistic Gradient Projection with Dynamic Adaptive Risk Expansion (SGP-DARE), a hybrid optimization framework designed to enhance physical-layer security in wireless networks supported by intelligent reflecting surfaces (IRSs). The proposed framework integrates Synergistic Gradient Projection (SGP) for low-complexity joint optimization of base station beamforming and IRS phase shifts, with Dynamic Adaptive Risk Expansion (DARE) ensuring robustness against channel state information (CSI) uncertainties and user mobility. SGP-DARE operates effectively under hardware limitations, including phase quantization, while targeting key objectives such as minimizing secrecy outage probability and improving energy efficiency. Simulation results demonstrate that SGP-DARE significantly outperforms baseline methods in critical metrics of security and efficiency.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3285"},"PeriodicalIF":2.5,"publicationDate":"2025-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12915676/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146229787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Robust coffee plant disease classification using deep learning and advanced feature engineering techniques.","authors":"Hanin Ardah, Maher Alrahhal, Walaa M Abd-Elhafiez, Doaa Trabay","doi":"10.7717/peerj-cs.3386","DOIUrl":"10.7717/peerj-cs.3386","url":null,"abstract":"<p><p>Coffee, the world's most traded tropical crop, is vital to the economies of many producing countries. However, coffee leaf diseases pose a serious threat to coffee quality and sustainable production. Deep learning has shown strong performance in plant disease identification through automatic image classification. Nevertheless, reliance on a single convolutional neural networks (CNNs) architecture restricts feature variability and real-world generalization. Moreover, limited work has systematically combined feature selection/reduction with CNNs, which constrains the advancement of hybrid models capable of capturing complementary features while ensuring computational efficiency without accuracy loss. This article presents an enhanced deep learning-based framework for coffee disease classification incorporating a hybrid strategy that integrates CNNs and advanced feature selection algorithms. GoogLeNet and ResNet18 are paired for complementary feature extraction, Principal Component Analysis (PCA) and Singular Value Decomposition (SVD) are employed for dimensionality reduction, and ANOVA and Chi-square are applied to select the most informative features. An Adam optimizer (learning rate = 0.001, batch size = 20, epochs = 50) with early stopping is used for training. Experiments on the BRACOL dataset achieved 99.78% accuracy, with precision, recall, and F1-score all exceeding 99% across classes. To the best of our knowledge, this study systematically integrates GoogLeNet and ResNet18 with PCA/SVD dimensionality reduction and analysis of variance (ANOVA)/Chi-square feature selection, for coffee disease classification, thereby addressing a key gap in prior research.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3386"},"PeriodicalIF":2.5,"publicationDate":"2025-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12695173/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145745697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"KomoTrip: a multi-day travel itinerary recommendation method based on the discrete komodo mlipir algorithm.","authors":"Z K Abdurahman Baizal, Soni Fajar Surya Gumilang, Rio Nurtantyana, Rahmat Hendrawan","doi":"10.7717/peerj-cs.3350","DOIUrl":"10.7717/peerj-cs.3350","url":null,"abstract":"<p><p>Technological developments in recent years led to the emergence of increasingly sophisticated recommender systems to support multi-day travel itineraries that fall under the Tourist Trip Design Problem (TTDP). Various problem analogies are widely used to solve TTDP, such as Traveling Salesman Problem (TSP), Vehicle Routing Problem (VRP), Orienteering Problem (OP), and Team Orienteering Problem with Time Windows (TOPTW). For multi-day route recommendation, TOPTW is suitable as a problem analogy since there is a per-day travel duration constraint. So far, TTDP with TOPTW does not consider the weighting (priority level of users) for each requirement attribute in a multi-attribute-based TOPTW to ensure personalized recommendations. In addition, running time remains a challenge in many studies in the TOPTW area. Many metaheuristic algorithms have been adopted to TOPTW for generating a time-efficient approach. Komodo Mlipir Algorithm (KMA) emerges as a new algorithm that promises good scalability. Therefore, we propose KomoTrip, a method that adopts the discrete version of KMA and Multi-Attribute Utility Theory (MAUT) to recommend optimal travel routes per day by accommodating the multi-attribute preferences of users. We perform three evaluation scenarios, <i>i.e</i>., general performance, Degree of Interest (DOI) combinations, and varying numbers of Points of Interest (POI), consistently demonstrating that KomoTrip outperforms several benchmark algorithms in terms of computational time efficiency and also exhibits robust fitness values across different problem dimension scales. Thus, KomoTrip can be regarded as an efficient algorithm to recommend optimal multi-day tour routes, effectively incorporating weighted multi-attribute preferences into its optimization process. We further benchmarked KomoTrip against state-of-the-art TOPTW heuristics on the public Solomon dataset, where it demonstrated competitive profit values, particularly for a larger number of days (tours), and consistently achieved superior runtime performance.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3350"},"PeriodicalIF":2.5,"publicationDate":"2025-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12704617/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145770019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multimodal image fusion for enhanced vehicle identification in intelligent transport.","authors":"Naif Al Mudawi, Muhammad Waqas Ahmed, Haifa F Alhasson, Naif S Alshassari, Abdulwahab Alazeb, Mohammed Alshehri, Bayan Alabdullah","doi":"10.7717/peerj-cs.3270","DOIUrl":"10.7717/peerj-cs.3270","url":null,"abstract":"<p><p>Target detection in remote sensing is essential for applications such as law enforcement, military surveillance, and search-and-rescue. With advancements in computational power, deep learning methods have excelled in processing unimodal aerial imagery. The availability of diverse imaging modalities including, infrared, hyperspectral, multispectral, synthetic aperture radar, and Light Detection and Ranging (LiDAR) allows researchers to leverage complementary data sources. Integrating these multi-modal datasets has significantly enhanced detection performance, making these technologies more effective in real-world scenarios. In this work, we propose a novel approach that employs a deep learning-based attention mechanism to generate depth maps from aerial images. These depth maps are fused with RGB images to achieve enhanced feature representation. For image segmentation, we use Markov Random Fields (MRF), and for object detection, we adopt the You Only Look Once (YOLOv4) framework. Furthermore, we introduce a hybrid feature extraction technique that combines Histogram of Oriented Gradients (HOG) and Binary Robust Invariant Scalable Keypoints (BRISK) descriptors within the Vision Transformer (ViT) framework. Finally, a Residual Network with 18 layers (ResNet-18) is used for classification. Our model is evaluated on three benchmark datasets Roundabout Aerial, AU-Air, and Vehicle Aerial Imagery Dataset (VAID) achieving precision scores of 98.4%, 96.2%, and 97.4%, respectively, for object detection. Experimental results demonstrate that our approach outperforms existing state-of-the-art methods in vehicle detection and classification for aerial imagery.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3270"},"PeriodicalIF":2.5,"publicationDate":"2025-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12594218/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145483889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"CrossAlignNet: a self-supervised feature learning framework for 3D point cloud understanding.","authors":"Fei Wang, Xingzhen Dong, Jia Wu, Weishi Zhang, Tuo Zhou","doi":"10.7717/peerj-cs.3194","DOIUrl":"10.7717/peerj-cs.3194","url":null,"abstract":"<p><p>We propose a self-supervised point cloud representation learning framework CrossAlignNet based on cross-modal mask alignment strategy, to solve the problems of imbalance between global semantic and local geometric feature learning, as well as cross-modal information asymmetry in existing methods. A geometrically consistent mask region is established between the point cloud patches and the corresponding image patches through a synchronized mask alignment strategy to ensure cross-modal information symmetry. A dual-task learning framework is designed: the global semantic alignment task enhances the cross-modal semantic consistency through contrastive learning, and the local mask reconstruction task fuses the image cues using the cross-attention mechanism to recover the local geometric structure of the masked point cloud. In addition, the ShapeNet3D-CMA dataset is constructed to provide accurate point cloud-image spatial mapping relations to support cross-modal learning. Our framework shows superior or comparative results against existing methods on three point cloud understanding tasks including object classification, few-shot classification, and part segmentation.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3194"},"PeriodicalIF":2.5,"publicationDate":"2025-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453720/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145132413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A method for semantic textual similarity on long texts.","authors":"Omar Zatarain, Juan Carlos González-Castolo, Silvia Ramos-Cabral","doi":"10.7717/peerj-cs.3202","DOIUrl":"10.7717/peerj-cs.3202","url":null,"abstract":"<p><p>This work introduces a method for the semantic similarity of long documents using sentence transformers and large language models. The method detects relevant information from a pair of long texts by exploiting sentence transformers and large language models. The degree of similarity is obtained with an analytical fuzzy strategy that enables selective iterative retrieval under noisy conditions. The method discards the least similar pairs of sentences and selects the most similar. The preprocessing consists of splitting texts into sentences. The analytical strategy classifies pairs of texts by a degree of similarity without prior training on a dataset of long documents. Instead, it uses pre-trained models with any token capacity, a set of fuzzy parameters is tuned based on a few assessment iterations, and the parameters are updated based on criteria to detect four classes of similarity: identical, same topic, concept related, and non-related. This method can be employed in both small sentence transformers and large language models to detect similarity between pairs of documents of random sizes and avoid truncation of texts by testing pairs of sentences. A dataset of long texts in English from Wikipedia and other public sources, jointly with its gold standard, is provided and reviewed to test the method's performance. The method's performance is tested with small-token-size sentence transformers, large language models (LLMs), and text pairs split into sentences. Results prove that smaller sentence transformers are reliable for obtaining the similarity on long texts and indicate this method is an economical alternative to the increasing need for larger language models to find the degree of similarity between two long texts and extract the relevant information. Code and datasets are available at: https://github.com/omarzatarain/long-texts-similarity. Results of the adjustment of parameters can be found at https://doi.org/10.6084/m9.figshare.29082791.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3202"},"PeriodicalIF":2.5,"publicationDate":"2025-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453783/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145132630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Hybrid ARIMA-LSTM for COVID-19 forecasting: a comparative AI modeling study.","authors":"Al Mahmud, Syed Husni Noor Syed Hatim Noor, Kamarul Imran Musa, Firdaus Mohamad Hamzah, Zainab Mat Yudin, Noorshaida Kamaruddin, Ashwini M Madawana, Mohamad Arif Awang Nawi","doi":"10.7717/peerj-cs.3195","DOIUrl":"10.7717/peerj-cs.3195","url":null,"abstract":"<p><p>Pandemics present critical challenges to global health systems, economies, and societal structures, necessitating the development of accurate forecasting models for effective intervention and resource allocation. Classical statistical models such as the autoregressive integrated moving average (ARIMA) have been widely employed in epidemiological forecasting; however, they struggle to capture the nonlinear trends and dynamic fluctuations inherent in pandemic data. Conversely, deep learning models such as long short-term memory (LSTM) networks demonstrate strong capabilities in modeling complex dependencies but often require substantial data and computational resources. To boost forecasting precision, hybrid models such as ARIMA-LSTM integrate the advantages of traditional and deep learning methods. This study evaluates and compares the performance of ARIMA, LSTM, and hybrid ARIMA-LSTM models in predicting pandemic trends, using COVID-19 data from the Malaysian Ministry of Health as a case study. The dataset covers the period from 4 January 2021 to 18 September 2021, and model performance is evaluated using key metrics, including mean squared error (MSE), mean absolute error (MAE), mean absolute percentage error (MAPE), root mean squared error (RMSE), relative root mean squared error (RRMSE), normalized root mean squared error (NRMSE), and the coefficient of determination (R²). The results demonstrate that ARIMA performs poorly in capturing pandemic trends, while LSTM improves forecasting accuracy. However, the hybrid ARIMA-LSTM model consistently achieves the lowest error rates, confirming the advantage of integrating statistical and deep learning methodologies. All findings support the adoption of hybrid modeling approaches for pandemic forecasting, contributing to more accurate and reliable predictive analytics in epidemiology. Future research should investigate the generalizability of hybrid models across various infectious diseases and integrate additional real-time external variables to improve forecasting reliability.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3195"},"PeriodicalIF":2.5,"publicationDate":"2025-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453849/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145132481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}