首页 > 最新文献

Applied Intelligence最新文献

英文 中文
Comparative performance analysis of quantum machine learning architectures for credit card fraud detection 用于信用卡欺诈检测的量子机器学习架构的比较性能分析
IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-11 DOI: 10.1007/s10489-026-07110-7
Mansour El Alami, Nouhaila Innan, Muhammad Shafique, Mohamed Bennai

As financial fraud becomes increasingly complex, effective detection methods are essential. Quantum Machine Learning (QML) introduces certain capabilities that may enhance both accuracy and efficiency in this area. This study examines how different quantum feature maps and ansatz configurations affect the performance of three QML-based classifiers, the Variational Quantum Classifier (VQC), the Sampler Quantum Neural Network (SQNN), and the Estimator Quantum Neural Network (EQNN), when applied to two non-normalized financial fraud datasets. Different quantum feature map and ansatz configurations are evaluated, revealing distinct performance patterns. The VQC consistently demonstrates strong classification results, achieving an F1-score of 0.88, while the SQNN also delivers promising outcomes. In contrast, the EQNN struggles to produce robust results, emphasizing the challenges presented by non-standardized data. Statistical validation using ANOVA confirms the significance of observed performance differences. Additionally, robustness tests on the best-performing models under five quantum noise types show that they maintain competitive performance, supporting their practical applicability. These findings highlight the importance of careful model configuration in QML-based financial fraud detection. By showing how specific feature maps and ansatz choices influence predictive success, this work guides researchers and practitioners in refining QML approaches for complex financial applications.

随着财务欺诈变得越来越复杂,有效的检测方法是必不可少的。量子机器学习(QML)引入了某些功能,可以提高该领域的准确性和效率。本研究考察了不同的量子特征映射和ansatz配置如何影响三种基于qml的分类器,变分量子分类器(VQC),采样器量子神经网络(SQNN)和估计器量子神经网络(EQNN)在应用于两个非规范化金融欺诈数据集时的性能。评估了不同的量子特征映射和ansatz配置,揭示了不同的性能模式。VQC一直表现出很强的分类结果,达到了0.88的f1分,而SQNN也提供了很好的结果。相比之下,EQNN难以产生稳健的结果,强调了非标准化数据带来的挑战。使用方差分析的统计验证证实了观察到的性能差异的显著性。此外,对五种量子噪声类型下表现最佳的模型进行鲁棒性测试表明,它们保持了竞争性能,支持了它们的实际适用性。这些发现强调了在基于qml的金融欺诈检测中仔细配置模型的重要性。通过展示特定的特征图和分析选择如何影响预测成功,这项工作指导研究人员和实践者为复杂的金融应用程序改进QML方法。
{"title":"Comparative performance analysis of quantum machine learning architectures for credit card fraud detection","authors":"Mansour El Alami,&nbsp;Nouhaila Innan,&nbsp;Muhammad Shafique,&nbsp;Mohamed Bennai","doi":"10.1007/s10489-026-07110-7","DOIUrl":"10.1007/s10489-026-07110-7","url":null,"abstract":"<div><p>As financial fraud becomes increasingly complex, effective detection methods are essential. Quantum Machine Learning (QML) introduces certain capabilities that may enhance both accuracy and efficiency in this area. This study examines how different quantum feature maps and ansatz configurations affect the performance of three QML-based classifiers, the Variational Quantum Classifier (VQC), the Sampler Quantum Neural Network (SQNN), and the Estimator Quantum Neural Network (EQNN), when applied to two non-normalized financial fraud datasets. Different quantum feature map and ansatz configurations are evaluated, revealing distinct performance patterns. The VQC consistently demonstrates strong classification results, achieving an F1-score of 0.88, while the SQNN also delivers promising outcomes. In contrast, the EQNN struggles to produce robust results, emphasizing the challenges presented by non-standardized data. Statistical validation using ANOVA confirms the significance of observed performance differences. Additionally, robustness tests on the best-performing models under five quantum noise types show that they maintain competitive performance, supporting their practical applicability. These findings highlight the importance of careful model configuration in QML-based financial fraud detection. By showing how specific feature maps and ansatz choices influence predictive success, this work guides researchers and practitioners in refining QML approaches for complex financial applications.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"56 3","pages":""},"PeriodicalIF":3.5,"publicationDate":"2026-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147338597","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}
引用次数: 0
HyperKGLinker: A method for solving link prediction in hyper-relational knowledge graphs HyperKGLinker:一种在超关系知识图中解决链接预测的方法
IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-11 DOI: 10.1007/s10489-026-07104-5
Xiaochao Dang, Xiaoling Shu, Xiaohui Dong, Fenfang Li

