International Journal of Intelligent Systems最新文献

Artificial intelligence (AI) systems are increasingly adopted in high-stakes domains such as healthcare and finance, so the demand for transparency and interpretability has grown substantially. EXplainable AI (XAI) methods have emerged to address this challenge, but individual techniques often offer limited, fragmented insights. This paper introduces Meta-explainers, a novel ensemble-based XAI framework that integrates multiple explanation types—specifically relevance-based and counterfactual methods—into unified, multifaceted and complementary meta-explanations. Inspired by meta-classification principles, our approach structures the explanation process into five stages: generation, grouping, evaluation, aggregation, and visualization. Each stage is designed to preserve the unique strengths of individual XAI techniques while enhancing their interpretability and coherence when combined. Experimental results on both image (MNIST) and tabular (Breast Cancer) datasets show that Meta-explainers consistently outperform individual and state-of-the-art ensemble explanation methods in terms of explanation quality, as measured by established metrics. This work paves the way toward more holistic and user-centered AI explainability with a flexible methodology that can be extended to incorporate additional explanation paradigms.

This paper introduces a cost-effective prompt optimization strategy for ancient Chinese word segmentation using large language models, aiming to mitigate the substantial computational resources and training expenses of fine-tuning. We developed two knowledge-enhanced frameworks, a General Knowledge Prompt framework and a Domain-Specific Knowledge Prompt framework, and evaluated their effectiveness across various ancient Chinese corpora using seven mainstream LLMs, including ERNIE Bot, Qwen, SparkDesk, DeepSeek, ChatGPT, Gemini, and Copilot. Our findings confirm that both prompt frameworks enhance the segmentation capability of LLMs to varying extents, with the Domain-Specific Knowledge Prompt framework yielding the most significant improvements. Notably, the DeepSeek model achieves 94.01% F1 score (94.24% precision, 93.79% recall) on the test set, while the Qwen model demonstrates a remarkable 15.73% increase in the F1 score with the Domain-Specific Knowledge Prompt framework. Our ablation studies indicate that the entries Rules and Examples are the most crucial to the success of prompt frameworks, effectively addressing the challenges of rule inconsistency and insufficient annotated data.

With the rise of neural networks and pre-trained models such as BERT, abstractive text summarization techniques have received widespread attention. Nevertheless, traditional extractive text summarization methods still hold substantial research value due to their low computational cost, interpretability, and robustness. In algorithms like TextRank and its variants, graph nodes are typically constructed based on surface-level lexical features. These graphs often fail to incorporate many contextual relationships, such as coreference relationships among nodes, resulting in fragmented representations of key concepts. For edge construction, a sliding window of size T is commonly used to connect word nodes within the window. However, these methods often fall short in modeling the rich contextual dependencies embedded in the document. Several recent studies have demonstrated that semantic graphs can effectively improve the accuracy of text summarization. In this paper, we construct a more interpretable semantic graph from syntax trees and propose a novel unsupervised algorithm based on the personalized PageRank algorithm for summary extraction. We utilize tree transformation methods to enrich word-level information for graph construction, define node-merging rules to reduce graph complexity, use coreference chains to merge coreferring entities across sentences for enriching contextual links, and introduce the concept of Meta Node sets to capture thematic relationships that are not fully represented by syntactic dependencies or coreference chains alone. By clustering semantically related words, Meta Nodes enhance the graph’s ability to reflect deeper contextual coherence across the document. Compared with previous TextRank-based methods, our improvement yields significant ROUGE score boosts on the CNN-DM dataset. While the method was developed and evaluated using English-language datasets, its underlying design is language agnostic and can be adapted to other languages with suitable linguistic tools.

