首页 > 最新文献

PeerJ Computer Science最新文献

英文 中文
BEPCD: an ensemble learning-based intrusion detection framework for in-vehicle CAN bus. 基于集成学习的车载CAN总线入侵检测框架。
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-19 eCollection Date: 2025-01-01 DOI: 10.7717/peerj-cs.3108
Bocheng Xu, Fei Cao, Xilong Li, Song Tian, Wenbo Deng, Shudan Yue

With the rapid development and widespread adoption of intelligent vehicles and the Internet of Vehicles (IoV), vehicle security has become a growing concern. Modern vehicles manage key components via the controller area network (CAN) connected electronic control units (ECUs). CAN bus intrusion techniques are the primary methods of compromising the IoV, posing a significant threat to the normal operation of critical vehicle systems, such as the power systems. However, existing attack detection methods still have shortcomings in terms of feature extraction and the diversity of attack type detection. To address these challenges, we propose an intrusion detection framework named basic ensemble and pioneer class decision (BEPCD). The framework first constructs a 15-dimensional feature model to hierarchically characterize CAN bus messages. Subsequently, BEPCD incorporates multi-model ensemble learning enhanced by a Pioneer class selector and confidence-driven voting mechanisms, enabling precise classification of both conventional and emerging attack patterns. Additionally, we analyze the importance of different data features across four machine learning algorithms. Experimental results on public datasets demonstrate that the proposed detection framework effectively detects intrusions in-vehicle CAN bus. Compared to other intrusion detection frameworks, our framework improves the overall F1-score by 1% to 5%. Notably, it achieves an approximately 77.5% performance enhancement in detecting replay attacks.

随着智能汽车和车联网(IoV)的快速发展和广泛采用,车辆安全问题日益受到关注。现代车辆通过控制器局域网(CAN)连接电子控制单元(ecu)来管理关键部件。CAN总线入侵技术是危害车联网的主要方法,对车辆关键系统(如电力系统)的正常运行构成重大威胁。然而,现有的攻击检测方法在特征提取和攻击类型检测的多样性等方面仍然存在不足。为了解决这些问题,我们提出了一种名为基本集成和先锋类决策(BEPCD)的入侵检测框架。该框架首先构建了一个15维特征模型,对CAN总线消息进行分层表征。随后,BEPCD结合了由先锋类选择器和信心驱动的投票机制增强的多模型集成学习,从而能够对传统和新兴攻击模式进行精确分类。此外,我们分析了四种机器学习算法中不同数据特征的重要性。在公共数据集上的实验结果表明,该检测框架能够有效地检测到车载CAN总线的入侵。与其他入侵检测框架相比,我们的框架将整体f1得分提高了1%至5%。值得注意的是,它在检测重放攻击方面实现了大约77.5%的性能增强。
{"title":"BEPCD: an ensemble learning-based intrusion detection framework for in-vehicle CAN bus.","authors":"Bocheng Xu, Fei Cao, Xilong Li, Song Tian, Wenbo Deng, Shudan Yue","doi":"10.7717/peerj-cs.3108","DOIUrl":"10.7717/peerj-cs.3108","url":null,"abstract":"<p><p>With the rapid development and widespread adoption of intelligent vehicles and the Internet of Vehicles (IoV), vehicle security has become a growing concern. Modern vehicles manage key components <i>via</i> the controller area network (CAN) connected electronic control units (ECUs). CAN bus intrusion techniques are the primary methods of compromising the IoV, posing a significant threat to the normal operation of critical vehicle systems, such as the power systems. However, existing attack detection methods still have shortcomings in terms of feature extraction and the diversity of attack type detection. To address these challenges, we propose an intrusion detection framework named basic ensemble and pioneer class decision (BEPCD). The framework first constructs a 15-dimensional feature model to hierarchically characterize CAN bus messages. Subsequently, BEPCD incorporates multi-model ensemble learning enhanced by a Pioneer class selector and confidence-driven voting mechanisms, enabling precise classification of both conventional and emerging attack patterns. Additionally, we analyze the importance of different data features across four machine learning algorithms. Experimental results on public datasets demonstrate that the proposed detection framework effectively detects intrusions in-vehicle CAN bus. Compared to other intrusion detection frameworks, our framework improves the overall F1-score by 1% to 5%. Notably, it achieves an approximately 77.5% performance enhancement in detecting replay attacks.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3108"},"PeriodicalIF":2.5,"publicationDate":"2025-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453696/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145132626","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}
引用次数: 0
Palmprint recognition based on principal line features. 基于主线特征的掌纹识别。
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-18 eCollection Date: 2025-01-01 DOI: 10.7717/peerj-cs.3109
Hongxia Wang, Teng Lv

With the increasing prevalence and diversity of imaging devices, palmprint recognition has emerged as a technology that better meets the demands of the modern era. However, traditional manual methods have limitations in effectively extracting palmprint principal line features. To address this, we introduce a novel data augmentation method. First, the wide line extraction (WLE) filter is utilized to specifically target and extract the prominent principal lines of palmprints by leveraging their direction and width characteristics. Then, a Gabor filter is applied to the WLE-extracted results to purify the features and remove fine lines, as fine lines can introduce noise and redundancy that interfere with the accurate extraction of significant principal line features crucial for palmprint recognition. Evaluating this data augmentation across four common Vision Transformer (ViT) classification models, experimental results show that it improves the recognition rates of all databases to varying degrees, with a remarkable 32.9% increase on the high-resolution XINHUA database. With the successful removal of fine lines by WLE, we propose a new Layer Visual Transformer (LViT) design paradigm. For its input, distinct blocking strategies are adopted, carefully designed to partition the data to capture different levels of spatial and feature information, using larger blocks for global structure and smaller ones for local details. The output results of these different blocking strategies are fused by "sum fusion" and "maximum fusion", and the local and global features are effectively utilized by combining complementary information to improve the recognition performance and get state-of-the-art results on multiple databases. Moreover, LViT requires fewer training iterations due to the synergistic effects of the blocking strategies, optimizing the learning process. Finally, by simulating real-world noise conditions, we comprehensively evaluate LViT and find that, compared with traditional methods, our approach exhibits excellent noise-resistant generalization ability, maintaining stable performance across the PolyU II, IIT Delhi, XINHUA, and NTU-CP-V1 databases.