Hyper-relational knowledge graphs can enhance the intelligence, efficiency, and reliability of industrial production, facilitate equipment coordination, and optimize supply chains. However, due to current data and technology limitations, the construction of knowledge graphs in the industrial domain remains imperfect. Link prediction can effectively address this issue. Therefore, this paper constructs a hyper-relational knowledge graph for mine hoists to perform link prediction tasks. In traditional triple data sets, link prediction involves masking entities or relations to predict MRR and Hits@K. Although significant progress has been made in link prediction on traditional triple data sets, research on hyper-relational data sets is still lacking. This paper proposes a new method for solving link prediction problems in hyper-relational knowledge graphs—HyperKGLinker, which specifically addresses link prediction in hyper-relational knowledge graphs. This method innovatively integrates hyper-relational text data and hyper-relational graph data. Compared to baseline models, our model shows improved predictive performance across different data sets, indicating a significant enhancement in the accuracy and efficiency of link prediction in hyper-relational knowledge graphs. Future Research Work: (1) Integrate generative large language models like GPT to further optimize and expand the self-constructed hyper-relational knowledge graph of mine hoists, thereby exploring the generalization ability of HyperKGLinker. (2) Investigate methods for model interpretability to enable users to understand the model’s prediction results and decision processes, increasing its credibility and usability.

超关系知识图可以提高工业生产的智能、效率和可靠性,促进设备协调,优化供应链。然而,由于目前数据和技术的限制,工业领域知识图谱的构建仍然不完善。链路预测可以有效地解决这一问题。为此,本文构建了矿井提升机执行链路预测任务的超关系知识图。在传统的三重数据集中,链路预测涉及屏蔽实体或关系来预测MRR和Hits@K。虽然传统三元数据集的链路预测已经取得了很大的进展,但对超关系数据集的研究还很缺乏。本文提出了一种解决超关系知识图中链接预测问题的新方法hyperkglinker,它专门解决了超关系知识图中的链接预测问题。该方法创新性地集成了超关系文本数据和超关系图形数据。与基线模型相比,我们的模型在不同数据集上显示出更好的预测性能,这表明在超关系知识图中链接预测的准确性和效率显著提高。未来研究工作:(1)整合GPT等生成式大型语言模型,进一步优化扩展矿井提升机自构建的超关系知识图,探索HyperKGLinker的泛化能力。(2)研究模型可解释性的方法,使用户能够理解模型的预测结果和决策过程,提高模型的可信度和可用性。
{"title":"HyperKGLinker: A method for solving link prediction in hyper-relational knowledge graphs","authors":"Xiaochao Dang,&nbsp;Xiaoling Shu,&nbsp;Xiaohui Dong,&nbsp;Fenfang Li","doi":"10.1007/s10489-026-07104-5","DOIUrl":"10.1007/s10489-026-07104-5","url":null,"abstract":"<div><p>Hyper-relational knowledge graphs can enhance the intelligence, efficiency, and reliability of industrial production, facilitate equipment coordination, and optimize supply chains. However, due to current data and technology limitations, the construction of knowledge graphs in the industrial domain remains imperfect. Link prediction can effectively address this issue. Therefore, this paper constructs a hyper-relational knowledge graph for mine hoists to perform link prediction tasks. In traditional triple data sets, link prediction involves masking entities or relations to predict MRR and Hits@K. Although significant progress has been made in link prediction on traditional triple data sets, research on hyper-relational data sets is still lacking. This paper proposes a new method for solving link prediction problems in hyper-relational knowledge graphs—HyperKGLinker, which specifically addresses link prediction in hyper-relational knowledge graphs. This method innovatively integrates hyper-relational text data and hyper-relational graph data. Compared to baseline models, our model shows improved predictive performance across different data sets, indicating a significant enhancement in the accuracy and efficiency of link prediction in hyper-relational knowledge graphs. Future Research Work: (1) Integrate generative large language models like GPT to further optimize and expand the self-constructed hyper-relational knowledge graph of mine hoists, thereby exploring the generalization ability of HyperKGLinker. (2) Investigate methods for model interpretability to enable users to understand the model’s prediction results and decision processes, increasing its credibility and usability. </p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"56 3","pages":""},"PeriodicalIF":3.5,"publicationDate":"2026-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147338599","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}
引用次数: 0
Simplicity meets power: robust traffic flow prediction with ST-ConvLSTMNet model 简单满足强大:ST-ConvLSTMNet模型的鲁棒交通流预测
IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-07 DOI: 10.1007/s10489-025-07062-4
Cheng Peng, Yuan Cheng, Ao Li