Brain tumors account for approximately 2.5% of cancer-related deaths. Accurate classification of brain tumor types is essential for timely diagnosis and enhancing survival rates. Convolutional neural networks (CNNs) have demonstrated state-of-the-art performance in computer-aided diagnosis of brain tumors; however, the quality and availability of medical data significantly influence this process. Medical data must adhere to stringent privacy regulations, such as the General Data Protection Regulation (GDPR) in the European Union and the Health Insurance Portability and Accountability Act (HIPAA) in the United States. Federated learning (FL) enables the sharing of only model update parameters during collaborative training on locally stored data. However, these parameters may inadvertently enable reconstruction of the original data. Furthermore, medical data often exhibit nonindependent and nonidentically distributed (non-IID) characteristics, impeding model training performance. To address these challenges, this paper proposes a scheme that partitions confidential data into multiple segments during FL training, ensuring that only a subset exceeding a predefined threshold can reconstruct the data. The proposed scheme guarantees enhanced security, distributed control, and fault tolerance. In addition, this paper introduces a Conditional Mutual Information (CMI) regularizer to mitigate variability in model predictions. By minimizing the Kullback–Leibler (KL) divergence between local and global feature distributions, the CMI regularizer substantially enhances performance and convergence stability. Extensive experiments conducted on the Figshare dataset with varying α-values for data distributions validate the efficacy of the proposed model. Compared to FedAvg, FedProx, and FedDyn at α = 0.3, as well as the central model, the proposed model achieves a top-1 accuracy of 92.94% on the Figshare dataset, surpassing FedProx, FedAvg, and FedDyn by 2.42%, 2.82%, and 3.53%, respectively. Federated IID achieves performance comparable to that of the central model, further demonstrating its viability for practical applications.

Because of the copyright issues of hyperspectral images continue to rise, in this paper, we propose to use a neural network–based watermarking model to protect the copyright. By applying normalization-based attention module (NAM) to deep dispersed watermarking with synchronization and fusion (DWSF), a NDWSF model is proposed for robust hyperspectral image watermarking. It consists of encoding, decoding, discrimination, and attack modules. The encoding and decoding modules are used for embedding and extracting watermarks. Discrimination module is proposed for improving the quality of watermarked image. The discrimination module and the encoding module are in an adversarial relationship to motivate the encoder to generate watermarks with stronger invisibility. Attack module is employed between embedding and extraction to improve robustness against compression and noise and geometric attacks. In order to more effectively utilize image features for watermarking, a kind of hybrid attention mechanism is employed in embedding and extraction by adding NAM. Experimental results show that the loss convergence and stability in training is improved. The peak signal-to-noise ratio of the proposed method is 48.08 dB, higher than other methods about 2.5 dB. The bit error rate of the proposed method is less than 2.5% for various hybrid attacks, showing good robustness.

The pathological development of abnormal blood vessels results in neovascularization as a major vision-threatening condition of diabetic retinopathy. The main factor behind pathological vessel growth results from retinal capillary depletion of oxygen that causes abnormal vascular development patterns. Early detection of these fundus image abnormalities requires precision because it enables ophthalmologists to provide effective treatment and make proper diagnoses. A multiple-step image processing system treats this problem. A fusion-based contrast enhancement method begins the process of enhancing diabetic retinopathy fundus image brightness and contrast. After the initial process, the system applies detail weighted histogram equalization to the green channel for better structural detail visualization. In the second stage, the proposed online tiger-claw algorithm segments abnormal neovascularization from normal blood vessels. Next, the combination of fuzzy zone-based clustering with optimization and classifier thresholding performs local identification along with highlight generation for neovascularized areas. Neovascularization detection makes use of a YOLOv5 neural network in the third stage through feature extraction and classification operations. A refined segmentation process occurs with the application of multistage gray wolf optimization. The proposed algorithm underwent testing through its application to the public datasets STARE, DRIVE, MESSIDOR, and DIARETDB1. Experimental tests indicate that the neovascularization region marking performed with 98.19% sensitivity and 96.56% specificity while reaching 99.27% accuracy. The proposed approach demonstrates 97.03% accuracy and 98.94% sensitivity, together with 97.17% specificity in neovascularization detection.

As autonomous driving (AD) systems grow more complex, their rising computational demands pose significant energy and sustainability challenges. This paper investigates spiking neural networks (SNNs) as low-power alternatives to convolutional neural networks (CNNs) for regression tasks in AD. We introduce a membrane-potential (V_mem) decoding framework that converts binary spike trains into continuous outputs and propose the energy-to-error ratio (EER), a unified metric combining prediction error with energy consumption. Three CNN architectures (PilotNet, LaksNet, and MiniNet) and their corresponding SNN variants are trained and evaluated using delta, latency, and rate encoding across varied parameter settings, with energy use and emissions logged. Delta-encoded SNNs achieve the highest EER, substantial energy savings with minimal performance loss, whereas CNNs, despite slightly better MSE, incur 10–20 × higher energy costs. Rate encoding underperforms, and latency encoding, though improving relative error, demands excessive energy. Parameter tuning (threshold θ, temporal dynamics (S), membrane time constant (τ), and gain G) directly influences eco-efficiency. All experiments run on standard GPUs, showing SNNs can surpass CNNs in eco-efficiency without specialized hardware. Paired statistical tests confirm that only delta-encoded SNNs achieve significant EER improvements. This work presents a practical, energy-aware evaluation framework for neural architectures, establishing EER as a critical metric for sustainable machine learning in intelligent transport and beyond.