随着成像设备的日益普及和多样化,掌纹识别作为一种更符合现代需求的技术应运而生。然而,传统的人工方法在有效提取掌纹主线特征方面存在一定的局限性。为了解决这个问题,我们引入了一种新的数据增强方法。首先,利用宽线提取(WLE)滤波器,利用掌纹的方向和宽度特征,对掌纹中突出的主线进行针对性提取;然后,将Gabor滤波器应用于wle提取结果以净化特征并去除细纹,因为细纹会引入噪声和冗余,干扰对掌纹识别至关重要的重要主线特征的准确提取。对四种常用视觉变换(Vision Transformer, ViT)分类模型的数据增强效果进行评估,实验结果表明,该方法不同程度地提高了所有数据库的识别率,其中高分辨率的新华数据库的识别率提高了32.9%。随着WLE对细纹的成功去除,我们提出了一种新的层视觉变压器(LViT)设计范式。对于其输入,采用不同的块策略,精心设计数据分区以捕获不同层次的空间和特征信息,使用较大的块用于全局结构,较小的块用于局部细节。采用“和融合”和“最大融合”两种方法对不同块策略的输出结果进行融合,并结合互补信息有效利用局部特征和全局特征,提高识别性能,在多数据库上得到最先进的结果。此外,由于阻塞策略的协同效应,LViT需要更少的训练迭代,优化了学习过程。最后,通过模拟真实噪声条件,我们对LViT进行了综合评估,发现与传统方法相比,我们的方法具有出色的抗噪声泛化能力,在PolyU II, IIT Delhi, XINHUA和NTU-CP-V1数据库中保持稳定的性能。
{"title":"Palmprint recognition based on principal line features.","authors":"Hongxia Wang, Teng Lv","doi":"10.7717/peerj-cs.3109","DOIUrl":"10.7717/peerj-cs.3109","url":null,"abstract":"<p><p>With the increasing prevalence and diversity of imaging devices, palmprint recognition has emerged as a technology that better meets the demands of the modern era. However, traditional manual methods have limitations in effectively extracting palmprint principal line features. To address this, we introduce a novel data augmentation method. First, the wide line extraction (WLE) filter is utilized to specifically target and extract the prominent principal lines of palmprints by leveraging their direction and width characteristics. Then, a Gabor filter is applied to the WLE-extracted results to purify the features and remove fine lines, as fine lines can introduce noise and redundancy that interfere with the accurate extraction of significant principal line features crucial for palmprint recognition. Evaluating this data augmentation across four common Vision Transformer (ViT) classification models, experimental results show that it improves the recognition rates of all databases to varying degrees, with a remarkable 32.9% increase on the high-resolution XINHUA database. With the successful removal of fine lines by WLE, we propose a new Layer Visual Transformer (LViT) design paradigm. For its input, distinct blocking strategies are adopted, carefully designed to partition the data to capture different levels of spatial and feature information, using larger blocks for global structure and smaller ones for local details. The output results of these different blocking strategies are fused by \"sum fusion\" and \"maximum fusion\", and the local and global features are effectively utilized by combining complementary information to improve the recognition performance and get state-of-the-art results on multiple databases. Moreover, LViT requires fewer training iterations due to the synergistic effects of the blocking strategies, optimizing the learning process. Finally, by simulating real-world noise conditions, we comprehensively evaluate LViT and find that, compared with traditional methods, our approach exhibits excellent noise-resistant generalization ability, maintaining stable performance across the PolyU II, IIT Delhi, XINHUA, and NTU-CP-V1 databases.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3109"},"PeriodicalIF":2.5,"publicationDate":"2025-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453761/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145132555","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}
引用次数: 0
A path aggregation network with deformable convolution for visual object detection. 一种用于视觉目标检测的可变形卷积路径聚合网络。
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-18 eCollection Date: 2025-01-01 DOI: 10.7717/peerj-cs.3083
Chengming Rao, Zunhao Hu, QiMing Zhao, Min Shan, Li Mao

One of the main challenges encountered in visual object detection is the multi-scale issue. Many approaches have been proposed to tackle this issue. In this article, we propose a novel neck that can perform effective fusion of multi-scale features for a single-stage object detector. This neck, named the deformable convolution and path aggregation network (DePAN), is an integration of a path aggregation network with a deformable convolution block added to the feature fusion branch to improve the flexibility of feature point sampling. The deformable convolution block is implemented by repeated stacking of a deformable convolution cell. The DePAN neck can be plugged in and easily applied to various models for object detection. We apply the proposed neck to the baseline models of Yolov6-N and YOLOV6-T, and test the improved models on COCO2017 and PASCAL VOC2012 datasets, as well as a medical image dataset. The experimental results verify the effectiveness and applicability in real-world object detection.