The increasing emphasis on traffic flow prediction in urban traffic management and planning is being driven by the continuous development of urbanization. This study aims to investigate the necessity of introducing graph structure information in data contexts with relatively simple road structures. We conduct experimental investigations to analyze the role of introducing graph structure information by comparing a graph neural network model with graph structure information and our proposed Spatial-Temporal Convolutional Long Short-Term Memory Network (ST-ConvLSTMNet) model, which is designed to capture complex spatiotemporal dependencies efficiently,​​ using six types of actual traffic data. Moreover, we analyze the application of various graph neural network models in traffic flow prediction, comparing their accuracies and computational efficiencies. Lastly, we provide a detailed explanation of the characteristics of data with relatively simple road structures and conduct further exploration of each module’s functionality through ablation studies. Codes are available at https://github.com/CC10969Peng.

随着城市化的不断发展,交通流预测在城市交通管理和规划中越来越受到重视。本研究旨在探讨在道路结构相对简单的数据环境中引入图结构信息的必要性。本文利用六种实际交通数据,通过比较具有图结构信息的图神经网络模型和我们提出的时空卷积长短期记忆网络(ST-ConvLSTMNet)模型,分析了引入图结构信息的作用。此外,我们还分析了各种图形神经网络模型在交通流预测中的应用,比较了它们的精度和计算效率。最后,我们对道路结构相对简单的数据特征进行了详细的解释,并通过烧蚀研究对各个模块的功能进行了进一步的探索。代码可在https://github.com/CC10969Peng上获得。
{"title":"Simplicity meets power: robust traffic flow prediction with ST-ConvLSTMNet model","authors":"Cheng Peng,&nbsp;Yuan Cheng,&nbsp;Ao Li","doi":"10.1007/s10489-025-07062-4","DOIUrl":"10.1007/s10489-025-07062-4","url":null,"abstract":"<div><p>The increasing emphasis on traffic flow prediction in urban traffic management and planning is being driven by the continuous development of urbanization. This study aims to investigate the necessity of introducing graph structure information in data contexts with relatively simple road structures. We conduct experimental investigations to analyze the role of introducing graph structure information by comparing a graph neural network model with graph structure information and our proposed Spatial-Temporal Convolutional Long Short-Term Memory Network (ST-ConvLSTMNet) model, which is designed to capture complex spatiotemporal dependencies efficiently,​​ using six types of actual traffic data. Moreover, we analyze the application of various graph neural network models in traffic flow prediction, comparing their accuracies and computational efficiencies. Lastly, we provide a detailed explanation of the characteristics of data with relatively simple road structures and conduct further exploration of each module’s functionality through ablation studies. Codes are available at https://github.com/CC10969Peng.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"56 3","pages":""},"PeriodicalIF":3.5,"publicationDate":"2026-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147337762","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}
引用次数: 0
Type dynamics theory-driven personality detection with LLM-enhanced social profiling 类型动力学理论驱动的人格检测与llm增强的社会侧写
IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-07 DOI: 10.1007/s10489-026-07093-5
Ruwen Zhang, Bo Liu, Xiaorong Hao, Xinhui Huang, Jiuxin Cao

Personality provides valuable insights into users’ emotions and behaviors, with applications in psychological counseling, personalized recommendations, and social analysis. However, most existing personality detection methods treat traits as independent variables and rely on simple aggregation, lacking psychological interpretability. To address this gap, we propose a Type Dynamics-driven Personality Detection Model (TPD), which integrates psychological theory with deep learning to capture the synergistic interactions among personality traits under social contexts. Specifically, TPD constructs a multi-level graph attention mechanism to jointly model semantic relations between user posts and interdependencies among traits, revealing the internal cognitive dynamics of personality expression. To further capture the influence of external environments on trait expression, TPD introduces a GRU-based attention mechanism that models how external stimuli shape trait manifestation over time. In addition, by identifying core posts representative of each trait and leveraging large language models (LLMs) for contextual explanation, TPD provides interpretable user-centric analyses of online environments. Extensive experiments conducted on two real-world datasets demonstrate superior performance over seven state-of-the-art methods for personality detection, establishing a psychologically grounded framework for social-media-based personality detection. Our code is available at https://github.com/lambdarw/TPD.

