首页 > 最新文献

Expert Systems最新文献

英文 中文
DSGNet: A Lightweight Network Integrating Depthwise Separable and Ghost Convolutions for Real-Time Surface Defect Segmentation DSGNet:一种融合深度可分卷积和幽灵卷积的轻量级表面缺陷实时分割网络
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-04 DOI: 10.1111/exsy.70187
Hu Lu, Yanyan Zhao, Guo Yang, Shengli Wu

In industrial product manufacturing, the automated detection and localisation of surface defects are of significant importance for ensuring quality control. However, existing computer vision-based defect detection methods struggle to achieve both lightweight design and high accuracy on resource-constrained embedded platforms, which limits their application in practical industrial detection environments. To address this issue, we propose DSGNet, a lightweight surface defect segmentation model, which serves as a core defect detection and localisation method for industrial inspection systems. The proposed model adopts an asymmetric encoder-decoder structure to simplify the overall architecture. We designed an efficient feature extraction network by using four lightweight feature extraction units based on efficient convolutions. Furthermore, we introduce a hierarchical adaptive upsampling fusion (HAFU) mechanism and a lightweight bidirectional multiscale strip attention (LBMSA) feature refinement module to effectively fuse and refine the multilevel features extracted from the encoder. We conducted comprehensive evaluations of DSGNet on three typical surface defect datasets: Neu-Seg, MSD and MT. While maintaining an extremely low complexity with only 0.49 M parameters, DSGNet achieved impressive mIoU scores of 83.39%, 91.61% and 80.72% on three datasets, respectively. These results indicate that DSGNet is a promising solution that balances lightweight design and detection accuracy for industrial real-time detection systems, demonstrating strong potential for practical deployment. Our code is available at https://github.com/young-zyy/DSGNet.

在工业产品制造中,表面缺陷的自动检测和定位对于保证质量控制具有重要意义。然而,现有的基于计算机视觉的缺陷检测方法难以在资源受限的嵌入式平台上实现轻量化设计和高精度,这限制了它们在实际工业检测环境中的应用。为了解决这个问题,我们提出了DSGNet,一种轻量级的表面缺陷分割模型,作为工业检测系统的核心缺陷检测和定位方法。该模型采用非对称编码器-解码器结构,简化了整体结构。采用基于高效卷积的四个轻量级特征提取单元,设计了一个高效的特征提取网络。此外,我们引入了层次自适应上采样融合(HAFU)机制和轻量级双向多尺度条带注意(LBMSA)特征细化模块,以有效地融合和细化从编码器中提取的多级别特征。我们在new - seg、MSD和MT三个典型表面缺陷数据集上对DSGNet进行了综合评价,DSGNet在保持极低复杂度的同时,仅使用0.49个参数,在三个数据集上分别取得了83.39%、91.61%和80.72%的mIoU分数。这些结果表明,DSGNet是一种很有前途的解决方案,可以平衡工业实时检测系统的轻量化设计和检测精度,显示出实际部署的强大潜力。我们的代码可在https://github.com/young-zyy/DSGNet上获得。
{"title":"DSGNet: A Lightweight Network Integrating Depthwise Separable and Ghost Convolutions for Real-Time Surface Defect Segmentation","authors":"Hu Lu,&nbsp;Yanyan Zhao,&nbsp;Guo Yang,&nbsp;Shengli Wu","doi":"10.1111/exsy.70187","DOIUrl":"https://doi.org/10.1111/exsy.70187","url":null,"abstract":"<div>\u0000 \u0000 <p>In industrial product manufacturing, the automated detection and localisation of surface defects are of significant importance for ensuring quality control. However, existing computer vision-based defect detection methods struggle to achieve both lightweight design and high accuracy on resource-constrained embedded platforms, which limits their application in practical industrial detection environments. To address this issue, we propose DSGNet, a lightweight surface defect segmentation model, which serves as a core defect detection and localisation method for industrial inspection systems. The proposed model adopts an asymmetric encoder-decoder structure to simplify the overall architecture. We designed an efficient feature extraction network by using four lightweight feature extraction units based on efficient convolutions. Furthermore, we introduce a hierarchical adaptive upsampling fusion (HAFU) mechanism and a lightweight bidirectional multiscale strip attention (LBMSA) feature refinement module to effectively fuse and refine the multilevel features extracted from the encoder. We conducted comprehensive evaluations of DSGNet on three typical surface defect datasets: Neu-Seg, MSD and MT. While maintaining an extremely low complexity with only 0.49 M parameters, DSGNet achieved impressive mIoU scores of 83.39%, 91.61% and 80.72% on three datasets, respectively. These results indicate that DSGNet is a promising solution that balances lightweight design and detection accuracy for industrial real-time detection systems, demonstrating strong potential for practical deployment. Our code is available at https://github.com/young-zyy/DSGNet.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 2","pages":""},"PeriodicalIF":2.3,"publicationDate":"2026-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Hierarchical-Split Multi-Scale Convolution Network With Multi-Task Learning for Human Activity Recognition in Wearable Devices 基于多任务学习的分层分裂多尺度卷积网络可穿戴设备人体活动识别
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-04 DOI: 10.1111/exsy.70190
Pengwei Zhang, Xiaoqing Shao, Yuxuan Zhao, Fengda Zhao