在视觉目标检测中遇到的主要挑战之一是多尺度问题。已经提出了许多方法来解决这个问题。在本文中,我们提出了一种新的颈部,它可以有效地融合单级目标检测器的多尺度特征。该颈部称为可变形卷积与路径聚合网络(DePAN),是一种路径聚合网络的集成,在特征融合分支中加入了可变形卷积块,以提高特征点采样的灵活性。可变形卷积块通过可变形卷积单元的重复堆叠实现。DePAN颈部可以插入,很容易应用于各种模型的目标检测。我们将提出的颈部应用于Yolov6-N和YOLOV6-T的基线模型,并在COCO2017和PASCAL VOC2012数据集以及医学图像数据集上对改进的模型进行了测试。实验结果验证了该方法在实际目标检测中的有效性和适用性。
{"title":"A path aggregation network with deformable convolution for visual object detection.","authors":"Chengming Rao, Zunhao Hu, QiMing Zhao, Min Shan, Li Mao","doi":"10.7717/peerj-cs.3083","DOIUrl":"10.7717/peerj-cs.3083","url":null,"abstract":"<p><p>One of the main challenges encountered in visual object detection is the multi-scale issue. Many approaches have been proposed to tackle this issue. In this article, we propose a novel neck that can perform effective fusion of multi-scale features for a single-stage object detector. This neck, named the deformable convolution and path aggregation network (DePAN), is an integration of a path aggregation network with a deformable convolution block added to the feature fusion branch to improve the flexibility of feature point sampling. The deformable convolution block is implemented by repeated stacking of a deformable convolution cell. The DePAN neck can be plugged in and easily applied to various models for object detection. We apply the proposed neck to the baseline models of Yolov6-N and YOLOV6-T, and test the improved models on COCO2017 and PASCAL VOC2012 datasets, as well as a medical image dataset. The experimental results verify the effectiveness and applicability in real-world object detection.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3083"},"PeriodicalIF":2.5,"publicationDate":"2025-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453868/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145131794","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}
引用次数: 0
Leveraging PSO-MLP for intelligent assessment of student learning in remote environments: a multimodal approach. 利用PSO-MLP对远程环境中的学生学习进行智能评估:一种多模式方法。
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-18 eCollection Date: 2025-01-01 DOI: 10.7717/peerj-cs.3121
Jing Wang, Muhammad Asif

The rapid advancement of artificial intelligence (AI) has catalyzed transformative changes in education, particularly in mobile and online learning environments. While existing deep learning models struggle to efficiently integrate the complexity of remote education data and optimize model performance, this article proposes an intelligent evaluation method for students' learning states based on multimodal data. First, the joint characteristics of the pre-class mental status survey information and the health big data of teachers and students in the online teaching process constitute input data. Then, the multilayer perceptron (MLP) is used to intelligently identify the students' status and classify their enthusiasm for the class. Finally, the particle swarm optimization (PSO) model is used to optimize the model and improve the overall recognition rate. Compared to traditional methods, the PSO-MLP model with combined multimodal data performs well, achieving an accuracy of 0.891. It provides an operational, technical solution for the education system, provides a new AI foundation for personalized teaching and student health management by accurately assessing students' learning status, and helps to improve the effectiveness and efficiency of remote education.

人工智能(AI)的快速发展促进了教育领域的变革,特别是在移动和在线学习环境中。针对现有深度学习模型难以有效集成远程教育数据的复杂性和优化模型性能的问题,本文提出了一种基于多模态数据的学生学习状态智能评估方法。首先,课前心理状态调查信息与在线教学过程中师生健康大数据的联合特征构成输入数据。然后,使用多层感知器(MLP)智能识别学生的状态并对其课堂热情进行分类。最后,利用粒子群优化(PSO)模型对模型进行优化,提高整体识别率。与传统方法相比,结合多模态数据的PSO-MLP模型表现良好,准确率达到0.891。它为教育系统提供了可操作的技术解决方案,通过准确评估学生的学习状况,为个性化教学和学生健康管理提供了新的AI基础,有助于提高远程教育的有效性和效率。
{"title":"Leveraging PSO-MLP for intelligent assessment of student learning in remote environments: a multimodal approach.","authors":"Jing Wang, Muhammad Asif","doi":"10.7717/peerj-cs.3121","DOIUrl":"10.7717/peerj-cs.3121","url":null,"abstract":"<p><p>The rapid advancement of artificial intelligence (AI) has catalyzed transformative changes in education, particularly in mobile and online learning environments. While existing deep learning models struggle to efficiently integrate the complexity of remote education data and optimize model performance, this article proposes an intelligent evaluation method for students' learning states based on multimodal data. First, the joint characteristics of the pre-class mental status survey information and the health big data of teachers and students in the online teaching process constitute input data. Then, the multilayer perceptron (MLP) is used to intelligently identify the students' status and classify their enthusiasm for the class. Finally, the particle swarm optimization (PSO) model is used to optimize the model and improve the overall recognition rate. Compared to traditional methods, the PSO-MLP model with combined multimodal data performs well, achieving an accuracy of 0.891. It provides an operational, technical solution for the education system, provides a new AI foundation for personalized teaching and student health management by accurately assessing students' learning status, and helps to improve the effectiveness and efficiency of remote education.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3121"},"PeriodicalIF":2.5,"publicationDate":"2025-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453797/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145132696","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}
引用次数: 0
Optimizing transformer-based prediction of human microbe-disease associations through integrated loss strategies. 通过综合损失策略优化基于变压器的人类微生物疾病关联预测。
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-15 eCollection Date: 2025-01-01 DOI: 10.7717/peerj-cs.3098
Rong Zhu, Yong Wang, Junliang Shang, Ling-Yun Dai, Feng Li