Personality为用户的情绪和行为提供了有价值的见解,在心理咨询、个性化推荐和社会分析方面有应用。然而,现有的人格检测方法大多将特征视为自变量,依赖于简单的聚合,缺乏心理可解释性。为了解决这一问题,我们提出了一种类型动态驱动的人格检测模型(TPD),该模型将心理学理论与深度学习相结合,以捕捉社会背景下人格特质之间的协同作用。具体而言,TPD构建了多层次的图注意机制,共同建模用户帖子之间的语义关系和特征之间的相互依赖关系,揭示了人格表达的内在认知动态。为了进一步捕捉外部环境对特质表达的影响,TPD引入了一个基于gru的注意机制,该机制模拟了外部刺激如何随着时间的推移塑造特质表现。此外,通过识别代表每个特征的核心帖子并利用大型语言模型(llm)进行上下文解释,TPD提供了可解释的以用户为中心的在线环境分析。在两个真实世界数据集上进行的大量实验表明,七种最先进的人格检测方法的性能优于其他方法,为基于社交媒体的人格检测建立了一个基于心理学的框架。我们的代码可在https://github.com/lambdarw/TPD上获得。
{"title":"Type dynamics theory-driven personality detection with LLM-enhanced social profiling","authors":"Ruwen Zhang,&nbsp;Bo Liu,&nbsp;Xiaorong Hao,&nbsp;Xinhui Huang,&nbsp;Jiuxin Cao","doi":"10.1007/s10489-026-07093-5","DOIUrl":"10.1007/s10489-026-07093-5","url":null,"abstract":"<div>\u0000 \u0000 <p>Personality provides valuable insights into users’ emotions and behaviors, with applications in psychological counseling, personalized recommendations, and social analysis. However, most existing personality detection methods treat traits as independent variables and rely on simple aggregation, lacking psychological interpretability. To address this gap, we propose a Type Dynamics-driven Personality Detection Model (TPD), which integrates psychological theory with deep learning to capture the synergistic interactions among personality traits under social contexts. Specifically, TPD constructs a multi-level graph attention mechanism to jointly model semantic relations between user posts and interdependencies among traits, revealing the internal cognitive dynamics of personality expression. To further capture the influence of external environments on trait expression, TPD introduces a GRU-based attention mechanism that models how external stimuli shape trait manifestation over time. In addition, by identifying core posts representative of each trait and leveraging large language models (LLMs) for contextual explanation, TPD provides interpretable user-centric analyses of online environments. Extensive experiments conducted on two real-world datasets demonstrate superior performance over seven state-of-the-art methods for personality detection, establishing a psychologically grounded framework for social-media-based personality detection. Our code is available at https://github.com/lambdarw/TPD.</p>\u0000 </div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"56 3","pages":""},"PeriodicalIF":3.5,"publicationDate":"2026-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147337755","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}
引用次数: 0
Outlier detection for Riemannian manifold-valued functional data with applications to long-haul flight trajectories 黎曼流形值函数数据的离群值检测及其在长途飞行轨迹中的应用
IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-07 DOI: 10.1007/s10489-026-07107-2
Xiaokang Wang, Kun Cheng, Rui Zhou, Hao Shi, Chao Liu

Outlier detection for manifold-valued functional data has garnered increasing research interest in machine learning communities due to its broad applications. However, the inherent nonlinear structures of manifolds render conventional linear operators ineffective, posing significant challenges for outlier detection on Riemannian manifolds. This paper develops a novel outlier detection framework for Riemannian manifold-valued functional data. First, we identify a clean subset of observations by estimating a robust Fréchet mean function and implementing a max-min clean subset selection procedure. Subsequently, we construct an outlyingness measure on the tangent space of the estimated robust Fréchet mean function, followed by the development of a new multiple hypothesis testing procedure that incorporates false discovery rate control. Numerical simulations demonstrate that our method exhibits superior accuracy in outlier detection compared to existing approaches that overlook the underlying nonlinear manifold structure. An application to real-world long-haul flight trajectories, which are modeled as curves on a two-dimensional sphere embedded in a three-dimensional Euclidean space, is also provided to illustrate the efficiency. By accounting for the Earth’s surface curvature instead of approximating trajectories as straight lines in flat space, our framework provides a more geometrically faithful solution for outlier detection in such manifold-valued functional data.