Human Activity Recognition (HAR) using built-in sensors in wearable devices offers valuable insights for continuous behaviour monitoring and health assessment. However, existing HAR approaches face several key challenges: (1) limited capacity to capture multi-scale temporal dependencies; (2) difficulty in recognising low-motion or static activities when relying solely on inertial sensors such as 3D accelerometers (3D-ACC); and (3) insufficient utilisation of auxiliary physiological signals in conventional single-task learning frameworks. To address these limitations, we propose a Hierarchical-Split Multi-Scale Convolutional Network with Multi-Task Learning for wearable HAR. The proposed model integrates a hierarchical-split convolutional block to efficiently extract both local and global temporal features. It further employs a channel-wise attention mechanism to adaptively fuse photoplethysmography (PPG) and 3D-ACC signals, enabling the model to capture complementary physiological dynamics and improve the recognition of subtle or low-motion activities. In addition, we introduce a multi-task learning framework with an auxiliary heart rate estimation task, which enhances physiological representation learning without requiring additional annotations, thereby improving model robustness and generalisability. Extensive experiments on two public HAR datasets demonstrate that our method consistently outperforms existing approaches under both overall and cross-subject evaluation protocols, highlighting its effectiveness in realistic, user-independent settings.

在可穿戴设备中使用内置传感器的人类活动识别(HAR)为持续的行为监测和健康评估提供了有价值的见解。然而,现有的HAR方法面临几个关键挑战:(1)捕获多尺度时间依赖性的能力有限;(2)仅依靠惯性传感器(如3D加速度计(3D- acc))识别低运动或静态活动的困难;(3)传统的单任务学习框架对辅助生理信号的利用不足。为了解决这些限制,我们提出了一种具有多任务学习功能的可穿戴HAR分层分裂多尺度卷积网络。该模型集成了一个分层分割的卷积块,可以有效地提取局部和全局时间特征。它还采用了一种通道注意机制来自适应融合光体积脉搏波(PPG)和3D-ACC信号,使该模型能够捕捉互补的生理动力学,并提高对细微或低运动活动的识别。此外,我们引入了一个带有辅助心率估计任务的多任务学习框架,该框架在不需要额外注释的情况下增强了生理表征学习,从而提高了模型的鲁棒性和通用性。在两个公共HAR数据集上进行的大量实验表明,我们的方法在整体和跨学科评估协议下始终优于现有方法,突出了其在现实的、独立于用户的设置中的有效性。
{"title":"Hierarchical-Split Multi-Scale Convolution Network With Multi-Task Learning for Human Activity Recognition in Wearable Devices","authors":"Pengwei Zhang,&nbsp;Xiaoqing Shao,&nbsp;Yuxuan Zhao,&nbsp;Fengda Zhao","doi":"10.1111/exsy.70190","DOIUrl":"https://doi.org/10.1111/exsy.70190","url":null,"abstract":"<div>\u0000 \u0000 <p>Human Activity Recognition (HAR) using built-in sensors in wearable devices offers valuable insights for continuous behaviour monitoring and health assessment. However, existing HAR approaches face several key challenges: (1) limited capacity to capture multi-scale temporal dependencies; (2) difficulty in recognising low-motion or static activities when relying solely on inertial sensors such as 3D accelerometers (3D-ACC); and (3) insufficient utilisation of auxiliary physiological signals in conventional single-task learning frameworks. To address these limitations, we propose a Hierarchical-Split Multi-Scale Convolutional Network with Multi-Task Learning for wearable HAR. The proposed model integrates a hierarchical-split convolutional block to efficiently extract both local and global temporal features. It further employs a channel-wise attention mechanism to adaptively fuse photoplethysmography (PPG) and 3D-ACC signals, enabling the model to capture complementary physiological dynamics and improve the recognition of subtle or low-motion activities. In addition, we introduce a multi-task learning framework with an auxiliary heart rate estimation task, which enhances physiological representation learning without requiring additional annotations, thereby improving model robustness and generalisability. Extensive experiments on two public HAR datasets demonstrate that our method consistently outperforms existing approaches under both overall and cross-subject evaluation protocols, highlighting its effectiveness in realistic, user-independent settings.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 2","pages":""},"PeriodicalIF":2.3,"publicationDate":"2026-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145958137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Federated Multi-Source Data Fusion for Semi-Supervised Fault Detection in District Heating Substations 联合多源数据融合用于区域供热站半监督故障检测
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-01 DOI: 10.1111/exsy.70194
Jonne van Dreven, Sadi Alawadi, Abbas Cheddad, Ahmad Nauman Ghazi, Jad Al Koussa, Dirk Vanhoudt

Fault detection in district heating (DH) substations is critical for energy efficiency and reliability. However, it is challenged by scarce fault labels, low-frequency data, privacy concerns, and battery-constrained gateways. We propose a novel hybrid semi-supervised federated domain adaptation architecture for fault detection in DH. We use a one-class variational autoencoder (VAE) to leverage heterogeneous sensor streams from 434 distributed substations. First, we perform cross-network unsupervised pre-training on multi-sourced data from two independent real-world DH networks, fusing their return temperature dynamics into a robust shared manifold. Second, we leverage maintenance metadata to selectively allow verified-normal clients for per-round fine-tuning of the model. Third, we drastically reduce uplink costs by compressing each client's weight delta using 10% top-k sparsification and demonstrate that our pipeline enables robust few-shot finetuning with 20% of the normal operational data while retaining high detection performance. By strategically training, our method achieves F1 and G-mean scores of up to 97% and an AUC ≥ 99% on real-world DH data. To our knowledge, this is the first work to study cross-domain data fusion in the DH field for fault detection, aiming to enhance and enable effective, scalable, and energy-efficient monitoring of substations.