Microorganisms play an important role in many complex diseases, influencing their onset, progression, and potential treatment outcomes. Exploring the associations between microbes and human diseases can deepen our understanding of disease mechanisms and assist in improving diagnosis and therapy. However, traditional biological experiments used to uncover such relationships often demand substantial time and resources. In response to these limitations, computational methods have gained traction as more practical tools for predicting microbe-disease associations. Despite their growing use, many of these models still face challenges in terms of accuracy, stability, and adaptability to noisy or sparse data. To overcome the aforementioned limitations, we propose a novel predictive framework, HyperGraph Neural Network with Transformer for Microbe-Disease Associations (HGNNTMDA), designed to infer potential associations between human microbes and diseases. The framework begins by integrating microbe-disease association data with similarity-based features to construct node representations. Two graph construction strategies are employed: a K-nearest neighbor (KNN)-based adjacency matrix to build a standard graph, and a K-means clustering approach that groups similar nodes into clusters, which serve as hyperedges to define the incidence matrix of a hypergraph. Separate hypergraph neural networks (HGNNs) are then applied to microbe and disease graphs to extract structured node-level features. An attention mechanism (AM) is subsequently introduced to emphasize informative signals, followed by a Transformer module to capture contextual dependencies and enhance global feature representation. A fully connected layer then projects these features into a unified space, where association scores between microbes and diseases are computed. For model optimization, we propose a hybrid loss strategy combining contrastive loss and Huber loss. The contrastive loss aids in learning discriminative embeddings, while the Huber loss enhances robustness against outliers and improves predictive stability. The effectiveness of HGNNTMDA is validated on two benchmark datasets-HMDAD and Disbiome-using five-fold cross-validation (5CV). Our model achieves an AUC of 0.9976 on HMDAD and 0.9423 on Disbiome, outperforming six existing state-of-the-art methods. Further case studies confirm its practical value in discovering novel microbe-disease associations.

微生物在许多复杂疾病中发挥重要作用,影响其发病、进展和潜在的治疗结果。探索微生物与人类疾病之间的联系可以加深我们对疾病机制的理解,并有助于改善诊断和治疗。然而,用于揭示这种关系的传统生物学实验往往需要大量的时间和资源。为了应对这些限制,计算方法作为预测微生物与疾病关联的更实用的工具得到了关注。尽管越来越多地使用这些模型,但其中许多模型在准确性、稳定性和对噪声或稀疏数据的适应性方面仍然面临挑战。为了克服上述局限性,我们提出了一个新的预测框架,HyperGraph Neural Network with Transformer for Microbe-Disease Associations (HGNNTMDA),旨在推断人类微生物和疾病之间的潜在关联。该框架首先将微生物-疾病关联数据与基于相似性的特征集成,以构建节点表示。采用了两种图构建策略:基于k近邻(KNN)的邻接矩阵构建标准图,以及k均值聚类方法,将相似节点分组成簇,作为超边定义超图的关联矩阵。然后将分离的超图神经网络(hgnn)应用于微生物和疾病图以提取结构化的节点级特征。随后引入了一个注意机制(AM)来强调信息信号,然后是一个Transformer模块来捕获上下文依赖性并增强全局特征表示。然后,一个完全连接的层将这些特征投射到一个统一的空间中,在那里计算微生物和疾病之间的关联得分。为了优化模型,我们提出了一种结合对比损失和Huber损失的混合损失策略。对比损失有助于学习判别嵌入,而Huber损失增强了对异常值的鲁棒性并提高了预测稳定性。HGNNTMDA的有效性在两个基准数据集(hmdad和disbiome)上进行了五倍交叉验证(5CV)。我们的模型在HMDAD上的AUC为0.9976,在Disbiome上的AUC为0.9423,优于现有的六种最先进的方法。进一步的案例研究证实了它在发现新的微生物-疾病关联方面的实用价值。
{"title":"Optimizing transformer-based prediction of human microbe-disease associations through integrated loss strategies.","authors":"Rong Zhu, Yong Wang, Junliang Shang, Ling-Yun Dai, Feng Li","doi":"10.7717/peerj-cs.3098","DOIUrl":"10.7717/peerj-cs.3098","url":null,"abstract":"<p><p>Microorganisms play an important role in many complex diseases, influencing their onset, progression, and potential treatment outcomes. Exploring the associations between microbes and human diseases can deepen our understanding of disease mechanisms and assist in improving diagnosis and therapy. However, traditional biological experiments used to uncover such relationships often demand substantial time and resources. In response to these limitations, computational methods have gained traction as more practical tools for predicting microbe-disease associations. Despite their growing use, many of these models still face challenges in terms of accuracy, stability, and adaptability to noisy or sparse data. To overcome the aforementioned limitations, we propose a novel predictive framework, HyperGraph Neural Network with Transformer for Microbe-Disease Associations (HGNNTMDA), designed to infer potential associations between human microbes and diseases. The framework begins by integrating microbe-disease association data with similarity-based features to construct node representations. Two graph construction strategies are employed: a K-nearest neighbor (KNN)-based adjacency matrix to build a standard graph, and a K-means clustering approach that groups similar nodes into clusters, which serve as hyperedges to define the incidence matrix of a hypergraph. Separate hypergraph neural networks (HGNNs) are then applied to microbe and disease graphs to extract structured node-level features. An attention mechanism (AM) is subsequently introduced to emphasize informative signals, followed by a Transformer module to capture contextual dependencies and enhance global feature representation. A fully connected layer then projects these features into a unified space, where association scores between microbes and diseases are computed. For model optimization, we propose a hybrid loss strategy combining contrastive loss and Huber loss. The contrastive loss aids in learning discriminative embeddings, while the Huber loss enhances robustness against outliers and improves predictive stability. The effectiveness of HGNNTMDA is validated on two benchmark datasets-HMDAD and Disbiome-using five-fold cross-validation (5CV). Our model achieves an AUC of 0.9976 on HMDAD and 0.9423 on Disbiome, outperforming six existing state-of-the-art methods. Further case studies confirm its practical value in discovering novel microbe-disease associations.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3098"},"PeriodicalIF":2.5,"publicationDate":"2025-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453706/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145132561","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}
引用次数: 0
Transformer-based tokenization for IoT traffic classification across diverse network environments. 用于跨不同网络环境的物联网流量分类的基于变压器的标记化。
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-15 eCollection Date: 2025-01-01 DOI: 10.7717/peerj-cs.3126
Firdaus Afifi, Faiz Zaki, Hazim Hanif, Nik Aqil, Nor Badrul Anuar

