首页 > 最新文献

Knowledge-Based Systems最新文献

英文 中文
GSMS: Integrating graph structures and multi-curvature space mapping for entity alignment via generative adversarial training GSMS:通过生成对抗训练集成图结构和多曲率空间映射用于实体对齐
IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-08 Epub Date: 2026-02-10 DOI: 10.1016/j.knosys.2026.115536
Linlin Ding , Mengjunyao Si , Mo Li , Yishan Pan , Xin Wang
Entity Alignment (EA) aims to identify equivalent real-world entities across different knowledge graphs. These graphs exhibit a mixture of structural forms, such as hierarchies, cycles, and chains, which correspond to different geometric behaviors. However, most existing methods learn representations in a single geometric space, implicitly assuming uniform structural regularity, which limits their ability to capture diverse relational semantics and nonlinear dependencies in graphs with mixed or irregular topologies. To address this limitation, we propose a novel GSMS model, which integrates Graph Structural signals with Multi-curvature Space mapping under a generative adversarial training framework. GSMS unifies structural enhancement, multi-curvature geometric mapping, and adversarial training into a cohesive framework that strengthens both the discriminative capacity and robustness of entity representations. Specifically, it first enhances structural representations by leveraging second-order and triangular-ring relations while suppressing noise through stacked adaptive edge-weight updates. Then, it embeds entities into Euclidean, hyperbolic, and spherical spaces and adaptively fuses these complementary geometric features via a geometry-gated fusion module. Subsequently, a generative adversarial scheme aligns structural and geometric embeddings by treating the latter as “real” samples, thereby enforcing geometric consistency and improving robustness. Extensive experiments on multiple benchmark cross-lingual knowledge graph datasets demonstrate that GSMS consistently outperforms state-of-the-art methods, achieving notable improvements across various evaluation metrics, particularly under sparse and structurally heterogeneous settings.
实体对齐(Entity Alignment, EA)的目的是在不同的知识图谱中识别等价的真实世界实体。这些图展示了混合的结构形式,如层次、循环和链,它们对应于不同的几何行为。然而,大多数现有方法在单个几何空间中学习表示,隐含地假设统一的结构规则,这限制了它们在混合或不规则拓扑的图中捕获不同关系语义和非线性依赖的能力。为了解决这一限制,我们提出了一种新的GSMS模型,该模型在生成对抗训练框架下将图结构信号与多曲率空间映射集成在一起。GSMS将结构增强、多曲率几何映射和对抗性训练统一到一个内聚框架中,增强了实体表示的判别能力和鲁棒性。具体来说,它首先通过利用二阶和三角环关系来增强结构表征,同时通过堆叠自适应边权更新来抑制噪声。然后,它将实体嵌入欧几里德空间、双曲空间和球面空间,并通过几何门控融合模块自适应地融合这些互补的几何特征。随后,生成对抗方案通过将后者视为“真实”样本来对齐结构和几何嵌入,从而增强几何一致性并提高鲁棒性。在多个基准跨语言知识图谱数据集上进行的大量实验表明,GSMS始终优于最先进的方法,在各种评估指标上取得了显着改进,特别是在稀疏和结构异构设置下。
{"title":"GSMS: Integrating graph structures and multi-curvature space mapping for entity alignment via generative adversarial training","authors":"Linlin Ding ,&nbsp;Mengjunyao Si ,&nbsp;Mo Li ,&nbsp;Yishan Pan ,&nbsp;Xin Wang","doi":"10.1016/j.knosys.2026.115536","DOIUrl":"10.1016/j.knosys.2026.115536","url":null,"abstract":"<div><div>Entity Alignment (EA) aims to identify equivalent real-world entities across different knowledge graphs. These graphs exhibit a mixture of structural forms, such as hierarchies, cycles, and chains, which correspond to different geometric behaviors. However, most existing methods learn representations in a single geometric space, implicitly assuming uniform structural regularity, which limits their ability to capture diverse relational semantics and nonlinear dependencies in graphs with mixed or irregular topologies. To address this limitation, we propose a novel GSMS model, which integrates <u>G</u>raph <u>S</u>tructural signals with <u>M</u>ulti-curvature <u>S</u>pace mapping under a generative adversarial training framework. GSMS unifies structural enhancement, multi-curvature geometric mapping, and adversarial training into a cohesive framework that strengthens both the discriminative capacity and robustness of entity representations. Specifically, it first enhances structural representations by leveraging second-order and triangular-ring relations while suppressing noise through stacked adaptive edge-weight updates. Then, it embeds entities into Euclidean, hyperbolic, and spherical spaces and adaptively fuses these complementary geometric features via a geometry-gated fusion module. Subsequently, a generative adversarial scheme aligns structural and geometric embeddings by treating the latter as “real” samples, thereby enforcing geometric consistency and improving robustness. Extensive experiments on multiple benchmark cross-lingual knowledge graph datasets demonstrate that GSMS consistently outperforms state-of-the-art methods, achieving notable improvements across various evaluation metrics, particularly under sparse and structurally heterogeneous settings.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"338 ","pages":"Article 115536"},"PeriodicalIF":7.6,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146175155","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improved LSTNet-Driven hyperchaotic sequence optimization and its application in multi-Image encryption 改进lstnet驱动的超混沌序列优化及其在多图像加密中的应用
IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-08 Epub Date: 2026-02-10 DOI: 10.1016/j.knosys.2026.115529
Yongzhang Li, Ye Tao
Existing deep-learning-based chaotic image encryption schemes suffer from insufficient performance and are limited to simple chaotic systems, hindering their practical applicability. Therefore, we have developed a new deep learning-based multi-image chaotic encryption framework. First, by integrating optimization test functions, we constructed a 2D hyperchaotic system (ASHM) for generating chaotic sequences. Next, we propose a network architecture, ChaosAutoFormer, which is trained on chaotic sequences and efficiently generates new random sequences. The generated sequences pass standard randomness tests. Subsequently, we applied these sequences to a multi-image encryption system and employed lightweight encryption methods such as circular shifting, deep rearrangement, and adaptive path selection, balancing both encryption security and efficiency. The new sequences generated by deep learning overcome the defects caused by the direct use of chaotic sequences, and the complexity of the deep learning structure makes it resistant to various attacks. Simulation results indicate that the proposed algorithm achieves a key space of 2318 values, an information entropy of 7.9993, an NPCR of 99.6145%, and an UACI of 33.6364%, making it suitable for scenarios that require high encryption security.
现有的基于深度学习的混沌图像加密方案存在性能不足,且仅限于简单的混沌系统,阻碍了其实际应用。因此,我们开发了一种新的基于深度学习的多图像混沌加密框架。首先,通过对优化测试函数的积分,构造了用于生成混沌序列的二维超混沌系统(ASHM)。接下来,我们提出了一种网络架构ChaosAutoFormer,它在混沌序列上进行训练,并有效地生成新的随机序列。生成的序列通过标准的随机性测试。随后,我们将这些序列应用于多图像加密系统,并采用了循环移位、深度重排和自适应路径选择等轻量级加密方法,平衡了加密的安全性和效率。深度学习生成的新序列克服了直接使用混沌序列所带来的缺陷,深度学习结构的复杂性使其能够抵抗各种攻击。仿真结果表明,该算法的密钥空间为2318个值,信息熵为7.9993,NPCR为99.6145%,UACI为33.6364%,适用于对加密安全性要求较高的场景。
{"title":"Improved LSTNet-Driven hyperchaotic sequence optimization and its application in multi-Image encryption","authors":"Yongzhang Li,&nbsp;Ye Tao","doi":"10.1016/j.knosys.2026.115529","DOIUrl":"10.1016/j.knosys.2026.115529","url":null,"abstract":"<div><div>Existing deep-learning-based chaotic image encryption schemes suffer from insufficient performance and are limited to simple chaotic systems, hindering their practical applicability. Therefore, we have developed a new deep learning-based multi-image chaotic encryption framework. First, by integrating optimization test functions, we constructed a 2D hyperchaotic system (ASHM) for generating chaotic sequences. Next, we propose a network architecture, ChaosAutoFormer, which is trained on chaotic sequences and efficiently generates new random sequences. The generated sequences pass standard randomness tests. Subsequently, we applied these sequences to a multi-image encryption system and employed lightweight encryption methods such as circular shifting, deep rearrangement, and adaptive path selection, balancing both encryption security and efficiency. The new sequences generated by deep learning overcome the defects caused by the direct use of chaotic sequences, and the complexity of the deep learning structure makes it resistant to various attacks. Simulation results indicate that the proposed algorithm achieves a key space of 2<sup>318</sup> values, an information entropy of 7.9993, an NPCR of 99.6145%, and an UACI of 33.6364%, making it suitable for scenarios that require high encryption security.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"338 ","pages":"Article 115529"},"PeriodicalIF":7.6,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146175146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MIARS: Mutual information-guided feature selection with angle reconstruction and semantic alignment for multi-label learning MIARS:基于角度重构和语义对齐的多标签学习的互信息引导特征选择
IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-08 Epub Date: 2026-02-02 DOI: 10.1016/j.knosys.2026.115424
Ruijia Li , Hong Chen , Yingcang Ma , Feiping Nie , Yixiao Huang
To address the key challenges in multi-label feature selection, including the non-smooth optimization problem caused by discrete label representation, the insufficient generalization performance due to ignored label correlations, and the difficulty in balancing feature discriminability and redundancy, we propose a Mutual Information-guided Angle Reconstruction and Semantic Alignment (MIARS) feature selection method. This method achieves breakthrough progress through three core technological innovations: First, it innovatively maps discrete labels to a unit hypersphere space and achieves continuous label representation by minimizing the Angle Reconstruction Error (ARE), effectively preserving the global similarity structure among labels. Second, an orthogonal rotation matrix optimization mechanism is introduced to achieve precise semantic alignment by maximizing the cosine similarity between pseudo-labels and true labels. Finally, a strategy combining mutual information matrices with ℓ2,0-norm constraints is adopted to directly select the optimal feature subset with low redundancy and high discriminability. Experimental results on nine benchmark datasets demonstrate the significant effectiveness of MIARS.
针对多标签特征选择中由于离散标签表示导致的非光滑优化问题、忽略标签相关性导致的泛化性能不足以及难以平衡特征可判别性和冗余性等问题,提出了一种互信息引导的角度重构和语义对齐(MIARS)特征选择方法。该方法通过三个核心技术创新取得突破性进展:一是创新地将离散标签映射到单位超球空间,通过最小化角度重构误差(Angle Reconstruction Error, ARE)实现连续标签表示,有效地保持了标签之间的全局相似结构;其次,引入正交旋转矩阵优化机制,通过最大化伪标签与真标签之间的余弦相似度来实现精确的语义对齐;最后,采用互信息矩阵与0范数约束相结合的策略,直接选择低冗余、高判别性的最优特征子集。在9个基准数据集上的实验结果证明了MIARS的显著有效性。
{"title":"MIARS: Mutual information-guided feature selection with angle reconstruction and semantic alignment for multi-label learning","authors":"Ruijia Li ,&nbsp;Hong Chen ,&nbsp;Yingcang Ma ,&nbsp;Feiping Nie ,&nbsp;Yixiao Huang","doi":"10.1016/j.knosys.2026.115424","DOIUrl":"10.1016/j.knosys.2026.115424","url":null,"abstract":"<div><div>To address the key challenges in multi-label feature selection, including the non-smooth optimization problem caused by discrete label representation, the insufficient generalization performance due to ignored label correlations, and the difficulty in balancing feature discriminability and redundancy, we propose a Mutual Information-guided Angle Reconstruction and Semantic Alignment (MIARS) feature selection method. This method achieves breakthrough progress through three core technological innovations: First, it innovatively maps discrete labels to a unit hypersphere space and achieves continuous label representation by minimizing the Angle Reconstruction Error (ARE), effectively preserving the global similarity structure among labels. Second, an orthogonal rotation matrix optimization mechanism is introduced to achieve precise semantic alignment by maximizing the cosine similarity between pseudo-labels and true labels. Finally, a strategy combining mutual information matrices with ℓ<sub>2,0</sub>-norm constraints is adopted to directly select the optimal feature subset with low redundancy and high discriminability. Experimental results on nine benchmark datasets demonstrate the significant effectiveness of MIARS.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"338 ","pages":"Article 115424"},"PeriodicalIF":7.6,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146175182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Knowledge-based optimization and reasoning for intelligent task offloading in dynamic vehicular fog networks 基于知识的车辆动态雾网络智能任务卸载优化与推理
IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-08 Epub Date: 2026-02-06 DOI: 10.1016/j.knosys.2026.115507
Chia-Cheng Hu
The rapid expansion of real-time Internet of Things (IoT) applications, particularly in highly dynamic environments such as Vehicular Fog Networks (VFNs), presents significant challenges for task offloading due to stringent latency constraints and fluctuating resource availability. To address these challenges, this paper introduces a hybrid knowledge-based framework that integrates Integer Linear Programming (ILP) with Case-Based Reasoning (CBR) to enable intelligent and adaptive task offloading in VFNs. The framework operates in two complementary phases: ILP is applied offline to derive optimal offloading strategies under diverse network conditions and construct a decision knowledge base, while CBR is executed online to retrieve and adapt relevant cases for real-time decision-making with minimal computational cost. By decoupling global optimization from online inference, the proposed system achieves high scalability and responsiveness.
Comprehensive simulations conducted in AGV-enabled VFNs demonstrate that the proposed framework achieves near-optimal performance, reducing average task latency by up to 20% and energy consumption by 15% compared with heuristic and learning-based baselines. Furthermore, the Decision Support System (DSS) sustains a retrieval latency below 150 ms even with a large-scale case database, ensuring real-time adaptability and scalability under varying network topologies and workloads. These results confirm the framework’s robustness and efficiency, offering a promising foundation for knowledge-driven task offloading in next-generation IoT and edge computing infrastructures.
实时物联网(IoT)应用的快速扩展,特别是在车辆雾网络(vfn)等高度动态环境中,由于严格的延迟限制和资源可用性波动,给任务卸载带来了重大挑战。为了解决这些挑战,本文引入了一种基于知识的混合框架,该框架将整数线性规划(ILP)与基于案例的推理(CBR)集成在一起,以实现vfn中的智能和自适应任务卸载。该框架分两个互补阶段运行:离线应用逻辑推理(ILP)推导出不同网络条件下的最优卸载策略,构建决策知识库;在线执行推理推理(CBR),以最小的计算成本检索和调整相关案例,用于实时决策。通过将全局优化与在线推理解耦,系统具有较高的可扩展性和响应能力。在支持agv的vfn中进行的综合仿真表明,与启发式和基于学习的基线相比,所提出的框架实现了近乎最佳的性能,将平均任务延迟降低了20%,能耗降低了15%。此外,决策支持系统(DSS)即使在大型案例数据库中也能保持150毫秒以下的检索延迟,确保在不同网络拓扑和工作负载下的实时适应性和可扩展性。这些结果证实了该框架的鲁棒性和效率,为下一代物联网和边缘计算基础设施中的知识驱动任务卸载提供了有希望的基础。
{"title":"Knowledge-based optimization and reasoning for intelligent task offloading in dynamic vehicular fog networks","authors":"Chia-Cheng Hu","doi":"10.1016/j.knosys.2026.115507","DOIUrl":"10.1016/j.knosys.2026.115507","url":null,"abstract":"<div><div>The rapid expansion of real-time Internet of Things (IoT) applications, particularly in highly dynamic environments such as Vehicular Fog Networks (VFNs), presents significant challenges for task offloading due to stringent latency constraints and fluctuating resource availability. To address these challenges, this paper introduces a hybrid knowledge-based framework that integrates Integer Linear Programming (ILP) with Case-Based Reasoning (CBR) to enable intelligent and adaptive task offloading in VFNs. The framework operates in two complementary phases: ILP is applied offline to derive optimal offloading strategies under diverse network conditions and construct a decision knowledge base, while CBR is executed online to retrieve and adapt relevant cases for real-time decision-making with minimal computational cost. By decoupling global optimization from online inference, the proposed system achieves high scalability and responsiveness.</div><div>Comprehensive simulations conducted in AGV-enabled VFNs demonstrate that the proposed framework achieves near-optimal performance, reducing average task latency by up to 20% and energy consumption by 15% compared with heuristic and learning-based baselines. Furthermore, the Decision Support System (DSS) sustains a retrieval latency below 150 ms even with a large-scale case database, ensuring real-time adaptability and scalability under varying network topologies and workloads. These results confirm the framework’s robustness and efficiency, offering a promising foundation for knowledge-driven task offloading in next-generation IoT and edge computing infrastructures.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"338 ","pages":"Article 115507"},"PeriodicalIF":7.6,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146175178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DBCA-DTI: A dual-branch multimodal framework based on bidirectional adaptive gated cross-attention mechanism for drug-target interaction prediction DBCA-DTI:基于双向自适应门控交叉注意机制的双分支多模态框架药物-靶标相互作用预测
IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-08 Epub Date: 2026-02-06 DOI: 10.1016/j.knosys.2026.115463
Jia Peng , Xiaoyu Liu , Xiaodong Zhou , Lei Wang , Xianyou Zhu
Accurate identification of drug-target interactions (DTIs) is crucial for improving screening efficiency and reducing experimental costs in drug discovery. However, existing DTI prediction methods still face two major challenges: (1) Feature representation relies on single-modality data, making it difficult to comprehensively characterize the multi-level properties of drugs and targets; (2) Limited cross-modal fusion capabilities hinder the capture of complex associations between drugs and targets, resulting in constrained prediction performance. To address these issues, this study proposes a dual-branch collaborative multi-modal fusion DTI prediction framework (DBCA-DTI). This framework comprises two feature encoding branches: the first is a large language model-enhanced semantic feature branch, which utilizes pre-trained large language models to encode drug molecule and protein, accurately capturing their high-dimensional semantic information; the second is a physicochemical property feature branch, which combines RDKit-extracted drug structural descriptors with amino acid-based protein fundamental features to enhance the model’s feature expression depth and recognition capability in the physicochemical property dimension. Additionally, both branches employ a bidirectional adaptive gated cross-attention mechanism to enhance cross-modal interactions between drugs and targets. A multimodal feature fusion module integrates diverse outputs from both branches, boosting overall representational capacity and prediction robustness. Experimental results demonstrate that DBCA-DTI significantly outperforms existing mainstream methods across multiple public benchmark datasets. This study provides an efficient, flexible, and scalable solution for DTI prediction.The code is accessible at https://github.com/myseverus/DBCA-DTI.
准确识别药物-靶标相互作用(DTIs)对于提高药物筛选效率和降低药物发现的实验成本至关重要。然而,现有的DTI预测方法仍然面临两大挑战:(1)特征表示依赖于单模态数据,难以全面表征药物和靶点的多层次特性;(2)有限的跨模态融合能力阻碍了药物与靶标之间复杂关联的捕捉,导致预测性能受限。为了解决这些问题,本研究提出了一个双分支协作多模态融合DTI预测框架(DBCA-DTI)。该框架包括两个特征编码分支:第一个是大型语言模型增强语义特征分支,利用预训练的大型语言模型对药物分子和蛋白质进行编码,准确捕获其高维语义信息;二是理化性质特征分支,将rdkit提取的药物结构描述符与基于氨基酸的蛋白质基本特征相结合,增强模型在理化性质维度上的特征表达深度和识别能力。此外,这两个分支都采用双向自适应门控交叉注意机制来增强药物和靶标之间的跨模态相互作用。多模态特征融合模块集成了两个分支的不同输出,提高了整体表征能力和预测鲁棒性。实验结果表明,在多个公共基准数据集上,DBCA-DTI显著优于现有主流方法。本研究为DTI预测提供了一种高效、灵活、可扩展的解决方案。代码可在https://github.com/myseverus/DBCA-DTI上访问。
{"title":"DBCA-DTI: A dual-branch multimodal framework based on bidirectional adaptive gated cross-attention mechanism for drug-target interaction prediction","authors":"Jia Peng ,&nbsp;Xiaoyu Liu ,&nbsp;Xiaodong Zhou ,&nbsp;Lei Wang ,&nbsp;Xianyou Zhu","doi":"10.1016/j.knosys.2026.115463","DOIUrl":"10.1016/j.knosys.2026.115463","url":null,"abstract":"<div><div>Accurate identification of drug-target interactions (DTIs) is crucial for improving screening efficiency and reducing experimental costs in drug discovery. However, existing DTI prediction methods still face two major challenges: (1) Feature representation relies on single-modality data, making it difficult to comprehensively characterize the multi-level properties of drugs and targets; (2) Limited cross-modal fusion capabilities hinder the capture of complex associations between drugs and targets, resulting in constrained prediction performance. To address these issues, this study proposes a dual-branch collaborative multi-modal fusion DTI prediction framework (DBCA-DTI). This framework comprises two feature encoding branches: the first is a large language model-enhanced semantic feature branch, which utilizes pre-trained large language models to encode drug molecule and protein, accurately capturing their high-dimensional semantic information; the second is a physicochemical property feature branch, which combines RDKit-extracted drug structural descriptors with amino acid-based protein fundamental features to enhance the model’s feature expression depth and recognition capability in the physicochemical property dimension. Additionally, both branches employ a bidirectional adaptive gated cross-attention mechanism to enhance cross-modal interactions between drugs and targets. A multimodal feature fusion module integrates diverse outputs from both branches, boosting overall representational capacity and prediction robustness. Experimental results demonstrate that DBCA-DTI significantly outperforms existing mainstream methods across multiple public benchmark datasets. This study provides an efficient, flexible, and scalable solution for DTI prediction.The code is accessible at <span><span>https://github.com/myseverus/DBCA-DTI</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"338 ","pages":"Article 115463"},"PeriodicalIF":7.6,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146175320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The impact of fine-tuning on entity resolution: An experimental evaluation 微调对实体分辨率的影响:一个实验评估
IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-08 Epub Date: 2026-02-02 DOI: 10.1016/j.knosys.2026.115427
Dimitrios Karapiperis, Leonidas Akritidis, Panayiotis Bozanis
Fine-tuning pre-trained language models has become the state-of-the-art approach for Entity Resolution (ER), but this has created a divide between two dominant architectures: fast-but-less-accurate bi-encoders and accurate-but-slow cross-encoders. However, a concrete gap in prior ER benchmarking remains unresolved: existing studies often evaluate architectures in isolation or on limited datasets. It remains unclear which base models and architectures are best suited for the diverse range of real-world ER datasets, each with unique characteristics and performance bottlenecks. This paper bridges this gap through an extensive empirical evaluation. We systematically compare three popular pre-trained models (MiniLM, MPNet, and BGE) across three distinct architectural paradigms: a pre-trained bi-encoder, a fine-tuned bi-encoder, and a fine-tuned cross-encoder. We tested these combinations on eight diverse real-world and semi-synthetic datasets, analyzing their performance, training costs, and final resolution times. Our results reveal a clear accuracy-vs-efficiency trade-off, identifying the fine-tuned bi-encoder as the optimal balance between performance and practical resolution speed. More importantly, we demonstrate that fine-tuning is not a universal solution. Its effectiveness is highly contingent on the dataset: it provides substantial gains on specialized domains by fixing pre-existing performance gaps but is detrimental to performance on datasets where pre-trained models are already well-aligned. These findings provide a practical guide for practitioners on selecting the optimal model and architecture based on their specific data and application requirements.
微调预训练的语言模型已经成为实体解析(ER)的最先进的方法,但这在两种主流架构之间产生了分歧:快速但不太准确的双编码器和准确但缓慢的交叉编码器。然而,在先前的ER基准测试中,一个具体的差距仍然没有得到解决:现有的研究通常是在孤立的或有限的数据集上评估架构。目前还不清楚哪些基本模型和体系结构最适合各种实际ER数据集,每个数据集都有独特的特征和性能瓶颈。本文通过广泛的实证评估弥合了这一差距。我们系统地比较了三种流行的预训练模型(MiniLM、MPNet和BGE),它们跨越三种不同的架构范式:预训练的双编码器、微调的双编码器和微调的交叉编码器。我们在八个不同的真实世界和半合成数据集上测试了这些组合,分析了它们的性能、训练成本和最终分辨率时间。我们的研究结果揭示了一个清晰的精度与效率的权衡,确定了微调的双编码器是性能和实际分辨率速度之间的最佳平衡。更重要的是,我们证明微调不是万能的解决方案。它的有效性在很大程度上取决于数据集:它通过修复预先存在的性能差距,在特定领域提供了实质性的收益,但在预训练模型已经很好地对齐的数据集上,它对性能是有害的。这些发现为从业者根据他们的特定数据和应用程序需求选择最佳模型和体系结构提供了实用指南。
{"title":"The impact of fine-tuning on entity resolution: An experimental evaluation","authors":"Dimitrios Karapiperis,&nbsp;Leonidas Akritidis,&nbsp;Panayiotis Bozanis","doi":"10.1016/j.knosys.2026.115427","DOIUrl":"10.1016/j.knosys.2026.115427","url":null,"abstract":"<div><div>Fine-tuning pre-trained language models has become the state-of-the-art approach for Entity Resolution (ER), but this has created a divide between two dominant architectures: fast-but-less-accurate bi-encoders and accurate-but-slow cross-encoders. However, a concrete gap in prior ER benchmarking remains unresolved: existing studies often evaluate architectures in isolation or on limited datasets. It remains unclear which base models and architectures are best suited for the diverse range of real-world ER datasets, each with unique characteristics and performance bottlenecks. This paper bridges this gap through an extensive empirical evaluation. We systematically compare three popular pre-trained models (MiniLM, MPNet, and BGE) across three distinct architectural paradigms: a pre-trained bi-encoder, a fine-tuned bi-encoder, and a fine-tuned cross-encoder. We tested these combinations on eight diverse real-world and semi-synthetic datasets, analyzing their performance, training costs, and final resolution times. Our results reveal a clear accuracy-vs-efficiency trade-off, identifying the fine-tuned bi-encoder as the optimal balance between performance and practical resolution speed. More importantly, we demonstrate that fine-tuning is not a universal solution. Its effectiveness is highly contingent on the dataset: it provides substantial gains on specialized domains by fixing pre-existing performance gaps but is detrimental to performance on datasets where pre-trained models are already well-aligned. These findings provide a practical guide for practitioners on selecting the optimal model and architecture based on their specific data and application requirements.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"338 ","pages":"Article 115427"},"PeriodicalIF":7.6,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146175312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
GADet: Geometry-Aware oriented object detection for remote sensing 面向遥感的几何感知目标检测
IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-08 Epub Date: 2026-02-04 DOI: 10.1016/j.knosys.2026.115475
Haodong Li , Yan Gong , Xinyu Zhang , Ziying Song , Lei Yang , Haicheng Qu
Oriented object detection in remote sensing images is a key technology for accurately perceiving the geometric properties of objects on the Earth’s surface, playing a significant role in smart cities, national defense and security, and disaster emergency response. However, existing anchor-free methods have obvious limitations in geometric feature adaptation and orientation-aware modeling, and their large number of parameters makes real-time deployment difficult. To address these issues, we propose the geometry-aware detector GADet, a single-stage anchor-free detector comprising three key components: a geometrically structured adaptive convolution (GSA-Conv) module for enhanced feature extraction, a rotation-sensitive attention (RSA) module for robust orientation awareness, and a channel-isomorphic adaptive (CIA) pruning method for model compression. Comprehensive experiments demonstrate that GADet achieves mAP scores of 76.90%, 70.20%, and 97.47% on the DOTA-v1.0, DIOR-R, and UCAS-AOD datasets, respectively, while running at 56.5 FPS, achieving the optimal balance between accuracy and efficiency compared to recent state-of-the-art methods.
遥感图像定向目标检测是准确感知地球表面物体几何特性的关键技术,在智慧城市、国防安全、灾害应急响应等方面具有重要作用。然而,现有的无锚方法在几何特征自适应和方向感知建模方面存在明显的局限性,且其参数较多,给实时部署带来困难。为了解决这些问题,我们提出了几何感知检测器GADet,这是一种单级无锚检测器,由三个关键组件组成:用于增强特征提取的几何结构自适应卷积(GSA-Conv)模块,用于鲁棒方向感知的旋转敏感注意(RSA)模块,以及用于模型压缩的通道同构自适应(CIA)修剪方法。综合实验表明,GADet在DOTA-v1.0、DIOR-R和UCAS-AOD数据集上的mAP得分分别为76.90%、70.20%和97.47%,运行速度为56.5 FPS,与目前最先进的方法相比,达到了精度和效率的最佳平衡。
{"title":"GADet: Geometry-Aware oriented object detection for remote sensing","authors":"Haodong Li ,&nbsp;Yan Gong ,&nbsp;Xinyu Zhang ,&nbsp;Ziying Song ,&nbsp;Lei Yang ,&nbsp;Haicheng Qu","doi":"10.1016/j.knosys.2026.115475","DOIUrl":"10.1016/j.knosys.2026.115475","url":null,"abstract":"<div><div>Oriented object detection in remote sensing images is a key technology for accurately perceiving the geometric properties of objects on the Earth’s surface, playing a significant role in smart cities, national defense and security, and disaster emergency response. However, existing anchor-free methods have obvious limitations in geometric feature adaptation and orientation-aware modeling, and their large number of parameters makes real-time deployment difficult. To address these issues, we propose the geometry-aware detector GADet, a single-stage anchor-free detector comprising three key components: a geometrically structured adaptive convolution (GSA-Conv) module for enhanced feature extraction, a rotation-sensitive attention (RSA) module for robust orientation awareness, and a channel-isomorphic adaptive (CIA) pruning method for model compression. Comprehensive experiments demonstrate that GADet achieves mAP scores of 76.90%, 70.20%, and 97.47% on the DOTA-v1.0, DIOR-R, and UCAS-AOD datasets, respectively, while running at 56.5 FPS, achieving the optimal balance between accuracy and efficiency compared to recent state-of-the-art methods.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"338 ","pages":"Article 115475"},"PeriodicalIF":7.6,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Neural probabilistic logic learning: A method for knowledge graph reasoning 神经概率逻辑学习:一种知识图推理方法
IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-08 Epub Date: 2026-02-09 DOI: 10.1016/j.knosys.2026.115513
Fengsong Sun , Xianchao Zhang , Jinyu Wang , Zhiguo Jiang
Knowledge graph (KG) reasoning aims to predict missing facts from known data. While rule-based methods achieve high precision, they suffer from scalability limitations in large-scale KGs. Conversely, embedding-based approaches scale efficiently but often compromise precision. To address this trade-off, we propose Neural Probabilistic Logic Learning (NPLL), a novel hybrid framework that simultaneously enhances accuracy and efficiency. NPLL integrates a scoring module to augment the expressive capacity of embedding networks without sacrificing model simplicity or reasoning performance. Furthermore, interpretability is improved through the integration of a Markov Logic Network (MLN) with variational inference. Extensive evaluations on eleven benchmark datasets demonstrate that NPLL consistently outperforms state-of-the-art methods in both accuracy and computational efficiency, yielding substantial improvements in reasoning quality.
知识图(KG)推理旨在从已知数据中预测缺失的事实。虽然基于规则的方法实现了高精度,但它们在大规模的KGs中受到可扩展性的限制。相反,基于嵌入的方法可以有效地扩展,但往往会损害精度。为了解决这种权衡,我们提出了神经概率逻辑学习(NPLL),这是一种同时提高准确性和效率的新型混合框架。NPLL集成了一个评分模块,在不牺牲模型简单性或推理性能的情况下增强嵌入网络的表达能力。此外,通过将马尔可夫逻辑网络(MLN)与变分推理相结合,提高了可解释性。对11个基准数据集的广泛评估表明,NPLL在准确性和计算效率方面始终优于最先进的方法,在推理质量方面取得了实质性的改进。
{"title":"Neural probabilistic logic learning: A method for knowledge graph reasoning","authors":"Fengsong Sun ,&nbsp;Xianchao Zhang ,&nbsp;Jinyu Wang ,&nbsp;Zhiguo Jiang","doi":"10.1016/j.knosys.2026.115513","DOIUrl":"10.1016/j.knosys.2026.115513","url":null,"abstract":"<div><div>Knowledge graph (KG) reasoning aims to predict missing facts from known data. While rule-based methods achieve high precision, they suffer from scalability limitations in large-scale KGs. Conversely, embedding-based approaches scale efficiently but often compromise precision. To address this trade-off, we propose Neural Probabilistic Logic Learning (NPLL), a novel hybrid framework that simultaneously enhances accuracy and efficiency. NPLL integrates a scoring module to augment the expressive capacity of embedding networks without sacrificing model simplicity or reasoning performance. Furthermore, interpretability is improved through the integration of a Markov Logic Network (MLN) with variational inference. Extensive evaluations on eleven benchmark datasets demonstrate that NPLL consistently outperforms state-of-the-art methods in both accuracy and computational efficiency, yielding substantial improvements in reasoning quality.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"338 ","pages":"Article 115513"},"PeriodicalIF":7.6,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146175148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dual-track diffusion: Structure-Guided high fidelity denoising for social recommendation 双轨扩散:结构导向的社会推荐高保真去噪
IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-08 Epub Date: 2026-02-07 DOI: 10.1016/j.knosys.2026.115448
Xu-Hua Yang , Zhen-Lei Huang , Gang-Feng Ma , Jia-Ning Xu
Social recommendation incorporates social network information into personalized recommendation systems, thus effectively mitigating data sparsity and cold-start issues. However, real-world social networks often contain noise, which significantly hinders the capture of authentic social preference information. Existing social denoising methods fall into two categories: “hard” denoising based on network reconstruction (which may severely damage the original network topology) and “soft” denoising based on user representation (which often overlooks node dependencies during the denoising process). To address these limitations, we propose a Structure-Guided High Fidelity Denoising framework for Social Recommendation (SGDSR). First, we design a dual-diffusion module that incorporates structural information by introducing network topology constraints into the diffusion process. This effectively preserves key social signals during denoising. Then, we employ contrastive learning to align representations from dual-diffusion pathways, enhancing consistency. Finally, we propose a fusion-denoising mechanism that refines integrated network information to improve representation robustness. Extensive experiments on three real-world datasets demonstrate that SGDSR outperforms state-of-the-art baselines. The code is available at https://github.com/Only-SR/SGDSR.
社交推荐将社交网络信息融入个性化推荐系统,有效缓解了数据稀疏性和冷启动问题。然而,现实世界的社会网络经常包含噪声,这极大地阻碍了真实社会偏好信息的获取。现有的社会去噪方法分为两类:基于网络重构的“硬”去噪(可能严重破坏原有的网络拓扑结构)和基于用户表示的“软”去噪(在去噪过程中往往忽略节点依赖关系)。为了解决这些限制,我们提出了一个结构导向的社会推荐高保真去噪框架(SGDSR)。首先,我们设计了一个双扩散模块,通过在扩散过程中引入网络拓扑约束来融合结构信息。这在去噪过程中有效地保留了关键的社会信号。然后,我们使用对比学习来对齐来自双扩散路径的表征,增强一致性。最后,我们提出了一种融合去噪机制,该机制对集成的网络信息进行细化,以提高表示的鲁棒性。在三个真实数据集上进行的大量实验表明,SGDSR优于最先进的基线。代码可在https://github.com/Only-SR/SGDSR上获得。
{"title":"Dual-track diffusion: Structure-Guided high fidelity denoising for social recommendation","authors":"Xu-Hua Yang ,&nbsp;Zhen-Lei Huang ,&nbsp;Gang-Feng Ma ,&nbsp;Jia-Ning Xu","doi":"10.1016/j.knosys.2026.115448","DOIUrl":"10.1016/j.knosys.2026.115448","url":null,"abstract":"<div><div>Social recommendation incorporates social network information into personalized recommendation systems, thus effectively mitigating data sparsity and cold-start issues. However, real-world social networks often contain noise, which significantly hinders the capture of authentic social preference information. Existing social denoising methods fall into two categories: “hard” denoising based on network reconstruction (which may severely damage the original network topology) and “soft” denoising based on user representation (which often overlooks node dependencies during the denoising process). To address these limitations, we propose a Structure-Guided High Fidelity Denoising framework for Social Recommendation (SGDSR). First, we design a dual-diffusion module that incorporates structural information by introducing network topology constraints into the diffusion process. This effectively preserves key social signals during denoising. Then, we employ contrastive learning to align representations from dual-diffusion pathways, enhancing consistency. Finally, we propose a fusion-denoising mechanism that refines integrated network information to improve representation robustness. Extensive experiments on three real-world datasets demonstrate that SGDSR outperforms state-of-the-art baselines. The code is available at <span><span>https://github.com/Only-SR/SGDSR</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"338 ","pages":"Article 115448"},"PeriodicalIF":7.6,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146175186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
HyTexNet: Percentile-guided local encoding and deep feature fusion for enhanced texture classification HyTexNet:用于增强纹理分类的百分位引导局部编码和深度特征融合
IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-08 Epub Date: 2026-02-02 DOI: 10.1016/j.knosys.2026.115482
Vandana Gupta , Ashish Mishra , Nishant Shrivastava
Texture classification remains a challenging problem in computer vision, particularly under variations in illumination, pose, and scale. While deep networks provide powerful semantic representations, they often overlook fine-grained local structures, whereas handcrafted descriptors, though interpretable, struggle with adaptability. To address these limitations, this paper introduces HyTexNet, a hybrid framework that fuses percentile-guided local encoding with deep embeddings from DenseNet-121. The proposed encoding scheme employs an adaptive threshold based on the 75th percentile of neighborhood intensity differences, enabling the descriptor to capture significant local contrasts while suppressing redundant variations. This local representation is combined with global semantic features obtained through global average pooling, and a lightweight fusion head optimizes the joint feature space for classification. Extensive experiments on four benchmark datasets (UIUC, Kylberg, Brodatz, and KTH-TIPS2b) demonstrate that HyTexNet achieves classification accuracies of 95.65%, 100%, 99.22%, and 99.79%, respectively, indicating consistently strong performance across diverse texture categories and imaging conditions. Additional evaluation on a challenging real-world texture dataset (DTD) further demonstrates the robustness and generalization capability of the proposed framework beyond controlled benchmark settings. In addition to accuracy, the framework is compact and computationally efficient, making it practical for scenarios with limited data and resources. These results position HyTexNet as a balanced alternative to recent texture analysis methods, offering a combination of robustness, interpretability, and scalability that bridges the gap between handcrafted and deep learning-based approaches.
纹理分类在计算机视觉中仍然是一个具有挑战性的问题,特别是在光照、姿态和比例变化的情况下。虽然深度网络提供了强大的语义表示,但它们往往忽略了细粒度的局部结构,而手工制作的描述符虽然可解释,但在适应性方面存在困难。为了解决这些限制,本文介绍了HyTexNet,这是一个混合框架,融合了来自DenseNet-121的百分位数引导的局部编码和深度嵌入。所提出的编码方案采用基于邻域强度差异的第75个百分位数的自适应阈值,使描述符能够捕获重要的局部对比,同时抑制冗余变化。该局部表示与通过全局平均池化获得的全局语义特征相结合,轻量级融合头优化联合特征空间进行分类。在UIUC、Kylberg、Brodatz和KTH-TIPS2b四个基准数据集上进行的大量实验表明,HyTexNet的分类准确率分别达到95.65%、100%、99.22%和99.79%,表明在不同纹理类别和成像条件下,HyTexNet的分类准确率始终保持在较高水平。对具有挑战性的真实世界纹理数据集(DTD)的额外评估进一步证明了所提出框架在受控基准设置之外的鲁棒性和泛化能力。除了准确性之外,该框架紧凑且计算效率高,使其适用于数据和资源有限的场景。这些结果将HyTexNet定位为当前纹理分析方法的平衡替代方案,提供鲁棒性、可解释性和可扩展性的组合,弥补了手工方法和基于深度学习的方法之间的差距。
{"title":"HyTexNet: Percentile-guided local encoding and deep feature fusion for enhanced texture classification","authors":"Vandana Gupta ,&nbsp;Ashish Mishra ,&nbsp;Nishant Shrivastava","doi":"10.1016/j.knosys.2026.115482","DOIUrl":"10.1016/j.knosys.2026.115482","url":null,"abstract":"<div><div>Texture classification remains a challenging problem in computer vision, particularly under variations in illumination, pose, and scale. While deep networks provide powerful semantic representations, they often overlook fine-grained local structures, whereas handcrafted descriptors, though interpretable, struggle with adaptability. To address these limitations, this paper introduces HyTexNet, a hybrid framework that fuses percentile-guided local encoding with deep embeddings from DenseNet-121. The proposed encoding scheme employs an adaptive threshold based on the 75th percentile of neighborhood intensity differences, enabling the descriptor to capture significant local contrasts while suppressing redundant variations. This local representation is combined with global semantic features obtained through global average pooling, and a lightweight fusion head optimizes the joint feature space for classification. Extensive experiments on four benchmark datasets (UIUC, Kylberg, Brodatz, and KTH-TIPS2b) demonstrate that HyTexNet achieves classification accuracies of 95.65%, 100%, 99.22%, and 99.79%, respectively, indicating consistently strong performance across diverse texture categories and imaging conditions. Additional evaluation on a challenging real-world texture dataset (DTD) further demonstrates the robustness and generalization capability of the proposed framework beyond controlled benchmark settings. In addition to accuracy, the framework is compact and computationally efficient, making it practical for scenarios with limited data and resources. These results position HyTexNet as a balanced alternative to recent texture analysis methods, offering a combination of robustness, interpretability, and scalability that bridges the gap between handcrafted and deep learning-based approaches.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"338 ","pages":"Article 115482"},"PeriodicalIF":7.6,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146175316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Knowledge-Based Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1