区域供热(DH)变电站的故障检测对提高能源效率和可靠性至关重要。然而,它受到缺乏故障标签、低频数据、隐私问题和电池限制网关的挑战。我们提出了一种新的混合半监督联邦域自适应结构用于DH故障检测。我们使用一类变分自编码器(VAE)来利用来自434个分布式变电站的异构传感器流。首先,我们对来自两个独立现实世界DH网络的多源数据进行跨网络无监督预训练,将它们的返回温度动态融合到一个鲁棒共享流形中。其次,我们利用维护元数据有选择地允许经过验证的正常客户端对模型进行每轮微调。第三,通过使用10%的top-k稀疏化压缩每个客户端的权重增量,我们大大降低了上行成本,并证明我们的管道可以在保持高检测性能的同时,使用20%的正常操作数据进行稳健的少量微调。通过策略训练,我们的方法在真实DH数据上实现了高达97%的F1和G-mean得分和≥99%的AUC。据我们所知,这是第一个研究DH领域故障检测的跨域数据融合的工作,旨在增强和实现对变电站的有效、可扩展和节能监测。
{"title":"Federated Multi-Source Data Fusion for Semi-Supervised Fault Detection in District Heating Substations","authors":"Jonne van Dreven,&nbsp;Sadi Alawadi,&nbsp;Abbas Cheddad,&nbsp;Ahmad Nauman Ghazi,&nbsp;Jad Al Koussa,&nbsp;Dirk Vanhoudt","doi":"10.1111/exsy.70194","DOIUrl":"https://doi.org/10.1111/exsy.70194","url":null,"abstract":"<p>Fault detection in district heating (DH) substations is critical for energy efficiency and reliability. However, it is challenged by scarce fault labels, low-frequency data, privacy concerns, and battery-constrained gateways. We propose a novel hybrid semi-supervised federated domain adaptation architecture for fault detection in DH. We use a one-class variational autoencoder (VAE) to leverage heterogeneous sensor streams from 434 distributed substations. First, we perform cross-network unsupervised pre-training on multi-sourced data from two independent real-world DH networks, fusing their return temperature dynamics into a robust shared manifold. Second, we leverage maintenance metadata to selectively allow verified-normal clients for per-round fine-tuning of the model. Third, we drastically reduce uplink costs by compressing each client's weight delta using 10% top-<i>k</i> sparsification and demonstrate that our pipeline enables robust few-shot finetuning with 20% of the normal operational data while retaining high detection performance. By strategically training, our method achieves F<sub>1</sub> and G-mean scores of up to 97% and an AUC ≥ 99% on real-world DH data. To our knowledge, this is the first work to study cross-domain data fusion in the DH field for fault detection, aiming to enhance and enable effective, scalable, and energy-efficient monitoring of substations.</p>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 2","pages":""},"PeriodicalIF":2.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/exsy.70194","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145891518","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
Adapter-Regularised Continual Learning for Dynamic Financial Sentiment Encoding in Multi-Modal Market Fusion 多模态市场融合中动态金融情绪编码的适应性正则化持续学习
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-12-14 DOI: 10.1111/exsy.70178
Zihe Song, Renke Huang, Aiqi Li, Aoran Shen, Heng Chen

We propose an adapter-regularised continual learning framework for dynamic financial sentiment encoding, addressing the dual challenge of retaining long-term domain knowledge while adapting to transient market sentiment patterns. The proposed method augments a pre-trained RoBERTa model with lightweight adapter modules and elastic knowledge consolidation, enabling parameter-efficient updates without catastrophic forgetting. Each transformer layer incorporates parallel adapters with gating mechanisms, selectively blending original and adapted features to maintain stability during incremental training. Moreover, the framework dynamically distills emerging sentiment lexicon terms into the encoder through an auxiliary distillation loss, ensuring sensitivity to evolving financial language. The resulting sentiment embeddings are fused with market data via cross-modal attention, where adapter gating outputs further modulate the contribution of textual features. Realised with a RoBERTa-large backbone and online Fisher matrix approximation, our approach demonstrates compatibility with high-frequency trading scenarios while outperforming static domain-adapted models. The key innovation lies in the tight integration of adapter-based continual learning with financial lexicon dynamics and modality-specific gating, a combination not explored in prior work. Experimental validation across multi-modal market datasets confirms the model's ability to simultaneously preserve financial domain knowledge and capture temporal sentiment shifts, outperforming both generic continual learning methods and specialised financial encoders. This advancement bridges the gap between stable representation learning and real-time market adaptation, offering a principled solution for dynamic sentiment analysis in algorithmic trading systems.