The rapid expansion of the Internet of Things (IoT) has significantly increased the volume and diversity of network traffic, making accurate IoT traffic classification crucial for maintaining network security and efficiency. However, existing traffic classification methods, including traditional machine learning and deep learning approaches, often exhibit critical limitations, such as insufficient generalization across diverse IoT environments, dependency on extensive labelled datasets, and susceptibility to overfitting in dynamic scenarios. While recent transformer-based models show promise in capturing contextual information, they typically rely on standard tokenization, which is ill-suited for the irregular nature of IoT traffic and often remains confined to single-purpose tasks. To address these challenges, this study introduces MIND-IoT, a novel and scalable framework for classifying generalized IoT traffic. MIND-IoT employs a hybrid architecture that combines Transformer-based models for capturing long-range dependencies and convolutional neural networks (CNNs) for efficient local feature extraction. A key innovation is IoT-Tokenize, a custom tokenization pipeline designed to preserve the structural semantics of network flows by converting statistical traffic features into semantically meaningful feature-value pairs. The framework operates in two phases: a pre-training phase utilizing masked language modeling (MLM) on large-scale IoT data (UNSW IoT Traces and MonIoTr) to learn robust representations and a fine-tuning phase that adapts the model to specific classification tasks, including binary IoT vs. non-IoT classification, IoT category classification, and device identification. Comprehensive evaluation across multiple diverse datasets (IoT Sentinel, YourThings, and IoT-FCSIT, in addition to the pre-training datasets) demonstrates MIND-IoT's superior performance, robustness, and adaptability compared to traditional methods. The model achieves an accuracy of up to 98.14% and a 97.85% F1-score, demonstrating its ability to classify new datasets and adapt to emerging tasks with minimal fine-tuning and remarkable efficiency. This research positions MIND-IoT as a highly effective and scalable solution for real-world IoT traffic classification challenges.

物联网(IoT)的快速发展极大地增加了网络流量的数量和多样性,准确的物联网流量分类对于维护网络安全和效率至关重要。然而,现有的流量分类方法,包括传统的机器学习和深度学习方法,往往表现出严重的局限性,例如在不同的物联网环境中泛化不足,依赖于广泛的标记数据集,以及在动态场景中容易过度拟合。虽然最近基于变压器的模型在捕获上下文信息方面显示出希望,但它们通常依赖于标准的标记化,这不适合物联网流量的不规则性质,并且通常仍然局限于单一用途的任务。为了应对这些挑战,本研究引入了MIND-IoT,这是一种用于分类广义物联网流量的新型可扩展框架。MIND-IoT采用混合架构,结合了基于transformer的模型来捕获远程依赖关系和卷积神经网络(cnn)来高效地提取局部特征。一个关键的创新是IoT-Tokenize,这是一个定制的标记化管道,旨在通过将统计流量特征转换为语义上有意义的特征值对来保留网络流的结构语义。该框架分为两个阶段:一个是利用大规模物联网数据(UNSW IoT Traces和MonIoTr)上的掩码语言建模(MLM)的预训练阶段,以学习鲁棒表示;另一个是微调阶段,使模型适应特定的分类任务,包括二进制物联网与非物联网分类、物联网类别分类和设备识别。对多个不同数据集(IoT Sentinel、YourThings和IoT- fcsit,以及预训练数据集)的综合评估表明,与传统方法相比,MIND-IoT具有卓越的性能、鲁棒性和适应性。该模型的准确率高达98.14%,f1得分为97.85%,表明其能够以最小的微调和显著的效率对新数据集进行分类并适应新出现的任务。这项研究将MIND-IoT定位为解决现实世界物联网流量分类挑战的高效可扩展解决方案。
{"title":"Transformer-based tokenization for IoT traffic classification across diverse network environments.","authors":"Firdaus Afifi, Faiz Zaki, Hazim Hanif, Nik Aqil, Nor Badrul Anuar","doi":"10.7717/peerj-cs.3126","DOIUrl":"10.7717/peerj-cs.3126","url":null,"abstract":"<p><p>The rapid expansion of the Internet of Things (IoT) has significantly increased the volume and diversity of network traffic, making accurate IoT traffic classification crucial for maintaining network security and efficiency. However, existing traffic classification methods, including traditional machine learning and deep learning approaches, often exhibit critical limitations, such as insufficient generalization across diverse IoT environments, dependency on extensive labelled datasets, and susceptibility to overfitting in dynamic scenarios. While recent transformer-based models show promise in capturing contextual information, they typically rely on standard tokenization, which is ill-suited for the irregular nature of IoT traffic and often remains confined to single-purpose tasks. To address these challenges, this study introduces MIND-IoT, a novel and scalable framework for classifying generalized IoT traffic. MIND-IoT employs a hybrid architecture that combines Transformer-based models for capturing long-range dependencies and convolutional neural networks (CNNs) for efficient local feature extraction. A key innovation is IoT-Tokenize, a custom tokenization pipeline designed to preserve the structural semantics of network flows by converting statistical traffic features into semantically meaningful feature-value pairs. The framework operates in two phases: a pre-training phase utilizing masked language modeling (MLM) on large-scale IoT data (UNSW IoT Traces and MonIoTr) to learn robust representations and a fine-tuning phase that adapts the model to specific classification tasks, including binary IoT <i>vs</i>. non-IoT classification, IoT category classification, and device identification. Comprehensive evaluation across multiple diverse datasets (IoT Sentinel, YourThings, and IoT-FCSIT, in addition to the pre-training datasets) demonstrates MIND-IoT's superior performance, robustness, and adaptability compared to traditional methods. The model achieves an accuracy of up to 98.14% and a 97.85% F1-score, demonstrating its ability to classify new datasets and adapt to emerging tasks with minimal fine-tuning and remarkable efficiency. This research positions MIND-IoT as a highly effective and scalable solution for real-world IoT traffic classification challenges.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3126"},"PeriodicalIF":2.5,"publicationDate":"2025-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453836/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145132725","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}
引用次数: 0
Improving machine learning detection of Alzheimer disease using enhanced manta ray gene selection of Alzheimer gene expression datasets. 利用增强的蝠鲼基因选择阿尔茨海默病基因表达数据集改进机器学习检测阿尔茨海默病。
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-14 eCollection Date: 2025-01-01 DOI: 10.7717/peerj-cs.3064
Zahraa Ahmed, Mesut Çevik