流形值函数数据的离群值检测由于其广泛的应用,在机器学习领域引起了越来越多的研究兴趣。然而,流形固有的非线性结构使得传统的线性算子失效,这对黎曼流形的异常值检测提出了重大挑战。本文提出了一种新的黎曼流形值泛函数据异常点检测框架。首先,我们通过估计鲁棒fr平均函数和实现最大最小干净子集选择过程来识别观察的干净子集。随后,我们在估计的鲁棒fr平均函数的切空间上构造了一个离群度度量,然后开发了一个新的包含错误发现率控制的多假设检验程序。数值模拟表明,与忽略潜在非线性流形结构的现有方法相比,我们的方法在异常点检测方面具有更高的准确性。在实际的长途飞行轨迹中,将其建模为嵌入三维欧几里得空间的二维球体上的曲线,并提供了一个应用来说明该方法的有效性。通过考虑地球表面曲率,而不是将轨迹近似为平面空间中的直线,我们的框架为这种流形值函数数据中的异常值检测提供了更几何上可靠的解决方案。
{"title":"Outlier detection for Riemannian manifold-valued functional data with applications to long-haul flight trajectories","authors":"Xiaokang Wang,&nbsp;Kun Cheng,&nbsp;Rui Zhou,&nbsp;Hao Shi,&nbsp;Chao Liu","doi":"10.1007/s10489-026-07107-2","DOIUrl":"10.1007/s10489-026-07107-2","url":null,"abstract":"<div><p>Outlier detection for manifold-valued functional data has garnered increasing research interest in machine learning communities due to its broad applications. However, the inherent nonlinear structures of manifolds render conventional linear operators ineffective, posing significant challenges for outlier detection on Riemannian manifolds. This paper develops a novel outlier detection framework for Riemannian manifold-valued functional data. First, we identify a clean subset of observations by estimating a robust Fréchet mean function and implementing a max-min clean subset selection procedure. Subsequently, we construct an outlyingness measure on the tangent space of the estimated robust Fréchet mean function, followed by the development of a new multiple hypothesis testing procedure that incorporates false discovery rate control. Numerical simulations demonstrate that our method exhibits superior accuracy in outlier detection compared to existing approaches that overlook the underlying nonlinear manifold structure. An application to real-world long-haul flight trajectories, which are modeled as curves on a two-dimensional sphere embedded in a three-dimensional Euclidean space, is also provided to illustrate the efficiency. By accounting for the Earth’s surface curvature instead of approximating trajectories as straight lines in flat space, our framework provides a more geometrically faithful solution for outlier detection in such manifold-valued functional data.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"56 3","pages":""},"PeriodicalIF":3.5,"publicationDate":"2026-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147337761","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}
引用次数: 0
Incremental methods for incomplete neighborhood multi-granularity three-way approximations with time-varying attributes 时变属性不完全邻域多粒度三向逼近的增量方法
IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-06 DOI: 10.1007/s10489-025-07067-z
Xiaobiao Chang, Chengxiang Hu, Xiaoling Huang

With ubiquitous growth and evolution of data in real life applications, processing and analyzing dynamic data has significant potential to drive problem-solving across various domains. Incremental three-way approximations methods have garnered increasing concerns due to their ability to effectively enhance knowledge maintenance efficiency in dynamic data environments. In this study, we propose incremental updating methods for three-way approximations within incomplete neighborhood multi-granularity rough sets (INMGRSs) under the scenarios of addition or deletion of attributes. We devise a novel matrix representation for the three-way approximations in INMGRSs with the assistance of matrix operations. By analyzing the changes in relevant matrices resulting from attribute variations across multi-granularity, we develop and analyze the matrix-based mechanisms for updating these matrices, reducing the effort of unnecessary re-computation. In particular, we present two incremental algorithms in according with these mechanisms. Through a comprehensive comparative analysis, we conduct experimental verification to assess the performance of the proposed algorithms against existing incremental algorithms.

随着数据在现实生活中无处不在的增长和演变,处理和分析动态数据具有推动跨领域解决问题的巨大潜力。增量三向逼近方法由于能够有效地提高动态数据环境中的知识维护效率而受到越来越多的关注。在本研究中,我们提出了不完备邻域多粒度粗糙集(INMGRSs)在添加或删除属性情况下的三向逼近增量更新方法。在矩阵运算的帮助下,我们设计了一种新的矩阵表示方法来表示inmgrs中的三向逼近。通过分析多粒度属性变化导致的相关矩阵的变化,我们开发和分析了基于矩阵的更新这些矩阵的机制,减少了不必要的重新计算的工作量。特别地,我们提出了两种符合这些机制的增量算法。通过全面的比较分析,我们进行了实验验证,以评估所提出的算法与现有增量算法的性能。
{"title":"Incremental methods for incomplete neighborhood multi-granularity three-way approximations with time-varying attributes","authors":"Xiaobiao Chang,&nbsp;Chengxiang Hu,&nbsp;Xiaoling Huang","doi":"10.1007/s10489-025-07067-z","DOIUrl":"10.1007/s10489-025-07067-z","url":null,"abstract":"<div>\u0000 \u0000 <p>With ubiquitous growth and evolution of data in real life applications, processing and analyzing dynamic data has significant potential to drive problem-solving across various domains. Incremental three-way approximations methods have garnered increasing concerns due to their ability to effectively enhance knowledge maintenance efficiency in dynamic data environments. In this study, we propose incremental updating methods for three-way approximations within incomplete neighborhood multi-granularity rough sets (INMGRSs) under the scenarios of addition or deletion of attributes. We devise a novel matrix representation for the three-way approximations in INMGRSs with the assistance of matrix operations. By analyzing the changes in relevant matrices resulting from attribute variations across multi-granularity, we develop and analyze the matrix-based mechanisms for updating these matrices, reducing the effort of unnecessary re-computation. In particular, we present two incremental algorithms in according with these mechanisms. Through a comprehensive comparative analysis, we conduct experimental verification to assess the performance of the proposed algorithms against existing incremental algorithms.</p>\u0000 </div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"56 3","pages":""},"PeriodicalIF":3.5,"publicationDate":"2026-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147337600","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}
引用次数: 0
Explainable classifier with adaptive optimisation for medical data 可解释的分类器与自适应优化的医疗数据
IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-06 DOI: 10.1007/s10489-025-07081-1
José Ramón Trillo, María José Del Moral, Juan Miguel Tapia, Julia García-Cabello, Francisco Javier Cabrerizo

