{"title":"GT-LLM: Graph Topology-Enhanced LLM for Temporal Knowledge Graph Reasoning","authors":"Jinglu Chen, Wenhao Zhang, Mengpan Chen, Liangliang Zhang, Daniel Dajun Zeng","doi":"10.1111/exsy.70338","DOIUrl":"https://doi.org/10.1111/exsy.70338","url":null,"abstract":"<div>\u0000 \u0000 <p>Temporal knowledge graph reasoning (TKGR) aims to predict future facts based on events that have occurred up to the current timestamp in a temporal knowledge graph (TKG). Traditional learning-based methods focus on structural information but overlook semantics inherent in TKGs, while rule-based methods struggle to generate sufficient high-quality temporal logical rules. Recently, large language models (LLMs) have been introduced into the TKGR task, typically leveraging retrieved relevant historical events and LLMs' semantic understanding and reasoning abilities to infer missing information in the query. Existing LLM-based methods encompass both fine-tuning and non-fine-tuning variants. The former demands high computational cost and exhibits limited transferability, whereas the latter suffers from performance constraints stemming from the absence of specialised adaptation training. In this paper, we introduce GT-LLM, a novel non-fine-tuning TKGR framework that enhances performance by improving history retrieval quality while avoiding costly task-specific LLM fine-tuning and preserving flexible adaptability to different or dynamically updated TKGs. The key to our method is that it transforms a series of TKG subgraphs into a single, unified topological graph, where entities, relations, and timestamps are explicitly modelled as nodes and connected through topological edges to expose richer associations for history retrieval. Based on this unified representation, we design a general TKGR pipeline that performs history retrieval based on topological association strength and temporal relevance, followed by LLM reasoning under vocabulary-level constraints. Furthermore, we integrate the predictions from the LLM with those from a graph-based model to harness their complementary strengths. Extensive experimental results on standard TKGR benchmarks demonstrate that our method significantly improves history retrieval quality and achieves promising overall performance.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 8","pages":""},"PeriodicalIF":3.4,"publicationDate":"2026-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148324295","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}
Expert SystemsPub Date : 2026-06-21DOI: 10.1111/exsy.70339
Hua Ma, Jun He, Yutian Liu, Bowen Zheng, Hongyu Zhang
{"title":"Leveraging High-Impact User Interactions for Social User Opinion Prediction: An Approach via Block-Wise Matrix Factorisation and Attention Mechanism","authors":"Hua Ma, Jun He, Yutian Liu, Bowen Zheng, Hongyu Zhang","doi":"10.1111/exsy.70339","DOIUrl":"https://doi.org/10.1111/exsy.70339","url":null,"abstract":"<div>\u0000 \u0000 <p>Rapidly growing social media has become a key platform in recent years for influencing public sentiment and shaping hot public opinion. Against this backdrop, accurately predicting social users' opinions holds significant importance for public opinion analysis and guidance. Existing research generally focuses on the macro level of hot events. However, it fails to fully exploit the interaction data between high-impact users and ordinary users. Moreover, such studies often neglect individual user characteristics and behavioural differences, which limits their capability in accurately forecasting user opinion trends. This paper proposes a novel approach to predict social users' opinions by leveraging high-impact users' interaction data. The approach utilises the posts and interactive comments of high-impact users to construct multiple user–post opinion matrices and employs block-wise matrix factorisation to extract the latent embeddings of users and posts. Building upon this, the historical comment–post pairs are encoded using BERT, and a bidirectional cross-attention mechanism is applied to model the semantic correlations between comments and posts, yielding cross-attentional pair representations. To integrate these representations, a dynamic attention mechanism is used to weight and aggregate historical behaviours, generating an attention-weighted semantic representation that is highly relevant to the current task. Finally, the multi-source features of users and posts are fused through a transformer architecture and fed into a multi-layer perceptron for opinion prediction. Experiments on a real-world dataset demonstrate that the proposed approach achieves superior performance in user opinion prediction, showing promising potential for practical applications.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 8","pages":""},"PeriodicalIF":3.4,"publicationDate":"2026-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148324296","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}
Expert SystemsPub Date : 2026-06-18DOI: 10.1111/exsy.70272
Jia-Cheng Shen, Wei-Feng Tung
{"title":"Topic Evolution Analysis for Social Robots Based on Latent Dirichlet Allocation","authors":"Jia-Cheng Shen, Wei-Feng Tung","doi":"10.1111/exsy.70272","DOIUrl":"https://doi.org/10.1111/exsy.70272","url":null,"abstract":"<div>\u0000 \u0000 <p>With the rapid growth of the robotics market, social robots have garnered increasing global attention. Investigating service innovation within the domain of social robots enables a better understanding of the field's developmental trajectory and emerging trends. Such insights can support enterprises and researchers in the development of innovative technologies and related applications. This study collected a total of 1406 abstracts related to social robots published over the past 15 years from the Web of Science journal database, which served as the primary research corpus. The thematic evolution of social robots was analysed from two perspectives: the evolution of thematic intensity and the evolution of thematic content. The findings are as follows: (1) In the early stages, research was predominantly focused on system technologies. As these technologies matured, they facilitated the diversification of research topics, leading to a relative decline in system technology research and a corresponding rise in studies from other domains. (2) The development of social robots has primarily followed three main trajectories: system technologies, research concerning children and research concerning the elderly. Subtopics such as healthcare, companionship, education, interaction and innovative applications in commercial services have evolved independently while also aligning with these major trajectories, resulting in a diversified research landscape.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 8","pages":""},"PeriodicalIF":3.4,"publicationDate":"2026-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148274753","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}
Expert SystemsPub Date : 2026-06-18DOI: 10.1111/exsy.70322
Md. Sakib Bin Alam, Aiman Lameesa, Barsha Roy, Shams Forruque Ahmed, Amir H. Gandomi
{"title":"Emotion AI on the Edge: A TinyML-Driven Framework for Speech Emotion Recognition in Social Environments","authors":"Md. Sakib Bin Alam, Aiman Lameesa, Barsha Roy, Shams Forruque Ahmed, Amir H. Gandomi","doi":"10.1111/exsy.70322","DOIUrl":"https://doi.org/10.1111/exsy.70322","url":null,"abstract":"<div>\u0000 \u0000 <p>The rise of Emotion AI is transforming how human emotions are detected, interpreted and responded to in real-time social systems. Speech emotion recognition (SER) enables machines to understand human emotions from voice, fostering more empathetic and context-aware interactions. However, the currently deployed SER systems are frequently based on highly resource-consuming large models, which are unsuitable for real-time deployment on edge devices with limited memory and processing power. Most previous studies have focused on single-language or single accent datasets, which results in ineffective extrapolation to various speakers, accents and the real world. This study introduces a scalable and lightweight SER system designed for the TinyML environment and suitable for deployment on resource-constrained systems, including social networks using IoT technologies, assistive technologies and embedded mental health devices. Combining RAVDESS, TESS and SAVEE increases dataset diversity. Their effectiveness in capturing both spectral and temporal emotion cues is tested across six hybrid frameworks of deep learning, such as CNN + BiLSTM and CNN + BiGRU with multi-head attention. The best model achieved 74.15% accuracy, with a macro F1-score of 0.73, a weighted F1-score of 0.74, and a highest class-level F1-score of 0.82, supporting low-latency emotion recognition for affect-aware edge applications. The quantization through TensorFlow Lite further reduces the model size by up to 94.5% and achieves inference latency as low as 3.4 ms, making it suitable for deployment on microcontrollers. This study contributes to Emotion AI as it allows detecting emotions on edge devices to facilitate affect-aware customer service, support mental health, improve education and more broadly, computational social systems.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 8","pages":""},"PeriodicalIF":3.4,"publicationDate":"2026-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148274756","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}
Expert SystemsPub Date : 2026-06-18DOI: 10.1111/exsy.70333
Sebastián Andrés Mayorquín Posadas, Julio Vega
{"title":"Thinking Is Not Enough: The B* Expansion Technique for Enhancing Autonomous LLM Agents","authors":"Sebastián Andrés Mayorquín Posadas, Julio Vega","doi":"10.1111/exsy.70333","DOIUrl":"https://doi.org/10.1111/exsy.70333","url":null,"abstract":"<p>Most autonomous agents built on large language models (LLMs) focus on improving internal reasoning while assuming a fixed and complete set of primitive actions. In this work, we challenge this assumption and introduce the <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msup>\u0000 <mi>B</mi>\u0000 <mo>*</mo>\u0000 </msup>\u0000 </mrow>\u0000 <annotation>$$ {B}^{ast } $$</annotation>\u0000 </semantics></math> expansion technique, an action-centric method that enables agents to iteratively construct new actions beyond an initial basis <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>B</mi>\u0000 </mrow>\u0000 <annotation>$$ B $$</annotation>\u0000 </semantics></math>, forming an expanded action space <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msup>\u0000 <mi>B</mi>\u0000 <mo>*</mo>\u0000 </msup>\u0000 <mo>=</mo>\u0000 <mi>B</mi>\u0000 <mo>∪</mo>\u0000 <msup>\u0000 <mi>A</mi>\u0000 <mo>*</mo>\u0000 </msup>\u0000 </mrow>\u0000 <annotation>$$ {B}^{ast }=Bcup {A}^{ast } $$</annotation>\u0000 </semantics></math>. To formalize this paradigm, we present a unified framework for act-centric autonomy that explicitly models action space evolution, distinguishing our approach from prior frameworks such as ReAct, which operate over fixed action sets. Within this framework, <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msup>\u0000 <mi>B</mi>\u0000 <mo>*</mo>\u0000 </msup>\u0000 </mrow>\u0000 <annotation>$$ {B}^{ast } $$</annotation>\u0000 </semantics></math> serves as a concrete instantiation that operationalizes dynamic action generation. We evaluate <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msup>\u0000 <mi>B</mi>\u0000 <mo>*</mo>\u0000 </msup>\u0000 </mrow>\u0000 <annotation>$$ {B}^{ast } $$</annotation>\u0000 </semantics></math> in a non-trivial, fully observable environment—Conway's Game of Life on a <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>200</mn>\u0000 <mo>×</mo>\u0000 <mn>200</mn>\u0000 </mrow>\u0000 <annotation>$$ 200times 200 $$</annotation>\u0000 </semantics></math> grid—where the objective is to maximize the number of live cells after 300 generations. Our results show that expanding the action space leads to improved ex","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 8","pages":""},"PeriodicalIF":3.4,"publicationDate":"2026-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/exsy.70333","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148274755","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}
Expert SystemsPub Date : 2026-06-18DOI: 10.1111/exsy.70331
Sena Dikici, Turgay Tugay Bilgin
{"title":"Small Language Models: A Systematic Review of Computational Trade-Offs, Privacy Advantages and Deployment in Intelligent Systems","authors":"Sena Dikici, Turgay Tugay Bilgin","doi":"10.1111/exsy.70331","DOIUrl":"https://doi.org/10.1111/exsy.70331","url":null,"abstract":"<p>This systematic review synthesizes evidence from 68 studies, including peer-reviewed journal articles, indexed conference/workshop proceedings and five remaining arXiv preprints published between 2022 and 2025, on small language models (SLMs) as computationally efficient alternatives to large language models (LLMs). Following PRISMA 2020 guidelines, we analyse optimization techniques, performance metrics, privacy–security trade-offs and deployment strategies across application domains. Parameter-efficient fine-tuning (PEFT) methods such as Low-Rank Adaptation (LoRA) yield 2–10<span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>×</mo>\u0000 </mrow>\u0000 <annotation>$$ times $$</annotation>\u0000 </semantics></math> speedups while retaining 95%–99% of baseline accuracy and reducing trainable parameters by about 90%. Knowledge distillation and domain-specific fine-tuning deliver 1.5–3.5<span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>×</mo>\u0000 </mrow>\u0000 <annotation>$$ times $$</annotation>\u0000 </semantics></math> speedups with 85%–95% task accuracy, while quantization reduces model size by 50%–75% and achieves 2–4<span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>×</mo>\u0000 </mrow>\u0000 <annotation>$$ times $$</annotation>\u0000 </semantics></math> inference speedups with 85%–95% accuracy retention. Across benchmarks, fine-tuned SLMs attain 85%–90% accuracy on domain-specific tasks at only 10%–25% of LLM computational costs, though substantial gaps remain in complex reasoning (e.g., GPT-4: 92.13% vs. CodeT5-Large: 57.58%). Privacy analysis shows locally deployed SLMs achieve higher privacy and security scores, with healthcare, legal and IoT implementations often exceeding 9.0/10. Dataset analysis indicates that well-curated 1–50 GB domain corpora can offset smaller model capacity, with data quality outweighing volume and imbalance mitigation yielding 10%–25% gains in low-resource settings. Mobile and edge studies show LoRA plus quantization reduce latency from 500 to 50 ms, enabling 95% + efficiency gains for privacy-preserving, resource-constrained AI.</p>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 8","pages":""},"PeriodicalIF":3.4,"publicationDate":"2026-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/exsy.70331","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148274750","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}
Expert SystemsPub Date : 2026-05-28DOI: 10.1111/exsy.70288
Qiang Fu, Yuefeng Li, Xiaohui Tao, Jianming Yong
{"title":"Discover Class-Based Feature Distribution by Encoding Discrete Data for Classification","authors":"Qiang Fu, Yuefeng Li, Xiaohui Tao, Jianming Yong","doi":"10.1111/exsy.70288","DOIUrl":"https://doi.org/10.1111/exsy.70288","url":null,"abstract":"<p>The self-organisation map is an unsupervised learning technique that discovers patterns and relationships in data without requiring labelled training data. Inspired by the self-organisation map, Self-Organised Granular encoding has been shown to be effective for generating reliable discrete data clustering results as it is a data encoding technique that uses fuzzy sets and granularity to handle uncertain and imprecise information within discrete data. However, it is mainly useful for unsupervised learning, and its feasibility for supervised learning has not yet been studied. Also, discrete data classification is still under-researched. This paper proposes a new discrete data classification method called Transposed Fuzzy Class Granular classification. This method aims to transform discrete data into fuzzy partitions by considering all available classes and generating representations of the trained class's Transposed Fuzzy Class Granular distribution by measuring the total divergence from the average of each fuzzy class's membership degree distribution. The paper introduces a novel approach to discrete data classification by adapting class granules for classification and improving performance by tackling uncertainty, ambiguity, and the unique characteristics of discrete datasets. The study examined seven discrete datasets and compared their performance with eight commonly used classifiers as the baseline. These datasets were naturally discrete or created by discrete partitions of real datasets. The experimental results demonstrate that the proposed classifier outperforms the baseline classifiers in discrete data classification.</p>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 7","pages":""},"PeriodicalIF":2.3,"publicationDate":"2026-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/exsy.70288","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148174849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Machine Learning-Based Loan Approval Automation: Enhancing Efficiency, Accuracy and Fairness in Credit Decision-Making","authors":"Mani Ghahremani, Hellen Amimo Otieno, Mishanil Kazreen, Stavros Shiaeles","doi":"10.1111/exsy.70307","DOIUrl":"https://doi.org/10.1111/exsy.70307","url":null,"abstract":"<p>Traditional loan approval processes are manual, time-consuming and susceptible to human bias. This research develops a machine learning-based system to automate loan eligibility assessment while enhancing efficiency, accuracy and fairness in credit decision-making. We developed and compared multiple supervised ML models—including Random Forest, XGBoost, stacking and voting ensembles—on a publicly available loan dataset (614 instances, 13 features). To address class imbalance (68.7% approved, 31.3% rejected), we applied the Synthetic Minority Over-sampling Technique (SMOTE). Hyperparameter tuning was performed using GridSearchCV with 5-fold cross-validation, optimising for F1-score. Model performance was evaluated using accuracy, precision, recall, F1-score and Area Under the Curve (AUC). Both Local Interpretable Model-Agnostic Explanations (LIME) and SHapley Additive exPlanations (SHAP) were applied to ensure transparency. A tuned Random Forest classifier achieved the best performance with an accuracy of 85.96%, F1-score of 87.17% and recall of 95.32%, outperforming XGBoost and ensemble methods. Cross-dataset validation on the Statlog German Credit dataset (1000 instances, 20 features) confirmed the framework's generalisability, with comparable AUC values (0.90 vs. 0.91). Overfitting analysis confirms moderate generalisation gaps, and a gender-based fairness evaluation shows all models exceed the 0.80 disparate impact threshold. This study demonstrates that a systematic framework combining rigorous hyperparameter tuning, class imbalance handling and explainable AI can create accurate, transparent and equitable loan approval systems, providing a practical blueprint for responsible AI deployment in credit decision-making.</p>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 7","pages":""},"PeriodicalIF":2.3,"publicationDate":"2026-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/exsy.70307","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148167021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"UADC: Uncertainty-Aware Diverse Co-Training for Semi-Supervised Medical Image Segmentation","authors":"Tengfei Zhao, Weiyan Tong, Zhixiao Wang, Chong Fu, Cheng Gao","doi":"10.1111/exsy.70298","DOIUrl":"https://doi.org/10.1111/exsy.70298","url":null,"abstract":"<div>\u0000 \u0000 <p>In semi-supervised segmentation, deep co-training has emerged as a promising paradigm by utilizing prediction agreement and unlabelled-data-driven supervisory signals. Despite its effectiveness, insufficient diversity between the collaborating models often causes them to become highly consistent at an early stage, weakening the benefit of mutual learning and eventually making the framework behave similarly to self-training. In an effort to postpone this premature convergence, different initial perturbations were incorporated, but unfortunately, this resulted in a decrease in the quality of the model's pseudo-labels, which further deteriorated the model's performance. To tackle this issue, we propose an Uncertainty Aware and Diverse Co-training model (UADC) which is in line with the essential postulates of co-training. The model features a novel co-training framework working in hybrid spatial-frequency domain. Specifically, after revisiting the basic hypotheses of co-training, we devise a novel multi-view training approach that addresses the issues of dependency and role inequality inherent in traditional methods. Targeting the misconceptions in previous co-training architectures, we incorporate Segformer and frequency domain training to decouple and thereby counteract the tendency towards self-training degeneration during later training stages. Furthermore, to enhance the quality of pseudo-labels, we delve into the impact of uncertainty on model performance. We alter the structure of the model, designing a method grounded in the epistemic uncertainty of the segmentation model to optimize the quality of pseudo labels. We conduct extensive experiments on three public medical datasets of ISIC, Kvasir and CVC-ClinicDB, and compared our model with other state-of-the-art approaches, demonstrating its effectiveness and competitive performance.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 7","pages":""},"PeriodicalIF":2.3,"publicationDate":"2026-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148174845","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}
Expert SystemsPub Date : 2026-05-28DOI: 10.1111/exsy.70311
Mohyminul Islam, Ali Turab, Farhan Ullah
{"title":"PAACGAN: Protocol-Aware Generative Augmentation for Robust Imbalanced Network Intrusion Detection","authors":"Mohyminul Islam, Ali Turab, Farhan Ullah","doi":"10.1111/exsy.70311","DOIUrl":"https://doi.org/10.1111/exsy.70311","url":null,"abstract":"<div>\u0000 \u0000 <p>Class imbalance remains a major challenge in network intrusion detection because rare attack classes are substantially underrepresented relative to benign traffic and frequent attack categories. This imbalance biases learning algorithms towards majority classes and reduces detection performance on critical minority attacks. To address this problem, we propose PAACGAN, a Protocol-Aware Auxiliary Classifier Generative Adversarial Network for minority-class augmentation in intrusion detection. The proposed model incorporates protocol-aware conditioning based on TCP/UDP characteristics, destination port distributions, and class-specific traffic statistics so that generated samples preserve both class identity and protocol-level consistency. The augmented training data are then used to train an XGBoost classifier for intrusion detection. Experiments on the NSL-KDD and CICIDS2017 benchmark datasets show that the proposed framework improves recall and F1-score for minority classes. On the rarest CICIDS2017 attack categories, including <i>Infiltration</i> and <i>Heartbleed</i>, the proposed method achieves an F1-score improvement of up to 12.57 percentage points. These results show that protocol-aware generative augmentation is effective for improving rare-attack detection under severe data imbalance.</p>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":"43 7","pages":""},"PeriodicalIF":2.3,"publicationDate":"2026-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148167022","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}