One of the most prominent neurodegenerative diseases globally is Alzheimer's disease (AD). The early diagnosis of AD is a challenging task due to complex pathophysiology caused by the presence and accumulation of neurofibrillary tangles and amyloid plaques. However, the late enriched understanding of the genetic underpinnings of AD has been made possible due to recent advancements in data mining analysis methods, machine learning, and microarray technologies. However, the "curse of dimensionality" caused by the high-dimensional microarray datasets impacts the accurate prediction of the disease due to issues of overfitting, bias, and high computational demands. To alleviate such an effect, this study proposes a gene selection approach based on the parameter-free and large-scale manta ray foraging optimization algorithm. Given the dimensional disparities and statistical relationship distributions of the six investigated datasets, in addition to four evaluated machine learning classifiers; the proposed Sign Random Mutation and Best Rank enhancements that substantially improved MRFO's exploration and exploitation contributed to efficient identification of relevant genes and to machine learning improved prediction accuracy.

阿尔茨海默病(AD)是全球最突出的神经退行性疾病之一。由于神经原纤维缠结和淀粉样斑块的存在和积累导致复杂的病理生理,因此早期诊断AD是一项具有挑战性的任务。然而,由于数据挖掘分析方法、机器学习和微阵列技术的最新进展,最近对AD遗传基础的丰富理解已经成为可能。然而,由于过度拟合、偏差和高计算需求等问题,高维微阵列数据集造成的“维度诅咒”影响了疾病的准确预测。为了缓解这种影响,本研究提出了一种基于无参数大规模蝠鲼觅食优化算法的基因选择方法。考虑到六个研究数据集的维度差异和统计关系分布,除了四个评估的机器学习分类器;所提出的符号随机突变和最佳秩增强大大提高了MRFO的探索和利用,有助于有效识别相关基因,并提高机器学习的预测精度。
{"title":"Improving machine learning detection of Alzheimer disease using enhanced manta ray gene selection of Alzheimer gene expression datasets.","authors":"Zahraa Ahmed, Mesut Çevik","doi":"10.7717/peerj-cs.3064","DOIUrl":"10.7717/peerj-cs.3064","url":null,"abstract":"<p><p>One of the most prominent neurodegenerative diseases globally is Alzheimer's disease (AD). The early diagnosis of AD is a challenging task due to complex pathophysiology caused by the presence and accumulation of neurofibrillary tangles and amyloid plaques. However, the late enriched understanding of the genetic underpinnings of AD has been made possible due to recent advancements in data mining analysis methods, machine learning, and microarray technologies. However, the \"curse of dimensionality\" caused by the high-dimensional microarray datasets impacts the accurate prediction of the disease due to issues of overfitting, bias, and high computational demands. To alleviate such an effect, this study proposes a gene selection approach based on the parameter-free and large-scale manta ray foraging optimization algorithm. Given the dimensional disparities and statistical relationship distributions of the six investigated datasets, in addition to four evaluated machine learning classifiers; the proposed Sign Random Mutation and Best Rank enhancements that substantially improved MRFO's exploration and exploitation contributed to efficient identification of relevant genes and to machine learning improved prediction accuracy.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3064"},"PeriodicalIF":2.5,"publicationDate":"2025-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453835/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145132749","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}
引用次数: 0
Multi-step partitioning combined with SOM neural network-based clustering technique effectively improves SAT solver performance. 多步划分与基于SOM神经网络的聚类技术相结合,有效地提高了求解器的性能。
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-14 eCollection Date: 2025-01-01 DOI: 10.7717/peerj-cs.3076
Siyu Yun, Xinsheng Wang

As the core engine of electronic design automation (EDA) tools, the efficiency of Boolean Satisfiability Problem (SAT) solver largely determines the cycle of integrated circuit research and development. The effectiveness of SAT solvers has steadily turned into the key bottleneck of circuit design cycle due to the dramatically increased integrated circuit scale. The primary issue of SAT solver now is the divergence between SAT used in industry and research on pure solution algorithms. We propose a strategy for partitioning the SAT problem based on the structural information then solving it. By effectively extracting the structure information from the original SAT problem, the self-organizing map (SOM) neural network deployed in the division section can speed up the sub-thread solver's processing while avoiding cumbersome parameter adjustments. The experimental results demonstrate the stability and scalability of our technique, which can drastically shorten the time required to solve industrial benchmarks from various sources.