Artificial Intelligence (AI) has become increasingly important in critical domains such as medicine, where accurate and interpretable decision-making is essential. However, many high-performing AI models operate as “black boxes”, limiting transparency and making it difficult for clinicians to understand or verify predictions. To address this challenge, we present an eXplainable Artificial Intelligence (XAI) framework that integrates a fuzzy rule-based classifier with genetic algorithms and 2-tuple linguistic representations. The method incrementally generates general fuzzy rules, introduces fuzzy exception rules to capture atypical cases, and applies rule selection and parameter tuning to enhance both accuracy and interpretability. Experiments on nine medical datasets demonstrate that our approach achieves competitive or superior accuracy compared to state-of-the-art algorithms, while requiring fewer rules. These results show that the method not only improves predictive performance but also provides clear, human-readable explanations for each decision, thereby increasing trust and facilitating its application in medical practice.

人工智能(AI)在医学等关键领域变得越来越重要,在这些领域,准确和可解释的决策至关重要。然而,许多高性能的人工智能模型像“黑盒子”一样运行,限制了透明度,使临床医生难以理解或验证预测。为了应对这一挑战,我们提出了一个可解释的人工智能(XAI)框架,该框架将基于模糊规则的分类器与遗传算法和二元组语言表示相结合。该方法增量生成一般模糊规则,引入模糊例外规则捕获非典型案例,并应用规则选择和参数调优来提高准确性和可解释性。在9个医疗数据集上的实验表明,与最先进的算法相比,我们的方法实现了竞争性或更高的准确性,同时需要更少的规则。这些结果表明,该方法不仅提高了预测性能,而且为每个决策提供了清晰、易读的解释,从而增加了信任,促进了其在医疗实践中的应用。
{"title":"Explainable classifier with adaptive optimisation for medical data","authors":"José Ramón Trillo,&nbsp;María José Del Moral,&nbsp;Juan Miguel Tapia,&nbsp;Julia García-Cabello,&nbsp;Francisco Javier Cabrerizo","doi":"10.1007/s10489-025-07081-1","DOIUrl":"10.1007/s10489-025-07081-1","url":null,"abstract":"<div><p>Artificial Intelligence (AI) has become increasingly important in critical domains such as medicine, where accurate and interpretable decision-making is essential. However, many high-performing AI models operate as “black boxes”, limiting transparency and making it difficult for clinicians to understand or verify predictions. To address this challenge, we present an eXplainable Artificial Intelligence (XAI) framework that integrates a fuzzy rule-based classifier with genetic algorithms and 2-tuple linguistic representations. The method incrementally generates general fuzzy rules, introduces fuzzy exception rules to capture atypical cases, and applies rule selection and parameter tuning to enhance both accuracy and interpretability. Experiments on nine medical datasets demonstrate that our approach achieves competitive or superior accuracy compared to state-of-the-art algorithms, while requiring fewer rules. These results show that the method not only improves predictive performance but also provides clear, human-readable explanations for each decision, thereby increasing trust and facilitating its application in medical practice.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"56 3","pages":""},"PeriodicalIF":3.5,"publicationDate":"2026-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10489-025-07081-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147337601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Correction to: Personalized federated learning with exact stochastic gradient descent 修正:具有精确随机梯度下降的个性化联合学习
IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-05 DOI: 10.1007/s10489-026-07123-2
Sotirios Nikoloutsopoulos, Iordanis Koutsopoulos, Michalis K. Titsias
{"title":"Correction to: Personalized federated learning with exact stochastic gradient descent","authors":"Sotirios Nikoloutsopoulos,&nbsp;Iordanis Koutsopoulos,&nbsp;Michalis K. Titsias","doi":"10.1007/s10489-026-07123-2","DOIUrl":"10.1007/s10489-026-07123-2","url":null,"abstract":"","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"56 3","pages":""},"PeriodicalIF":3.5,"publicationDate":"2026-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147337166","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}
引用次数: 0
Multiscale contrast-limited image enhancement for palmprint recognition with VisionInceptNet 基于VisionInceptNet的多尺度对比度限制图像增强掌纹识别
IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-05 DOI: 10.1007/s10489-026-07119-y
Rinkal Jain, Chintan Bhatt, Shakti Mishra, Thanh Thi Nguyen

The quality of the input pictures is the primary factor influencing palmprint recognition systems. However, inadequate lighting, auditory disturbances, and variations in contrast might render identification uncertain. We present a new method for enhancing palmprint images called Multiscale Contrast-Limited Enhancement for Adaptive Palmprints (M-CLEAP). With the use of multiscale processing and dynamic equalizing of the histograms and contrast limitations, this technique successfully reduces noise and enhances palmprint features. We introduce VisionInceptNet, an advanced model architecture that integrates the optimal features of Vision Transformer (ViT) and InceptionV3 network. VisionInceptNet exhibits the highest identification accuracy; however, extensive evaluation on prevalent palmprint datasets demonstrates that the proposed M-CLEAP significantly enhances image quality. VisionInceptNet and M-CLEAP collaborate to establish a robust and effective framework for palmprint recognition that surpasses all existing deep learning frameworks and conventional approaches. This collaboration enhances the scalability and reliability of palmprint-based authentication in practical applications such as forensic investigation, secure access management, and identity verification.

输入图像的质量是影响掌纹识别系统的主要因素。然而,光线不足、听觉干扰和对比度变化可能使识别不确定。本文提出了一种新的增强掌纹图像的方法,称为自适应掌纹多尺度对比度限制增强(M-CLEAP)。利用多尺度处理和动态均衡直方图和对比度限制,该技术成功地降低了噪声,增强了掌纹特征。我们介绍VisionInceptNet,一种先进的模型架构,集成了Vision Transformer (ViT)和InceptionV3网络的最佳特性。VisionInceptNet具有最高的识别精度;然而,对流行掌纹数据集的广泛评估表明,所提出的M-CLEAP显著提高了图像质量。VisionInceptNet和M-CLEAP合作建立了一个强大而有效的掌纹识别框架,超越了所有现有的深度学习框架和传统方法。此次合作增强了基于掌纹的身份验证在法医调查、安全访问管理和身份验证等实际应用中的可扩展性和可靠性。
{"title":"Multiscale contrast-limited image enhancement for palmprint recognition with VisionInceptNet","authors":"Rinkal Jain,&nbsp;Chintan Bhatt,&nbsp;Shakti Mishra,&nbsp;Thanh Thi Nguyen","doi":"10.1007/s10489-026-07119-y","DOIUrl":"10.1007/s10489-026-07119-y","url":null,"abstract":"<div><p>The quality of the input pictures is the primary factor influencing palmprint recognition systems. However, inadequate lighting, auditory disturbances, and variations in contrast might render identification uncertain. We present a new method for enhancing palmprint images called Multiscale Contrast-Limited Enhancement for Adaptive Palmprints (M-CLEAP). With the use of multiscale processing and dynamic equalizing of the histograms and contrast limitations, this technique successfully reduces noise and enhances palmprint features. We introduce VisionInceptNet, an advanced model architecture that integrates the optimal features of Vision Transformer (ViT) and InceptionV3 network. VisionInceptNet exhibits the highest identification accuracy; however, extensive evaluation on prevalent palmprint datasets demonstrates that the proposed M-CLEAP significantly enhances image quality. VisionInceptNet and M-CLEAP collaborate to establish a robust and effective framework for palmprint recognition that surpasses all existing deep learning frameworks and conventional approaches. This collaboration enhances the scalability and reliability of palmprint-based authentication in practical applications such as forensic investigation, secure access management, and identity verification.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"56 3","pages":""},"PeriodicalIF":3.5,"publicationDate":"2026-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147337070","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}
引用次数: 0
Enhancing hyperspectral image prediction with contrastive learning in low-label regimes 在低标签状态下用对比学习增强高光谱图像预测
IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-04 DOI: 10.1007/s10489-025-07071-3
Salma Haidar, José Oramas

Labelled data scarcity remains a longstanding challenge in hyperspectral image analysis, primarily due to high spectral dimensionality and the laborious nature of manual annotation. Self-supervised contrastive learning (SSCL) recently emerged as a promising approach to address this challenge due to its ability to learn robust representations by distinguishing similar and dissimilar data samples guided by the inherent properties of data rather than by labels. Our study builds upon a previously established two-stage patch-level, multi-label classification method for hyperspectral imagery using contrastive learning and further examines its performance on single-label and multi-label classification tasks under scenarios of limited training data. The methodology unfolds in two stages. Initially, we train an encoder with a projection network in a contrastive learning approach. Next, we fine-tune the pre-trained encoder with a classifier. Our empirical results on four public hyperspectral datasets demonstrate consistent improvements over fully supervised methods, boosting overall accuracy by up to (4.4%) in multi-label and (7.14%) in single-label tasks (e.g. on the Pavia University dataset). Performance remains competitive even under a (50%) reduction in labelled training data. Our qualitative analysis confirms that the contrastive-based encoder can produce well-separated representations for different classes and identify location-based features, even though it was not explicitly trained on spatial cues. This suggests the method’s potential to uncover implicit spatial information. These findings highlight the value of self-supervised contrastive learning for hyperspectral image classification, offering a promising avenue for handling data scarcity while enhancing predictive accuracy. They also highlight the method’s resilience in real-world scenarios where abundant labelled examples are often unavailable.

在高光谱图像分析中,标记数据的稀缺性仍然是一个长期存在的挑战,主要是由于高光谱维度和手动注释的费力性。自监督对比学习(SSCL)最近成为解决这一挑战的一种很有前途的方法,因为它能够通过数据的固有属性而不是标签来区分相似和不同的数据样本,从而学习稳健的表示。我们的研究建立在先前建立的使用对比学习的两阶段补丁级多标签高光谱图像分类方法的基础上,并进一步研究了其在有限训练数据情况下在单标签和多标签分类任务上的性能。该方法分为两个阶段。首先,我们用对比学习的方法用投影网络训练编码器。接下来,我们用分类器对预训练的编码器进行微调。我们在四个公共高光谱数据集上的实证结果表明,与完全监督方法相比,总体精度在多标签任务中提高(4.4%),在单标签任务中提高(7.14%)(例如,在Pavia大学数据集上)。即使在标记训练数据(50%)减少的情况下,性能仍然具有竞争力。我们的定性分析证实,基于对比的编码器可以为不同的类别产生良好的分离表示,并识别基于位置的特征,即使它没有明确地训练空间线索。这表明该方法有潜力揭示隐含的空间信息。这些发现突出了自监督对比学习在高光谱图像分类中的价值,为处理数据稀缺性同时提高预测准确性提供了一条有前途的途径。他们还强调了该方法在现实场景中的弹性,在现实场景中,大量的标记示例通常是不可用的。
{"title":"Enhancing hyperspectral image prediction with contrastive learning in low-label regimes","authors":"Salma Haidar,&nbsp;José Oramas","doi":"10.1007/s10489-025-07071-3","DOIUrl":"10.1007/s10489-025-07071-3","url":null,"abstract":"<div><p>Labelled data scarcity remains a longstanding challenge in hyperspectral image analysis, primarily due to high spectral dimensionality and the laborious nature of manual annotation. Self-supervised contrastive learning (SSCL) recently emerged as a promising approach to address this challenge due to its ability to learn robust representations by distinguishing similar and dissimilar data samples guided by the inherent properties of data rather than by labels. Our study builds upon a previously established two-stage patch-level, multi-label classification method for hyperspectral imagery using contrastive learning and further examines its performance on single-label and multi-label classification tasks under scenarios of limited training data. The methodology unfolds in two stages. Initially, we train an encoder with a projection network in a contrastive learning approach. Next, we fine-tune the pre-trained encoder with a classifier. Our empirical results on four public hyperspectral datasets demonstrate consistent improvements over fully supervised methods, boosting overall accuracy by up to <span>(4.4%)</span> in multi-label and <span>(7.14%)</span> in single-label tasks (e.g. on the Pavia University dataset). Performance remains competitive even under a <span>(50%)</span> reduction in labelled training data. Our qualitative analysis confirms that the contrastive-based encoder can produce well-separated representations for different classes and identify location-based features, even though it was not explicitly trained on spatial cues. This suggests the method’s potential to uncover implicit spatial information. These findings highlight the value of self-supervised contrastive learning for hyperspectral image classification, offering a promising avenue for handling data scarcity while enhancing predictive accuracy. They also highlight the method’s resilience in real-world scenarios where abundant labelled examples are often unavailable.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"56 3","pages":""},"PeriodicalIF":3.5,"publicationDate":"2026-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147336680","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}
引用次数: 0
期刊
Applied Intelligence
全部 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