Applied Intelligence最新文献

{"title":"Towards identification and explainable localization of slopes in autonomous excavation: a feature fused CAM approach","authors":"Xinrui Zou,&nbsp;Ziwei Wang,&nbsp;Yancheng Song,&nbsp;Liangjiu Jia,&nbsp;Gangju Wang,&nbsp;Guangjun Liu","doi":"10.1007/s10489-025-06881-9","DOIUrl":"10.1007/s10489-025-06881-9","url":null,"abstract":"<div><p>Autonomous earthmoving requires excavators to identify and localize slopes within complex environments while operating with limited computational resources. To address this challenge, we propose an explainable localization method that leverages the explainability of machine learning (ML) models for slope identification and localization, which also guides the excavator in optimal digging point determination. Our approach integrates a modified residual neural network with joint features derived from Class Activation Mapping (CAM), enhanced through transfer learning to fine-tune a pre-trained model for the target task. Evaluations on public SODA dataset demonstrate significant improvements in localization performance, with a 45.6% increase in the Intersection over Union (IoU) metric compared to the original CAM. Further performance gains are observed when preprocessing based on identification precedes localization, with IoU improving by over 70%. Furthermore, we constructed a few-shot slope dataset to validate the method’s efficacy under low-cost and resource-constrained conditions. The results indicate that our approach enables continuous explainable localization, effectively guiding an unmanned excavator in autonomous earthmoving. The proposed approach proves highly practical for engineering applications, addressing the challenges of large-scale datasets and high computational resource demands, thereby providing an effective technical pathway for applying ML methods to the automation of construction machinery.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 15","pages":""},"PeriodicalIF":3.5,"publicationDate":"2025-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145256101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Efficient relational context perception for knowledge graph completion","authors":"Wenkai Tu,&nbsp;Guojia Wan,&nbsp;Zhengchun Shang,&nbsp;Bo Du","doi":"10.1007/s10489-025-06902-7","DOIUrl":"10.1007/s10489-025-06902-7","url":null,"abstract":"<div><p>Knowledge Graphs (KGs) provide a structured representation of knowledge but often suffer from challenges of incompleteness. To address this, link prediction or knowledge graph completion (KGC) aims to infer missing new facts based on existing facts in KGs. Previous knowledge graph embedding models are limited in their ability to capture expressive features, especially when compared to deeper, multi-layer models. These approaches also assign a single static embedding to each entity and relation, disregarding the fact that entities and relations can exhibit different behaviors in varying graph contexts. Due to complex context over a fact triple of a KG, existing methods have to leverage complex non-linear context encoder, like transformer, to project entity and relation into low dimensional representations, resulting in high computation cost. To overcome these limitations, we propose the Triple Receptance Perception (TRP) architecture–an attention-free and lightweight encoder inspired by RWKV–that models sequential dependencies to capture the dynamic contextual semantics of entities and relations. Then we use Tucker tensor decomposition to calculate triple scores, providing robust relational decoding capabilities. This integration allows for more expressive representations. Experiments on benchmark datasets such as YAGO3-10, UMLS, FB15k, and FB13 in link prediction and triple classification tasks demonstrate that our method performs better than several state-of-the-art models, proving the effectiveness of the integration.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 15","pages":""},"PeriodicalIF":3.5,"publicationDate":"2025-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145256332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"GPSP-CLIP: learning generic pseudo-state prompts for flexible zero-shot anomaly detection","authors":"Weiyu Hu,&nbsp;Shubo Zhou,&nbsp;Yongbin Gao,&nbsp;Xue-Qin Jiang","doi":"10.1007/s10489-025-06843-1","DOIUrl":"10.1007/s10489-025-06843-1","url":null,"abstract":"<div><p>Large-scale foundation models such as Contrastive Language-Image Pre-training (CLIP) have shown great potential in zero-shot anomaly detection (ZSAD) task, allowing a single model to generalize to unseen categories without fine-tuning on specific classes. However, existing ZSAD methods often rely on rigid prompt designs, which makes them difficult to adapt to the diverse characteristics of industrial products. Additionally, the need to manually define category-specific and state-specific prompts limits their scalability and generalization. This paper proposes a generic pseudo-state prompting model based on CLIP (<i>GPSP-CLIP</i>) to address these challenges. The motivation behind <i>GPSP-CLIP</i> is to develop a flexible prompting method capable of representing normal and anomalous conditions across various applications without relying on predefined text prompts. Technically, <i>GPSP-CLIP</i> employs fully learnable parameters to generate broad, pseudo-state text features, enabling generalization across different industrial contexts. By employing distinct prompt learning strategies for anomaly classification and segmentation, <i>GPSP-CLIP</i> optimizes each task independently. This enables the model to effectively capture high-level semantics through global prompts while identifying fine-grained defect patterns via local prompts. Experimental results on the well-known MVTec and VisA datasets demonstrate improved performance, with a 1.8% improvement in AP for anomaly classification and a 1.3% gain in AUPRO for anomaly segmentation compared to state-of-the-art methods.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 15","pages":""},"PeriodicalIF":3.5,"publicationDate":"2025-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145256335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"AI-crafted narratives: an empirical study on generating interactive stories using generative pre-training transformers","authors":"Ana Carolina de Souza Mendes,&nbsp;Mason Adsero,&nbsp;Joshua Palicka,&nbsp;Nurulla Zholdoshov,&nbsp;Xin Zhao","doi":"10.1007/s10489-025-06833-3","DOIUrl":"10.1007/s10489-025-06833-3","url":null,"abstract":"<div><p>Interactive storytelling, which has long captivated audiences, is embracing evolution. Dungeons &amp; Dragons, a timeless example of open-ended interactive storytelling, has entered the digital realm, with platforms such as AI Dungeon employing large-language models to enhance the experience. Amid the growing utilization of Chat-GPT and concerns regarding AI’s potential to replace jobs, this empirical study examines the capability of GPT-3.5 and GPT-4 to autonomously generate an engaging interactive narrative, alongside the necessary Twine code for compiling the story. To assess the quality of the generated story, user perceptions of its authorship, and its future, an accompanying survey was conducted. The result shows that even though some concerns arise regarding authorship, AI is promising in the field of generating interactive stories.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 15","pages":""},"PeriodicalIF":3.5,"publicationDate":"2025-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145256562","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Real-time task scheduling strategy for 3D printing cloud platforms in health scenes","authors":"Jianjia He,&nbsp;Jian Wu,&nbsp;Jingran Ni,&nbsp;Yuning Zhang,&nbsp;Keng Leng Siau","doi":"10.1007/s10489-025-06907-2","DOIUrl":"10.1007/s10489-025-06907-2","url":null,"abstract":"<div><p>In health scenes, 3D Printing Cloud Platform (3DPCP) needs to cope with unpredictable fluctuations in tasks and resources, but traditional scheduling methods have problems such as incomplete consideration of factors, poor optimization, and weak dynamic adaptability, which make it difficult to meet real-time scheduling requirements. To this end, the real-time task scheduling problem of 3DPCP for health scenes is defined, a real-time task scheduling model is established, the design time of user personalized services is considered, a rescheduling scheme is designed in combination with task variations and device variations, and a scheduling strategy that incorporates dynamic mechanisms and improved multi-objective greywolf optimization algorithms is proposed in order to minimize the integrated scheduling cost and the average delivery time of the product. The findings of simulation experiments show that when equipment changes are not considered, compared with the optimal heuristic algorithm in this field, the average cost of the proposed algorithm is reduced by 2014.1 yuan, and the average delivery time is shortened by 1.52 h. When equipment changes are considered, compared with the multi-objective Genetic Algorithm Dynamic Strategies (GADS), the average cost of the proposed algorithm is reduced by 2984.57 yuan, and the average delivery time is shortened by 0.39 h, which validates the effectiveness of the proposed method.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 15","pages":""},"PeriodicalIF":3.5,"publicationDate":"2025-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Research on full lifecycle health management of permanent magnet synchronous electric drum driven by digital twin with dynamic update","authors":"Wei Chen,&nbsp;Weimin Wu,&nbsp;Mei Zhang,&nbsp;Huashun Li,&nbsp;Qing Shi","doi":"10.1007/s10489-025-06910-7","DOIUrl":"10.1007/s10489-025-06910-7","url":null,"abstract":"<div><p>Currently, research on fault Prognostics and Health Management (PHM) based on Digital Twin mainly focuses on integrating real-time data from various sources to facilitate comprehensive product inspection and health management. However, existing DT research faces three main theoretical bottlenecks: the lack of dynamic evolution mechanisms in multi-physics coupled modeling, static models’ difficulty in adapting to the drift of equipment degradation characteristics, and health status assessment’s reliance on prior fault samples. To address these issues, this paper proposes a comprehensive lifecycle dynamic management method for the Tubular Permanent Magnet Synchronous Electric Drum (TPMSED), by constructing a Dual-service Lifecycle Management Digital Twin Model (DSL-DT) that achieves deep integration of physical entities and virtual spaces. Firstly, a multi-physics coupled dynamic model is established, integrating the nonlinear interactions of electromagnetic fields, temperature fields, and dynamic fields. This is achieved through a combination of finite element simulation and data-driven approaches, addressing the challenge of characterizing equipment performance degradation under complex operating conditions. Secondly, an innovative dual dynamic adjustment mechanism for compensator updates and parameter updates is designed, utilizing ridge regression algorithms and adaptive gradient algorithms to achieve online optimization of model parameters, effectively suppressing model mismatch during the degradation process. Lastly, a health index (HI)-based state assessment method is proposed, which triggers model updates by comparing characteristic deviations with thresholds, significantly enhancing the accuracy of Remaining Useful Life (RUL) predictions. Experimental validation on an intelligent conveying system development platform demonstrates that this method can accurately track the performance evolution of equipment throughout its lifecycle, providing a new theoretical paradigm and technical pathway for health management of complex electromechanical systems.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 15","pages":""},"PeriodicalIF":3.5,"publicationDate":"2025-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A 3D efficient and essentialized swin transformer network for alzheimer’s disease diagnosis","authors":"Shengchao Huang,&nbsp;Qun Dai","doi":"10.1007/s10489-025-06884-6","DOIUrl":"10.1007/s10489-025-06884-6","url":null,"abstract":"<div><p>Deep learning methods (e.g., convolutional neural networks, CNNs) have been widely applied to Alzheimer’s disease diagnosis based on structural magnetic resonance imaging (sMRI) data. However, CNN-based methods face significant Limitations in capturing the global feature distribution of the whole brain. Transformer-based models have shown promise in addressing this issue, but they often sacrifice local feature sensitivity. Moreover, the large number of parameters in Transformer-based models results in a strong dependence on large-scale datasets, which is difficult to satisfy in real-world 3D medical imaging scenarios. Through comprehensive consideration, we propose a 3D Efficient and Essentialized Swin Transformer Network (E2STN) to strike a balance between being lightweight and comprehensive feature extraction, thereby boosting Alzheimer’s disease diagnosis performance in 3D dataset scenarios. Specifically, E2STN includes four modules: an Efficient Swin Transformer (EST) module for identifying global structural information and being lightweight to reduce reliance on large-scale datasets, which is a novel task-oriented Transformer architecture; a Focused Feature Enhancement Convolution Unit (FFE-CU) for enhancing lesion details, thereby compensating for the limited perception of fine-grained pathological information by the Transformer; a Disease Risk Map generator (DRMg) for visualizing pathological regions; and an ROI-based classifier for precise categorization. Our proposed method has been validated by two diagnosis tasks (i.e., Alzheimer’s disease diagnosis and mild cognitive impairment conversion prediction) on the ADNI dataset. Compared to several state-of-the-art methods, our model demonstrates superior performance.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 15","pages":""},"PeriodicalIF":3.5,"publicationDate":"2025-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Feature selection based on information entropy with variable precision fuzzy mixed granularity","authors":"Jiaxin Wang,&nbsp;Jingqian Wang,&nbsp;Xiaohong Zhang,&nbsp;Jun Liu","doi":"10.1007/s10489-025-06890-8","DOIUrl":"10.1007/s10489-025-06890-8","url":null,"abstract":"<div><p>Fuzzy rough set theory allows defining different fuzzy relationships for different attribute types to quantify the similarity between objects. Meanwhile, information entropy, a powerful tool for quantifying uncertainty, is further extended within this framework to fuzzy rough set-based information entropy. The granularity division of traditional fuzzy entropy usually relies on fuzzy similarity relationships. In this paper, we first define variable precision mixed fuzzy granularity, combine it with fuzzy entropy to construct the information entropy based on variable precision mixed fuzzy granularity, and define fuzzy granularity entropy (FGe), fuzzy granularity joint entropy (FGJe), fuzzy granularity conditional entropy (FGCe), and fuzzy granularity mutual information (FGMI), and study the relationship and related properties among them. Then the importance function for evaluating the importance of features is constructed using FGMI, which lays the foundation for the feature selection (FS) algorithm. To evaluate the performance of the algorithm, numerical experiments are conducted on 15 public datasets and compared with other algorithms. The experimental results show that the method shows good adaptability and FS ability for handling different types of data.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 15","pages":""},"PeriodicalIF":3.5,"publicationDate":"2025-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Question answering system based on the combination of large language model and knowledge graph","authors":"Jihong Wang,&nbsp;Yichen Zhang,&nbsp;Wei Liu","doi":"10.1007/s10489-025-06828-0","DOIUrl":"10.1007/s10489-025-06828-0","url":null,"abstract":"<div><p>In recent years, large language models (LLMs) have achieved remarkable progress in natural language processing. However, their application in question-answering systems continues to face challenges such as insufficient credibility and interpretability of responses, as well as high computational resource demands. To address these issues, this paper proposes a question-answering system that integrates knowledge graphs with lightweight LLMs. Specifically, a lightweight front-end model based on BERT and T5 is employed to extract and transform logical forms from natural language queries, which are then executed on a knowledge graph. Subsequently, a smaller-scale LLM generates credible and interpretable answers based on these query results. Experimental results show that the proposed method achieves F1 scores of 75.6% and 76.8% on the WebQSP and GRAILQA datasets, respectively, surpassing other representative approaches. Furthermore, integrating the extracted knowledge with the ChatGLM-6B model significantly improves answer quality, increasing ratings by 112.8% for simple questions and 77.4% for complex questions, thus validating the effectiveness of our approach.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 15","pages":""},"PeriodicalIF":3.5,"publicationDate":"2025-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Three-way density peak clustering in incomplete information systems","authors":"Zhao Li,&nbsp;Ju-sheng Mi,&nbsp;Lei-jun Li","doi":"10.1007/s10489-025-06911-6","DOIUrl":"10.1007/s10489-025-06911-6","url":null,"abstract":"<div><p>The absence of data in the information systems will result in uncertainty in the classification of objects, and the fringe region of the cluster in the three-way clustering reflects the uncertainty of the clustering results, which can fit the incomplete information system well. Consequently, this paper proposes a three-way clustering framework in incomplete information systems, drawing on the density peak clustering algorithm and the model of three-way decision. Firstly, this paper defines the reflexive binary relation in incomplete information systems and determines the center of the corresponding object class. Then, the density peak clustering algorithm is utilized to identify the optimal clustering centers among all object class centers. Subsequently, the membership degree and relative loss function matrix of the object under each cluster center are defined according to the distance relationship between each object and all cluster centers. Finally, the clustering rules are obtained by the minimum risk decision theory, and the initial clustering results are processed to meet the three-way clustering criteria. In the experimental section of this paper, two sets of experiments are designed to show the clustering accuracy of the proposed algorithm and the influence of parameters on the clustering results.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 15","pages":""},"PeriodicalIF":3.5,"publicationDate":"2025-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210467","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}