作为电子设计自动化(EDA)工具的核心引擎,布尔可满足性问题(SAT)求解器的效率在很大程度上决定了集成电路研发的周期。随着集成电路规模的急剧增加,SAT求解器的有效性逐渐成为电路设计周期的关键瓶颈。目前,SAT求解器的主要问题是工业应用的SAT与纯求解算法研究之间的分歧。我们提出了一种基于结构信息对SAT问题进行划分并求解的策略。通过有效地从原始SAT问题中提取结构信息,自组织映射(SOM)神经网络部署在分割部分,可以加快子线程求解器的处理速度,同时避免繁琐的参数调整。实验结果证明了我们的技术的稳定性和可扩展性,可以大大缩短解决各种来源的工业基准所需的时间。
{"title":"Multi-step partitioning combined with SOM neural network-based clustering technique effectively improves SAT solver performance.","authors":"Siyu Yun, Xinsheng Wang","doi":"10.7717/peerj-cs.3076","DOIUrl":"https://doi.org/10.7717/peerj-cs.3076","url":null,"abstract":"<p><p>As the core engine of electronic design automation (EDA) tools, the efficiency of Boolean Satisfiability Problem (SAT) solver largely determines the cycle of integrated circuit research and development. The effectiveness of SAT solvers has steadily turned into the key bottleneck of circuit design cycle due to the dramatically increased integrated circuit scale. The primary issue of SAT solver now is the divergence between SAT used in industry and research on pure solution algorithms. We propose a strategy for partitioning the SAT problem based on the structural information then solving it. By effectively extracting the structure information from the original SAT problem, the self-organizing map (SOM) neural network deployed in the division section can speed up the sub-thread solver's processing while avoiding cumbersome parameter adjustments. The experimental results demonstrate the stability and scalability of our technique, which can drastically shorten the time required to solve industrial benchmarks from various sources.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3076"},"PeriodicalIF":2.5,"publicationDate":"2025-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453816/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145132679","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}
引用次数: 0
A literature survey of shapelet quality measures for time series classification. 用于时间序列分类的小块质量测度的文献综述。
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-14 eCollection Date: 2025-01-01 DOI: 10.7717/peerj-cs.3115
Teng Li, Xiaodong Guo, Cun Ji

With the rapid development of the Internet of Things, time series classification (TSC) has gained significant attention from researchers due to its applications in various real-world fields, including electroencephalogram/electrocardiogram classification, emotion recognition, and error message detection. To improve classification performance, numerous TSC methods have been proposed in recent years. Among these, shapelet-based TSC methods are particularly notable for their intuitive interpretability. A critical task within these methods is evaluating the quality of candidate shapelets. This paper provides a comprehensive survey of the state-of-the-art measures for assessing shapelet quality. To present a structured overview, we begin by proposing a taxonomy of these measures, followed by a detailed description of each one. We then discuss these measures, highlighting the challenges faced by current research and offering suggestions for future directions. Finally, we summarize the findings of this survey. We hope that this work will serve as a valuable resource for researchers in the field.

随着物联网的快速发展,时间序列分类(TSC)因其在现实世界的广泛应用而受到研究人员的广泛关注,包括脑电图/心电图分类、情绪识别、错误信息检测等。为了提高分类性能,近年来提出了许多TSC方法。其中,基于形状的TSC方法尤其值得注意的是其直观的可解释性。这些方法中的一个关键任务是评估候选shapelets的质量。本文提供了一个全面的调查,最先进的措施,以评估形状质量。为了提供一个结构化的概述,我们首先提出这些措施的分类,然后对每个措施进行详细描述。然后讨论这些措施,突出当前研究面临的挑战,并为未来的发展方向提出建议。最后,对调查结果进行了总结。我们希望这项工作将成为该领域研究人员的宝贵资源。
{"title":"A literature survey of shapelet quality measures for time series classification.","authors":"Teng Li, Xiaodong Guo, Cun Ji","doi":"10.7717/peerj-cs.3115","DOIUrl":"10.7717/peerj-cs.3115","url":null,"abstract":"<p><p>With the rapid development of the Internet of Things, time series classification (TSC) has gained significant attention from researchers due to its applications in various real-world fields, including electroencephalogram/electrocardiogram classification, emotion recognition, and error message detection. To improve classification performance, numerous TSC methods have been proposed in recent years. Among these, shapelet-based TSC methods are particularly notable for their intuitive interpretability. A critical task within these methods is evaluating the quality of candidate shapelets. This paper provides a comprehensive survey of the state-of-the-art measures for assessing shapelet quality. To present a structured overview, we begin by proposing a taxonomy of these measures, followed by a detailed description of each one. We then discuss these measures, highlighting the challenges faced by current research and offering suggestions for future directions. Finally, we summarize the findings of this survey. We hope that this work will serve as a valuable resource for researchers in the field.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3115"},"PeriodicalIF":2.5,"publicationDate":"2025-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453792/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145132639","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}
引用次数: 0
Comparing variable neighbourhood search algorithms for the direct aperture optimisation in radiotherapy. 比较放射治疗中直接孔径优化的可变邻域搜索算法。
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-14 eCollection Date: 2025-01-01 DOI: 10.7717/peerj-cs.3094
Mauricio Moyano, Keiny Meza-Vasquez, Gonzalo Tello-Valenzuela, Nicolle Ojeda-Ortega, Carolina Lagos, Guillermo Cabrera-Guerrero