我们提出了一个用于动态金融情绪编码的适配器正则化持续学习框架,解决了在适应瞬时市场情绪模式的同时保留长期领域知识的双重挑战。该方法通过轻量级适配器模块和弹性知识整合增强了预训练的RoBERTa模型,实现了参数高效更新,而不会出现灾难性遗忘。每个变压器层都包含具有门控机制的并联适配器,选择性地混合原始和适应的特征,以保持增量训练期间的稳定性。此外,该框架通过辅助蒸馏损失动态地将新出现的情感词典术语提取到编码器中,确保对不断变化的金融语言的敏感性。由此产生的情感嵌入通过跨模态关注与市场数据融合,其中适配器门控输出进一步调节文本特征的贡献。通过RoBERTa-large主干和在线Fisher矩阵近似实现,我们的方法证明了与高频交易场景的兼容性,同时优于静态领域适应模型。关键的创新在于将基于适配器的持续学习与金融词汇动态和模式特定门控紧密结合在一起,这是以前的工作没有探索过的组合。跨多模态市场数据集的实验验证证实了该模型同时保存金融领域知识和捕捉时间情绪变化的能力,优于通用的持续学习方法和专业的金融编码器。这一进步弥合了稳定表征学习和实时市场适应之间的差距,为算法交易系统中的动态情绪分析提供了原则性解决方案。
{"title":"Adapter-Regularised Continual Learning for Dynamic Financial Sentiment Encoding in Multi-Modal Market Fusion","authors":"Zihe Song,&nbsp;Renke Huang,&nbsp;Aiqi Li,&nbsp;Aoran Shen,&nbsp;Heng Chen","doi":"10.1111/exsy.70178","DOIUrl":"https://doi.org/10.1111/exsy.70178","url":null,"abstract":"<div>\u0000 \u0000 <p>We propose an adapter-regularised continual learning framework for dynamic financial sentiment encoding, addressing the dual challenge of retaining long-term domain knowledge while adapting to transient market sentiment patterns. The proposed method augments a pre-trained RoBERTa model with lightweight adapter modules and elastic knowledge consolidation, enabling parameter-efficient updates without catastrophic forgetting. Each transformer layer incorporates parallel adapters with gating mechanisms, selectively blending original and adapted features to maintain stability during incremental training. Moreover, the framework dynamically distills emerging sentiment lexicon terms into the encoder through an auxiliary distillation loss, ensuring sensitivity to evolving financial language. The resulting sentiment embeddings are fused with market data via cross-modal attention, where adapter gating outputs further modulate the contribution of textual features. Realised with a RoBERTa-large backbone and online Fisher matrix approximation, our approach demonstrates compatibility with high-frequency trading scenarios while outperforming static domain-adapted models. The key innovation lies in the tight integration of adapter-based continual learning with financial lexicon dynamics and modality-specific gating, a combination not explored in prior work. Experimental validation across multi-modal market datasets confirms the model's ability to simultaneously preserve financial domain knowledge and capture temporal sentiment shifts, outperforming both generic continual learning methods and specialised financial encoders. This advancement bridges the gap between stable representation learning and real-time market adaptation, offering a principled solution for dynamic sentiment analysis in algorithmic trading systems.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145824456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
AI-Driven Intelligent Feedback System for Enhancing Self-Assessment Accuracy in Higher Education Writing 提高高等教育写作自我评估准确性的ai驱动智能反馈系统
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-12-10 DOI: 10.1111/exsy.70184
Shih-Yhe Chen, Wei-Cheng Chen

With the rapid advancement of generative artificial intelligence, large language models (LLMs) have become increasingly integrated into education, particularly for automated formative feedback and writing assessment. This study introduces and evaluates an AI-driven intelligent feedback system aimed at promoting sustainable and inclusive practices in higher education. It does so by delivering cost-effective feedback in under-resourced contexts and adaptive guidance for diverse learners. The system is built on transformer-based models (BERT and RoBERTa) to support personalised writing evaluation and feedback generation. The system aims to improve students’ self-assessment accuracy (SAA), a critical factor for self-regulated learning, while addressing the challenge of delivering high-quality feedback efficiently in under-resourced contexts. A quasi-experimental design was employed to examine the effects of LLM-generated feedback (LLMF) on students’ SAA and to investigate how these effects vary by initial ability. Results indicated no significant group-level difference in posttest SAA between the experimental and control groups. More importantly, interaction analysis revealed a significant moderating effect of Initial Self-Assessment Accuracy (ISAA). Students with lower baseline accuracy benefited substantially from LLMF, while those with higher baseline SAA showed limited change. This compensatory effect highlights the potential of LLMF to reduce inequities in self-regulated learning. These findings demonstrate the potential of AI-driven feedback systems to cost-effectively reduce calibration gaps and foster metacognitive development. By embedding adaptive and personalised mechanisms, such systems advance educational equity and promote scalable personalised learning. They also contribute to the broader agenda of intelligent and sustainable education.

随着生成式人工智能的快速发展,大型语言模型(llm)越来越多地集成到教育中,特别是用于自动形成反馈和写作评估。本研究介绍并评估了一个人工智能驱动的智能反馈系统,旨在促进高等教育的可持续和包容性实践。它通过在资源不足的情况下提供具有成本效益的反馈,并为不同的学习者提供适应性指导来实现这一目标。该系统建立在基于变压器的模型(BERT和RoBERTa)上,以支持个性化的写作评估和反馈生成。该系统旨在提高学生自我评估的准确性(SAA),这是自主学习的关键因素,同时解决在资源不足的情况下有效提供高质量反馈的挑战。采用准实验设计来检验llm生成反馈(LLMF)对学生SAA的影响,并研究这些影响如何随初始能力而变化。结果显示,实验组与对照组在测试后SAA水平上无显著差异。更重要的是,交互作用分析显示初始自我评估准确性(ISAA)具有显著的调节作用。基线准确度较低的学生从LLMF中获益显著,而基线SAA较高的学生变化有限。这种补偿效应突出了LLMF在减少自我调节学习中的不公平方面的潜力。这些发现证明了人工智能驱动的反馈系统在经济有效地减少校准差距和促进元认知发展方面的潜力。通过嵌入适应性和个性化机制,这些系统促进了教育公平,促进了可扩展的个性化学习。它们还有助于更广泛的智能和可持续教育议程。
{"title":"AI-Driven Intelligent Feedback System for Enhancing Self-Assessment Accuracy in Higher Education Writing","authors":"Shih-Yhe Chen,&nbsp;Wei-Cheng Chen","doi":"10.1111/exsy.70184","DOIUrl":"https://doi.org/10.1111/exsy.70184","url":null,"abstract":"<div>\u0000 \u0000 <p>With the rapid advancement of generative artificial intelligence, large language models (LLMs) have become increasingly integrated into education, particularly for automated formative feedback and writing assessment. This study introduces and evaluates an AI-driven intelligent feedback system aimed at promoting sustainable and inclusive practices in higher education. It does so by delivering cost-effective feedback in under-resourced contexts and adaptive guidance for diverse learners. The system is built on transformer-based models (BERT and RoBERTa) to support personalised writing evaluation and feedback generation. The system aims to improve students’ self-assessment accuracy (SAA), a critical factor for self-regulated learning, while addressing the challenge of delivering high-quality feedback efficiently in under-resourced contexts. A quasi-experimental design was employed to examine the effects of LLM-generated feedback (LLMF) on students’ SAA and to investigate how these effects vary by initial ability. Results indicated no significant group-level difference in posttest SAA between the experimental and control groups. More importantly, interaction analysis revealed a significant moderating effect of Initial Self-Assessment Accuracy (ISAA). Students with lower baseline accuracy benefited substantially from LLMF, while those with higher baseline SAA showed limited change. This compensatory effect highlights the potential of LLMF to reduce inequities in self-regulated learning. These findings demonstrate the potential of AI-driven feedback systems to cost-effectively reduce calibration gaps and foster metacognitive development. By embedding adaptive and personalised mechanisms, such systems advance educational equity and promote scalable personalised learning. They also contribute to the broader agenda of intelligent and sustainable education.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145739637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Detection of APTs by Machine Learning: A Performance Comparison 机器学习检测apt:性能比较
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-12-09 DOI: 10.1111/exsy.70181
Marcos Luengo Viñuela, Jesús-Ángel Román-Gallego, María-Luisa Pérez-Delgado, Miguel A. Conde, María-Concepción Vega-Hernández, Hernando Silva Varela

Recent advances in machine learning and deep learning have significantly impacted multiple domains, including computer vision, natural language processing and cybersecurity. In the context of increasingly sophisticated Advanced Persistent Threats (APTs), deep learning models have shown strong potential for network intrusion detection by addressing the limitations of traditional methods. This study presents a comparative evaluation of classical and deep learning models for APT detection, highlighting the ability of deep architectures, such as Convolutional Neural Networks and Long Short-Term Memory networks, to automatically extract complex temporal and spatial patterns from network traffic data. A key objective is to maximise detection accuracy while minimising false positives and false negatives. Experimental results show that Convolutional Neural Networks applied to the SCVIC-APT-2021 dataset achieved outstanding performance, with 99.24% accuracy, 99.39% precision, 99.24% recall and a 99.24% F1-score. These results confirm the robustness of deep learning techniques for APT detection and underscore their effectiveness in identifying malicious activity in modern network environments.

机器学习和深度学习的最新进展对多个领域产生了重大影响,包括计算机视觉、自然语言处理和网络安全。在日益复杂的高级持续威胁(apt)的背景下,深度学习模型通过解决传统方法的局限性,在网络入侵检测方面显示出强大的潜力。本研究对APT检测的经典和深度学习模型进行了比较评估,强调了深度架构(如卷积神经网络和长短期记忆网络)从网络流量数据中自动提取复杂时空模式的能力。一个关键目标是最大限度地提高检测准确性,同时最大限度地减少假阳性和假阴性。实验结果表明,卷积神经网络应用于SCVIC-APT-2021数据集取得了优异的性能,准确率为99.24%,精密度为99.39%,召回率为99.24%,f1分数为99.24%。这些结果证实了深度学习技术用于APT检测的鲁棒性,并强调了它们在现代网络环境中识别恶意活动的有效性。
{"title":"Detection of APTs by Machine Learning: A Performance Comparison","authors":"Marcos Luengo Viñuela,&nbsp;Jesús-Ángel Román-Gallego,&nbsp;María-Luisa Pérez-Delgado,&nbsp;Miguel A. Conde,&nbsp;María-Concepción Vega-Hernández,&nbsp;Hernando Silva Varela","doi":"10.1111/exsy.70181","DOIUrl":"https://doi.org/10.1111/exsy.70181","url":null,"abstract":"<p>Recent advances in machine learning and deep learning have significantly impacted multiple domains, including computer vision, natural language processing and cybersecurity. In the context of increasingly sophisticated Advanced Persistent Threats (APTs), deep learning models have shown strong potential for network intrusion detection by addressing the limitations of traditional methods. This study presents a comparative evaluation of classical and deep learning models for APT detection, highlighting the ability of deep architectures, such as Convolutional Neural Networks and Long Short-Term Memory networks, to automatically extract complex temporal and spatial patterns from network traffic data. A key objective is to maximise detection accuracy while minimising false positives and false negatives. Experimental results show that Convolutional Neural Networks applied to the SCVIC-APT-2021 dataset achieved outstanding performance, with 99.24% accuracy, 99.39% precision, 99.24% recall and a 99.24% F1-score. These results confirm the robustness of deep learning techniques for APT detection and underscore their effectiveness in identifying malicious activity in modern network environments.</p>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/exsy.70181","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145739587","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
Three Algorithms for Parallel Graph Summarization 并行图摘要的三种算法
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-12-09 DOI: 10.1111/exsy.70179
Till Blume, Jannik Rau, David Richerby, Ansgar Scherp

Most graph summarization algorithms are tailored to a specific graph summary model and were designed for one-time computations only, that is, batch-based computations. We developed a universal approach for parallel graph summarization and three algorithms to compute graph summaries—a batch-based algorithm for static graphs, an incremental algorithm for evolving graphs, and a hash-based algorithm that scales to large graphs and large schema structures, that is, using paths of length up to k$$ k $$ to define vertex equivalence. Experimenting with benchmark and real-world datasets, we observe that the incremental algorithm almost always runs faster than batch computation, even when 50% of the graph changes, and even when using fewer cores; however, it only uses 8% more memory (±1%$$ pm 1% $$). Furthermore, we show that the hash-based algorithm can compute 10-hop equivalent subgraphs on graphs with over 10 M edges within seconds, on graphs of 100 + M edges within a few minutes, and on graphs of 1 + B edges in less than an hour. We analyse the complexity of our algorithms in detail and prove that the incremental algorithm is correct. Overall, we show with these three algorithms that our parallel approach for graph summarisation is versatile and opens the path for various applications that require summaries of large-scale graphs.

大多数图摘要算法都是针对特定的图摘要模型量身定制的,并且仅用于一次性计算,即基于批处理的计算。我们开发了一种用于并行图摘要的通用方法和三种计算图摘要的算法——一种用于静态图的基于批的算法,一种用于演化图的增量算法,以及一种用于扩展到大型图和大型模式结构的基于哈希的算法,即使用长度为k $$ k $$的路径来定义顶点等价。通过对基准测试和真实数据集的实验,我们观察到增量算法几乎总是比批处理计算运行得更快,即使是在50时也是如此% of the graph changes, and even when using fewer cores; however, it only uses 8% more memory ( ± 1 % $$ pm 1% $$ ). Furthermore, we show that the hash-based algorithm can compute 10-hop equivalent subgraphs on graphs with over 10 M edges within seconds, on graphs of 100 + M edges within a few minutes, and on graphs of 1 + B edges in less than an hour. We analyse the complexity of our algorithms in detail and prove that the incremental algorithm is correct. Overall, we show with these three algorithms that our parallel approach for graph summarisation is versatile and opens the path for various applications that require summaries of large-scale graphs.
{"title":"Three Algorithms for Parallel Graph Summarization","authors":"Till Blume,&nbsp;Jannik Rau,&nbsp;David Richerby,&nbsp;Ansgar Scherp","doi":"10.1111/exsy.70179","DOIUrl":"https://doi.org/10.1111/exsy.70179","url":null,"abstract":"<div>\u0000 \u0000 <p>Most graph summarization algorithms are tailored to a specific graph summary model and were designed for one-time computations only, that is, batch-based computations. We developed a universal approach for parallel graph summarization and three algorithms to compute graph summaries—a batch-based algorithm for static graphs, an incremental algorithm for evolving graphs, and a hash-based algorithm that scales to large graphs and large schema structures, that is, using paths of length up to <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 <annotation>$$ k $$</annotation>\u0000 </semantics></math> to define vertex equivalence. Experimenting with benchmark and real-world datasets, we observe that the incremental algorithm almost always runs faster than batch computation, even when 50% of the graph changes, and even when using fewer cores; however, it only uses 8% more memory (<span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>±</mo>\u0000 <mn>1</mn>\u0000 <mo>%</mo>\u0000 </mrow>\u0000 <annotation>$$ pm 1% $$</annotation>\u0000 </semantics></math>). Furthermore, we show that the hash-based algorithm can compute 10-hop equivalent subgraphs on graphs with over 10 M edges within seconds, on graphs of 100 + M edges within a few minutes, and on graphs of 1 + B edges in less than an hour. We analyse the complexity of our algorithms in detail and prove that the incremental algorithm is correct. Overall, we show with these three algorithms that our parallel approach for graph summarisation is versatile and opens the path for various applications that require summaries of large-scale graphs.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145739588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Periodicity Variations Modelling Based on 2D Multi-Scale Patch for Multivariate Time Series Forecasting Using Improved MLP and Depthwise Separable Convolution 基于改进MLP和深度可分离卷积的二维多尺度斑块周期变化建模用于多元时间序列预测
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-12-08 DOI: 10.1111/exsy.70183
Yachuan Wang, Mi Wen, Dongyang Li, Jigang Wang

Multivariate time series forecasting (MTSF) involves predicting future values of multiple interrelated variables based on historical observations. While existing models often struggle to capture complex temporal multi-scale dependencies and simultaneously modelling intraperiod and interperiod variations, thereby limiting their predictive accuracy. To address these limitations, we introduce a novel forecasting model named MTSPnet. This model employs a two-dimensional (2D) temporal multi-scale patching strategy, which converts one-dimensional (1D) time series data into 2D multi-scale Patch across different time periods. Additionally, MTSPnet incorporates two complementary modules: an interactive multilayer perceptron (MLPmix) module and a dynamic depthwise separable convolution (DDSC) module. These modules enable MTSPnet to efficiently extract both local and global temporal features, further enhancing its ability to model multi-scale dependencies and periodicity variations. Experimental evaluations on seven real-world datasets demonstrate that MTSPnet achieves superior performance in long-term forecasting, proving its effectiveness as a robust and efficient solution for accurate time series prediction.

多变量时间序列预测(MTSF)是基于历史观测对多个相关变量的未来值进行预测。而现有的模型往往难以捕捉复杂的时间多尺度依赖关系,并同时模拟周期内和周期间的变化,从而限制了它们的预测准确性。为了解决这些限制,我们引入了一种新的预测模型MTSPnet。该模型采用二维(2D)时间多尺度补丁策略,将一维(1D)时间序列数据转换为不同时间段的二维多尺度Patch。此外,MTSPnet包含两个互补模块:交互式多层感知器(MLPmix)模块和动态深度可分离卷积(DDSC)模块。这些模块使MTSPnet能够有效地提取局部和全局时间特征,进一步增强其多尺度依赖性和周期性变化的建模能力。在7个真实数据集上的实验评估表明,MTSPnet在长期预测中取得了优异的性能,证明了其作为准确时间序列预测的鲁棒性和有效性。
{"title":"Periodicity Variations Modelling Based on 2D Multi-Scale Patch for Multivariate Time Series Forecasting Using Improved MLP and Depthwise Separable Convolution","authors":"Yachuan Wang,&nbsp;Mi Wen,&nbsp;Dongyang Li,&nbsp;Jigang Wang","doi":"10.1111/exsy.70183","DOIUrl":"https://doi.org/10.1111/exsy.70183","url":null,"abstract":"<div>\u0000 \u0000 <p>Multivariate time series forecasting (MTSF) involves predicting future values of multiple interrelated variables based on historical observations. While existing models often struggle to capture complex temporal multi-scale dependencies and simultaneously modelling intraperiod and interperiod variations, thereby limiting their predictive accuracy. To address these limitations, we introduce a novel forecasting model named MTSPnet. This model employs a two-dimensional (2D) temporal multi-scale patching strategy, which converts one-dimensional (1D) time series data into 2D multi-scale Patch across different time periods. Additionally, MTSPnet incorporates two complementary modules: an interactive multilayer perceptron (MLPmix) module and a dynamic depthwise separable convolution (DDSC) module. These modules enable MTSPnet to efficiently extract both local and global temporal features, further enhancing its ability to model multi-scale dependencies and periodicity variations. Experimental evaluations on seven real-world datasets demonstrate that MTSPnet achieves superior performance in long-term forecasting, proving its effectiveness as a robust and efficient solution for accurate time series prediction.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145739577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Neural Networks for Space Debris Classification 空间碎片分类的神经网络
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-12-08 DOI: 10.1111/exsy.70180
Anne Adriano, K. Andrea Scott, Haroon Oqab, George Dietrich, Nasser Lashgarian Azad

Significant research in the field of space domain awareness (SDA) has focused on improving AI-driven data processing and classification tasks. Previous studies have explored the classification of orbiting man-made object types such as satellites, rocket bodies, and debris, yet there is a noticeable gap in the literature concerning the subclassification of debris shapes such as fragments and detached satellite components. This lack of focus on debris characterisation despite the growing urgency to study Earth-orbiting debris could be attributed to the scarcity of labelled debris data. More importantly, debris shape plays a crucial role in collision risk assessment, reentry prediction, and active debris removal (ADR). In the absence of publicly available datasets with detailed shape information, this study establishes a baseline for debris sub-classification, aiding in improved debris mitigation and collision avoidance efforts. To address these challenges, a light curve simulation framework was created to generate LEO debris light curves based on physical object parameters and initial conditions defined by historical two-line elements (TLEs) of debris. The principal investigation involved debris shape classification using a long short-term memory fully convolutional network (LSTM-FCN). An ablation study was carried out to investigate the performance of the LSTM and FCN separately. In addition to debris shape, the light curves demonstrated a level of sensitivity to material type. This motivated a secondary study involving multi-task learning (MTL), in which material classification was introduced to the original LSTM-FCN. The results demonstrated that the MTL approach enhanced the model's generalisation for the shape classification task. A 2% improvement from the single-task to the multi-task model is considered notable, highlighting the benefits of MTL. Retrieving material and shape information indirectly informs classification tasks in SDA on the debris' sensitivity to both atmospheric drag and solar radiation pressure, which are key considerations in the study of debris motion and ADR. Future work will focus on incorporating irregular shapes into the dataset and exploring the impact of a larger dataset on classification performance.

空间域感知(SDA)领域的重要研究集中在改进人工智能驱动的数据处理和分类任务上。先前的研究已经探索了轨道人造物体类型的分类,如卫星、火箭体和碎片,但关于碎片形状的分类,如碎片和分离的卫星部件,文献中存在明显的空白。尽管研究地球轨道碎片的紧迫性日益增加,但对碎片特征缺乏关注可能归因于标记碎片数据的稀缺。更重要的是,碎片形状在碰撞风险评估、再入预测和主动碎片清除(ADR)中起着至关重要的作用。在缺乏具有详细形状信息的公开数据集的情况下,本研究建立了碎片子分类的基线,有助于改进碎片缓减和避免碰撞的工作。为了解决这些问题,创建了一个光曲线仿真框架,根据碎片的物理对象参数和历史双线元(TLEs)定义的初始条件生成LEO碎片光曲线。主要研究采用长短期记忆全卷积网络(LSTM-FCN)对碎片形状进行分类。分别对LSTM和FCN的性能进行了烧蚀研究。除了碎片的形状外,光曲线还显示出对材料类型的一定程度的敏感性。这激发了涉及多任务学习(MTL)的二次研究,其中将材料分类引入原始LSTM-FCN。结果表明,MTL方法增强了模型对形状分类任务的泛化能力。从单任务模型到多任务模型,2%的改进被认为是值得注意的,这突出了MTL的好处。获取材料和形状信息间接地为SDA中碎片对大气阻力和太阳辐射压力敏感性的分类任务提供信息,这是研究碎片运动和ADR的关键考虑因素。未来的工作将集中在将不规则形状合并到数据集中,并探索更大的数据集对分类性能的影响。
{"title":"Neural Networks for Space Debris Classification","authors":"Anne Adriano,&nbsp;K. Andrea Scott,&nbsp;Haroon Oqab,&nbsp;George Dietrich,&nbsp;Nasser Lashgarian Azad","doi":"10.1111/exsy.70180","DOIUrl":"https://doi.org/10.1111/exsy.70180","url":null,"abstract":"<p>Significant research in the field of space domain awareness (SDA) has focused on improving AI-driven data processing and classification tasks. Previous studies have explored the classification of orbiting man-made object types such as satellites, rocket bodies, and debris, yet there is a noticeable gap in the literature concerning the subclassification of debris shapes such as fragments and detached satellite components. This lack of focus on debris characterisation despite the growing urgency to study Earth-orbiting debris could be attributed to the scarcity of labelled debris data. More importantly, debris shape plays a crucial role in collision risk assessment, reentry prediction, and active debris removal (ADR). In the absence of publicly available datasets with detailed shape information, this study establishes a baseline for debris sub-classification, aiding in improved debris mitigation and collision avoidance efforts. To address these challenges, a light curve simulation framework was created to generate LEO debris light curves based on physical object parameters and initial conditions defined by historical two-line elements (TLEs) of debris. The principal investigation involved debris shape classification using a long short-term memory fully convolutional network (LSTM-FCN). An ablation study was carried out to investigate the performance of the LSTM and FCN separately. In addition to debris shape, the light curves demonstrated a level of sensitivity to material type. This motivated a secondary study involving multi-task learning (MTL), in which material classification was introduced to the original LSTM-FCN. The results demonstrated that the MTL approach enhanced the model's generalisation for the shape classification task. A 2% improvement from the single-task to the multi-task model is considered notable, highlighting the benefits of MTL. Retrieving material and shape information indirectly informs classification tasks in SDA on the debris' sensitivity to both atmospheric drag and solar radiation pressure, which are key considerations in the study of debris motion and ADR. Future work will focus on incorporating irregular shapes into the dataset and exploring the impact of a larger dataset on classification performance.</p>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/exsy.70180","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145750636","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
Federated Deep Learning for Collision Avoidance in IoV With Digital Twin Integration 基于数字孪生集成的车联网避碰联合深度学习
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-12-01 DOI: 10.1111/exsy.70168
Fida Muhammad Khan, Asim Zeb, Taj Rahman, Inam Ullah, Nazik Alturki, Ali Kashif Bashir, Yamen El Touati, Nidhal Ben Khedher, Khalid Mahmood Awan

The Internet of Vehicles (IoV) is revolutionising transportation by connecting vehicles, infrastructure and devices, enabling more intelligent and safer mobility. One key challenge is ensuring efficient and secure communication among vehicles with varying capabilities, including different sizes, speeds and sensor configurations. This research introduces a Federated Learning-Driven Deep Learning (FLDL) approach to intelligent collision avoidance, designed to address the heterogeneity of vehicles in the IoV ecosystem. The system integrates real-time data from vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications, while considering factors like vehicle type, road conditions, driver behaviour and Digital Twins. Our approach leverages multiple Federated Learning strategies, which enhance privacy protection, reduce communication overhead and enable real-time decision-making without the need for centralised data storage. Experimental results show that the GNN + FedGC model achieves the highest performance with an accuracy of 98.8%, outperforming other models such as MLP with FedLU (98.5%), DRL with FedPPO (98.3%) and LSTM with FedSGD (97.65%). The integration of Digital Twins further enhances model accuracy by simulating real-time vehicle behaviour and environmental conditions. This FL-based system not only improves collision prediction but also enhances safety, reduces accident rates and supports scalable decision-making in smart city transportation systems.

车联网(IoV)通过连接车辆、基础设施和设备,正在彻底改变交通运输,实现更智能、更安全的出行。一个关键的挑战是确保不同功能的车辆之间高效、安全的通信,包括不同的尺寸、速度和传感器配置。本研究引入了一种联邦学习驱动的深度学习(FLDL)方法来实现智能避碰,旨在解决车联网生态系统中车辆的异质性问题。该系统集成了车辆对车辆(V2V)和车辆对基础设施(V2I)通信的实时数据,同时考虑了车辆类型、道路状况、驾驶员行为和数字孪生等因素。我们的方法利用多种联邦学习策略,增强隐私保护,减少通信开销,实现实时决策,而无需集中数据存储。实验结果表明,GNN + FedGC模型的准确率最高,达到98.8%,优于MLP + FedLU(98.5%)、DRL + FedPPO(98.3%)和LSTM + FedSGD(97.65%)等模型。Digital Twins的集成通过模拟实时车辆行为和环境条件进一步提高了模型的准确性。这个基于fl的系统不仅提高了碰撞预测,还提高了安全性,降低了事故率,并支持智能城市交通系统的可扩展决策。
{"title":"Federated Deep Learning for Collision Avoidance in IoV With Digital Twin Integration","authors":"Fida Muhammad Khan,&nbsp;Asim Zeb,&nbsp;Taj Rahman,&nbsp;Inam Ullah,&nbsp;Nazik Alturki,&nbsp;Ali Kashif Bashir,&nbsp;Yamen El Touati,&nbsp;Nidhal Ben Khedher,&nbsp;Khalid Mahmood Awan","doi":"10.1111/exsy.70168","DOIUrl":"https://doi.org/10.1111/exsy.70168","url":null,"abstract":"<div>\u0000 \u0000 <p>The Internet of Vehicles (IoV) is revolutionising transportation by connecting vehicles, infrastructure and devices, enabling more intelligent and safer mobility. One key challenge is ensuring efficient and secure communication among vehicles with varying capabilities, including different sizes, speeds and sensor configurations. This research introduces a Federated Learning-Driven Deep Learning (FLDL) approach to intelligent collision avoidance, designed to address the heterogeneity of vehicles in the IoV ecosystem. The system integrates real-time data from vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications, while considering factors like vehicle type, road conditions, driver behaviour and Digital Twins. Our approach leverages multiple Federated Learning strategies, which enhance privacy protection, reduce communication overhead and enable real-time decision-making without the need for centralised data storage. Experimental results show that the GNN + FedGC model achieves the highest performance with an accuracy of 98.8%, outperforming other models such as MLP with FedLU (98.5%), DRL with FedPPO (98.3%) and LSTM with FedSGD (97.65%). The integration of Digital Twins further enhances model accuracy by simulating real-time vehicle behaviour and environmental conditions. This FL-based system not only improves collision prediction but also enhances safety, reduces accident rates and supports scalable decision-making in smart city transportation systems.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145695069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Expert Systems
全部 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