Federated learning (FL) is a distributed and privacy-preserving machine learning paradigm that coordinates multiple clients to train a model while keeping the raw data localized. However, this traditional FL poses some challenges, including privacy risks, data heterogeneity, communication bottlenecks, and system heterogeneity issues. To tackle these challenges, knowledge distillation (KD) has been widely applied in FL since 2020. KD is a validated and efficacious model compression and enhancement algorithm. The core concept of KD involves facilitating knowledge transfer between models by exchanging logits at intermediate or output layers. These properties make KD an excellent solution for the long-lasting challenges in FL. Up to now, there have been few reviews that summarize and analyze the current trend and methods for how KD can be applied in FL efficiently. This article aims to provide a comprehensive survey of KD-based FL, focusing on addressing the above challenges. First, we provide an overview of KD-based FL, including its motivation, basics, taxonomy, and a comparison with traditional FL and where KD should execute. We also analyze the critical factors in KD-based FL in the Appendix, including teachers, knowledge, data, and methods. We discuss how KD can address the challenges in FL, including privacy protection, data heterogeneity, communication efficiency, and personalization. Finally, we discuss the challenges facing KD-based FL algorithms and future research directions. We hope this survey can provide insights and guidance for researchers and practitioners in the FL area.

Effective health monitoring of electrical equipment is critical for industrial reliability. Although infrared thermal imaging offers a powerful noncontact diagnostic method, accurately interpreting its complex and often noisy thermal patterns remains a significant challenge. Entropy-based analysis is well suited for quantifying this complexity, but its application to images has been limited. Existing two-dimensional entropy methods are not only less developed than their one-dimensional counterparts but also typically require converting thermal images to grayscale, which discards vital diagnostic information from color channels. To overcome these limitations, this study introduces the modified multiscale two-dimensional color distribution entropy (MMCDEn_2D). This novel method directly integrates the attributes of the RGB, preserving a richer feature set for analysis. The effectiveness of the proposed method is demonstrated first through synthetic signals, showing low sensitivity to image size and high computational efficiency. The study further extends the application of entropy-based analysis to noncontact health monitoring scenarios, implementing MMCDEn_2D for thermal image-based fault diagnosis of induction motors and power transformers. The method achieves a diagnostic accuracy that exceeds 95%, significantly outperforming traditional approaches. Crucially, it demonstrates superior robustness in challenging scenarios, improving accuracy by 2%–5% under high-noise conditions and with small sample sizes. These results establish MMCDEn_2D as a highly effective and reliable tool to advance noncontact fault diagnosis in critical electrical equipment.

Traffic accident prediction serves as a cornerstone of intelligent transportation systems, enabling proactive city-wide control strategies and public safety interventions. Effective models must capture the evolving spatiotemporal propagation of risk while addressing heterogeneous data distributions across urban regions. Current approaches face significant limitations: fixed graph topologies fail to represent nonstationary accident patterns, while uniform task weighting leads to optimization bias toward data-rich areas, ultimately constraining adaptability in adjacency construction and multihop spatial reasoning. To address these challenges, we propose a dynamic multidiffusion graph network with multitask learning (DiffG-MTL) for city-scale accident prediction. Specifically, a dynamic diffusion adjacency generation (DDAG) module constructs time-varying, diffusion-based adjacency matrices through multiple propagation pathways. A multiscale graph structure learning (MGSL) module captures multihop spatial relationships and temporal cues, while effectively highlighting anomalous traffic behaviors. To alleviate regional data imbalance, we introduce a dynamic multitask learning objective that adaptively redistributes learning focus using recall-aware weighting and task-level normalization. Comprehensive evaluations on six widely used datasets demonstrate that DiffG-MTL consistently outperforms state-of-the-art baselines across multiple evaluation metrics. Additional experiments validate its robustness and effectiveness in modeling complex spatiotemporal accident patterns.