Intensity modulated radiation therapy (IMRT) is a prevalent approach for administering radiation therapy in cancer treatment. The primary objective of IMRT is to devise a treatment strategy that eradicates cancer cells from the tumour while minimising damage to the surrounding organs at risk. Conventional IMRT planning entails a sequential procedure: optimising beam intensity for a certain set of angles, followed by sequencing. Unfortunately, treatment plans obtained in the optimisation stage are severely impaired after the sequencing stage due to physical and delivery constraints that are not considered during the optimisation stage. One method that tackles the issues above is the direct aperture optimisation (DAO) technique. The DAO problem seeks to generate a set of deliverable aperture configurations and a corresponding set of radiation intensities. This method accounts for physical and delivery time limitations, facilitating the creation of clinically appropriate treatment programs. In this article, we propose and compare two variable neighbourhood search (VNS) based algorithms, called variable neighbourhood descent (VND) and reduced variable neighbourhood search (rVNS). The VND algorithm is a deterministic variant of VNS that systematically explores different neighbourhood structures. This approach allows for a more thorough solution for space exploration while maintaining computational efficiency. The rVNS, unlike traditional VNS algorithms, does not require any transition rule, as it integrates a set of predefined neighbourhood moves at each iteration. We apply our proposed algorithms to prostate cancer cases, achieving highly competitive results for both algorithms. In particular, the proposed rVNS requires 62.75% fewer apertures and achieved a 63.93% reduction in beam-on time compared to the sequential approach's best case, which means treatment plans that can be delivered in less time. Additionally, we evaluate the clinical quality of the treatment plans using established dosimetric indicators, comparing our results against those produced by matRad's tool for DAO to assess target coverage and organ-at-risk sparing.

调强放射治疗(IMRT)是癌症治疗中常用的放射治疗方法。IMRT的主要目标是设计一种治疗策略,从肿瘤中根除癌细胞,同时最大限度地减少对周围器官的损害。传统的IMRT计划需要一个连续的过程:优化光束强度为一定的角度,然后排序。不幸的是,在优化阶段获得的治疗计划在测序阶段后严重受损,因为在优化阶段没有考虑物理和交付限制。解决上述问题的一种方法是直接孔径优化(DAO)技术。DAO问题旨在生成一组可交付的孔径配置和相应的辐射强度。这种方法考虑到物理和交付时间的限制,促进了临床适当治疗方案的创建。在本文中,我们提出并比较了两种基于可变邻域搜索(VNS)的算法,即可变邻域下降(VND)和简化可变邻域搜索(rVNS)。VND算法是VNS的一种确定性变体,系统地探索不同的邻域结构。这种方法可以在保持计算效率的同时为空间探索提供更彻底的解决方案。与传统的VNS算法不同,rVNS不需要任何过渡规则,因为它在每次迭代时集成了一组预定义的邻域移动。我们将我们提出的算法应用于前列腺癌病例,两种算法都取得了高度竞争的结果。特别是,与顺序方法相比,rVNS所需的孔径减少了62.75%,光束照射时间减少了63.93%,这意味着治疗计划可以在更短的时间内完成。此外,我们使用已建立的剂量学指标评估治疗计划的临床质量,并将我们的结果与matRad的DAO工具产生的结果进行比较,以评估目标覆盖率和器官风险保留。
{"title":"Comparing variable neighbourhood search algorithms for the direct aperture optimisation in radiotherapy.","authors":"Mauricio Moyano, Keiny Meza-Vasquez, Gonzalo Tello-Valenzuela, Nicolle Ojeda-Ortega, Carolina Lagos, Guillermo Cabrera-Guerrero","doi":"10.7717/peerj-cs.3094","DOIUrl":"10.7717/peerj-cs.3094","url":null,"abstract":"<p><p>Intensity modulated radiation therapy (IMRT) is a prevalent approach for administering radiation therapy in cancer treatment. The primary objective of IMRT is to devise a treatment strategy that eradicates cancer cells from the tumour while minimising damage to the surrounding organs at risk. Conventional IMRT planning entails a sequential procedure: optimising beam intensity for a certain set of angles, followed by sequencing. Unfortunately, treatment plans obtained in the optimisation stage are severely impaired after the sequencing stage due to physical and delivery constraints that are not considered during the optimisation stage. One method that tackles the issues above is the direct aperture optimisation (DAO) technique. The DAO problem seeks to generate a set of deliverable aperture configurations and a corresponding set of radiation intensities. This method accounts for physical and delivery time limitations, facilitating the creation of clinically appropriate treatment programs. In this article, we propose and compare two variable neighbourhood search (VNS) based algorithms, called variable neighbourhood descent (VND) and reduced variable neighbourhood search (rVNS). The VND algorithm is a deterministic variant of VNS that systematically explores different neighbourhood structures. This approach allows for a more thorough solution for space exploration while maintaining computational efficiency. The rVNS, unlike traditional VNS algorithms, does not require any transition rule, as it integrates a set of predefined neighbourhood moves at each iteration. We apply our proposed algorithms to prostate cancer cases, achieving highly competitive results for both algorithms. In particular, the proposed rVNS requires 62.75% fewer apertures and achieved a 63.93% reduction in beam-on time compared to the sequential approach's best case, which means treatment plans that can be delivered in less time. Additionally, we evaluate the clinical quality of the treatment plans using established dosimetric indicators, comparing our results against those produced by matRad's tool for DAO to assess target coverage and organ-at-risk sparing.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3094"},"PeriodicalIF":2.5,"publicationDate":"2025-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12453873/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145132379","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}
引用次数: 0
期刊
PeerJ Computer Science
全部 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