首页 > 最新文献

Information Processing & Management最新文献

英文 中文
DisenKT: A variational attention-based approach for disentangled cross-domain knowledge tracing DisenKT:一种基于变分注意力的非纠缠跨领域知识追踪方法
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-12-29 DOI: 10.1016/j.ipm.2025.104582
Yuqi Liu , Zhengyang Wu , Ke Deng , Zetao Zheng , Changqin Huang
Most knowledge tracing (KT) models are trained and applied within a single domain, limiting their ability to fully leverage shared information across different domains. In cross-domain knowledge tracing (CDKT) tasks, existing methods struggle to accurately distinguish useful knowledge from irrelevant noise, often resulting in negative transfer that significantly impairs model performance and generalization. To mitigate the impact of negative transfer, we propose a novel CDKT framework-DisenKT. Built on a Variational Attention Autoencoder (VAAE), which combines a variational autoencoder with a hierarchical attention mechanism, DisenKT encodes student interaction sequences and disentangles the latent knowledge state into domain-exclusive and domain-shared representations. To effectively separate these two types of representations, we employ mutual information minimization as a regularization strategy. This enables the model to focus on transferable knowledge while suppressing irrelevant information, thereby improving prediction accuracy and generalization. We evaluated DisenKT on four real-world datasets (ASSISTments 2009, Junyi, KDD Cup 2006–2007 Algebra, and PTADisc). The results demonstrate that, in course-level CDKT tasks, DisenKT achieves an average improvement of approximately 3.09% in AUC and 1.50% in ACC compared to the best baseline. In student-level CDKT tasks, the model attains improvements of around 0.72% in AUC and 3.50% in ACC. These findings strongly validate the effectiveness of DisenKT in cross-domain knowledge transfer.
大多数知识跟踪(KT)模型都是在单个领域内训练和应用的,这限制了它们在不同领域之间充分利用共享信息的能力。在跨领域知识跟踪(CDKT)任务中,现有的方法很难准确地将有用的知识与无关的噪声区分开来,这通常会导致严重影响模型性能和泛化的负迁移。为了减轻负迁移的影响,我们提出了一个新的CDKT框架- disenkt。DisenKT基于变分注意自编码器(VAAE),将变分自编码器与分层注意机制相结合,对学生交互序列进行编码,并将潜在的知识状态分解为领域独占和领域共享的表示。为了有效地分离这两种类型的表示,我们采用互信息最小化作为正则化策略。这使得模型能够专注于可转移的知识,同时抑制不相关的信息,从而提高预测的准确性和泛化。我们在四个真实数据集(ASSISTments 2009、Junyi、KDD Cup 2006-2007 Algebra和PTADisc)上评估了DisenKT。结果表明,在课程级CDKT任务中,与最佳基线相比,DisenKT在AUC和ACC方面平均提高了约3.09%和1.50%。在学生级CDKT任务中,该模型在AUC和ACC方面分别提高了0.72%和3.50%。这些发现有力地验证了DisenKT在跨领域知识转移中的有效性。
{"title":"DisenKT: A variational attention-based approach for disentangled cross-domain knowledge tracing","authors":"Yuqi Liu ,&nbsp;Zhengyang Wu ,&nbsp;Ke Deng ,&nbsp;Zetao Zheng ,&nbsp;Changqin Huang","doi":"10.1016/j.ipm.2025.104582","DOIUrl":"10.1016/j.ipm.2025.104582","url":null,"abstract":"<div><div>Most knowledge tracing (KT) models are trained and applied within a single domain, limiting their ability to fully leverage shared information across different domains. In cross-domain knowledge tracing (CDKT) tasks, existing methods struggle to accurately distinguish useful knowledge from irrelevant noise, often resulting in negative transfer that significantly impairs model performance and generalization. To mitigate the impact of negative transfer, we propose a novel CDKT framework-DisenKT. Built on a Variational Attention Autoencoder (VAAE), which combines a variational autoencoder with a hierarchical attention mechanism, DisenKT encodes student interaction sequences and disentangles the latent knowledge state into domain-exclusive and domain-shared representations. To effectively separate these two types of representations, we employ mutual information minimization as a regularization strategy. This enables the model to focus on transferable knowledge while suppressing irrelevant information, thereby improving prediction accuracy and generalization. We evaluated DisenKT on four real-world datasets (ASSISTments 2009, Junyi, KDD Cup 2006–2007 Algebra, and PTADisc). The results demonstrate that, in course-level CDKT tasks, DisenKT achieves an average improvement of approximately 3.09% in AUC and 1.50% in ACC compared to the best baseline. In student-level CDKT tasks, the model attains improvements of around 0.72% in AUC and 3.50% in ACC. These findings strongly validate the effectiveness of DisenKT in cross-domain knowledge transfer.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 3","pages":"Article 104582"},"PeriodicalIF":6.9,"publicationDate":"2025-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145924780","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
Question-guided attention and cross-modal alignment for knowledge-based visual question answering 基于知识的视觉问答的问题引导注意力和跨模态对齐
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-12-24 DOI: 10.1016/j.ipm.2025.104578
Wei Li , Fuyun Deng , Zhixin Li
Visual Question Answering (VQA) systems face significant challenges when addressing complex queries requiring external knowledge. Existing approaches often struggle to align visual and textual features effectively and leverage structured knowledge bases. This paper introduces a novel framework designed to address these challenges through three core innovations. First, Question-Guided Attention (QGA) adaptively directs the model’s focus to visual regions and knowledge entities that are semantically aligned with the query, ensuring contextually relevant information is prioritized during feature extraction. Second, Cross-Modal Alignment (CMA) employs a contrastive learning strategy to enforce precise alignment across visual, textual, and knowledge modalities, mitigating the impact of spurious correlations by enhancing semantic consistency between heterogeneous data sources. Third, Dynamic Knowledge Integration (DKI) enables the model to dynamically select and fuse knowledge information from external graph structures, augmenting its reasoning capacity. The experimental results show that our proposed method achieved the state-of-the-art results with 47.05 % on OK-VQA, while attaining 69.76 % accuracy on VQA v2.
可视化问答(VQA)系统在处理需要外部知识的复杂查询时面临重大挑战。现有的方法常常难以有效地对齐视觉和文本特征,并利用结构化的知识库。本文介绍了一个新的框架,旨在通过三个核心创新来解决这些挑战。首先,问题引导注意(QGA)自适应地将模型的焦点引导到语义上与查询一致的视觉区域和知识实体上,确保在特征提取过程中优先考虑与上下文相关的信息。其次,跨模态对齐(Cross-Modal Alignment, CMA)采用对比学习策略强制视觉、文本和知识模态之间的精确对齐,通过增强异构数据源之间的语义一致性来减轻虚假相关性的影响。第三,动态知识集成(DKI)使模型能够从外部图结构中动态选择和融合知识信息,增强模型的推理能力。实验结果表明,该方法在OK-VQA上的准确率为47.05%,在VQA v2上的准确率为69.76%。
{"title":"Question-guided attention and cross-modal alignment for knowledge-based visual question answering","authors":"Wei Li ,&nbsp;Fuyun Deng ,&nbsp;Zhixin Li","doi":"10.1016/j.ipm.2025.104578","DOIUrl":"10.1016/j.ipm.2025.104578","url":null,"abstract":"<div><div>Visual Question Answering (VQA) systems face significant challenges when addressing complex queries requiring external knowledge. Existing approaches often struggle to align visual and textual features effectively and leverage structured knowledge bases. This paper introduces a novel framework designed to address these challenges through three core innovations. First, Question-Guided Attention (QGA) adaptively directs the model’s focus to visual regions and knowledge entities that are semantically aligned with the query, ensuring contextually relevant information is prioritized during feature extraction. Second, Cross-Modal Alignment (CMA) employs a contrastive learning strategy to enforce precise alignment across visual, textual, and knowledge modalities, mitigating the impact of spurious correlations by enhancing semantic consistency between heterogeneous data sources. Third, Dynamic Knowledge Integration (DKI) enables the model to dynamically select and fuse knowledge information from external graph structures, augmenting its reasoning capacity. The experimental results show that our proposed method achieved the state-of-the-art results with 47.05 % on OK-VQA, while attaining 69.76 % accuracy on VQA v2.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 3","pages":"Article 104578"},"PeriodicalIF":6.9,"publicationDate":"2025-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145840330","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
MPRG:A unified framework for knowledge graph reasoning via pattern-aware relation graph MPRG:基于模式感知关系图的知识图推理的统一框架
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-12-23 DOI: 10.1016/j.ipm.2025.104570
Zhiwen Xie , Meiling Wang , Po Hu
Knowledge graph reasoning (KGR) aims to infer missing links in knowledge graphs (KGs). Traditional methods in transductive settings suffer from poor generalizability to unseen entities and relations. Recently, inductive paradigms have emerged to address this limitation by learning a unified reasoning model transferable across KGs. However, current inductive approaches typically rely on relation co-occurrence interaction, which fails to capture richer relation patterns such as symmetry and composition patterns that have been shown to be critical for effective KGR. In this paper, we propose a Multi-Pattern Relational Graph (MPRG) model, a novel inductive reasoning framework that explicitly models complex relational patterns in KGs. Our method first mines interpretable reasoning rules to extract structural relation patterns, which are then used to construct a pattern-aware relational graph. Build upon this relational graph, a pattern-aware relation representation module is applied to learn expressive relation embeddings through structured message passing. These enriched relation representations are further used to guide entity-level reasoning via a relation-guided entity reasoning module. We evaluate MPRG on 43 KGR benchmark datasets across transductive, inductive, and fully-inductive settings. Experimental results show that MPRG consistently achieves state-of-the-art performance with particularly strong results under the inductive setting. Moreover, MPRG achieves substantial average improvements of 2.1 % in MRR and 2.9 % in Hit@10 across all 43 datasets over existing methods, demonstrating its effectiveness and strong generalization capability across diverse KGR tasks.
知识图推理(Knowledge graph reasoning, KGR)旨在推断知识图中缺失的环节。传统方法在转导设置中存在对不可见实体和关系的泛化能力差的问题。最近出现了归纳范式,通过学习可在KGR之间转移的统一推理模型来解决这一限制。然而,目前的归纳方法通常依赖于关系共现交互作用,无法捕获更丰富的关系模式,如对称性和组合模式,这些模式已被证明对有效的KGR至关重要。本文提出了一个多模式关系图(MPRG)模型,该模型是一种新的归纳推理框架,可以显式地对KGs中的复杂关系模式进行建模。我们的方法首先挖掘可解释的推理规则来提取结构关系模式,然后将其用于构建模式感知的关系图。在此关系图的基础上,应用模式感知关系表示模块,通过结构化消息传递学习表达关系嵌入。这些丰富的关系表示通过关系导向的实体推理模块进一步用于指导实体级推理。我们在43个KGR基准数据集上评估了MPRG,包括传导、感应和全感应设置。实验结果表明,在感应设置下,MPRG始终能够达到最先进的性能,并且效果特别强。此外,与现有方法相比,MPRG在所有43个数据集上的MRR平均提高了2.1%,Hit@10平均提高了2.9%,证明了其在不同KGR任务中的有效性和强大的泛化能力。
{"title":"MPRG:A unified framework for knowledge graph reasoning via pattern-aware relation graph","authors":"Zhiwen Xie ,&nbsp;Meiling Wang ,&nbsp;Po Hu","doi":"10.1016/j.ipm.2025.104570","DOIUrl":"10.1016/j.ipm.2025.104570","url":null,"abstract":"<div><div>Knowledge graph reasoning (KGR) aims to infer missing links in knowledge graphs (KGs). Traditional methods in transductive settings suffer from poor generalizability to unseen entities and relations. Recently, inductive paradigms have emerged to address this limitation by learning a unified reasoning model transferable across KGs. However, current inductive approaches typically rely on relation co-occurrence interaction, which fails to capture richer relation patterns such as symmetry and composition patterns that have been shown to be critical for effective KGR. In this paper, we propose a Multi-Pattern Relational Graph (MPRG) model, a novel inductive reasoning framework that explicitly models complex relational patterns in KGs. Our method first mines interpretable reasoning rules to extract structural relation patterns, which are then used to construct a pattern-aware relational graph. Build upon this relational graph, a pattern-aware relation representation module is applied to learn expressive relation embeddings through structured message passing. These enriched relation representations are further used to guide entity-level reasoning via a relation-guided entity reasoning module. We evaluate MPRG on 43 KGR benchmark datasets across transductive, inductive, and fully-inductive settings. Experimental results show that MPRG consistently achieves state-of-the-art performance with particularly strong results under the inductive setting. Moreover, MPRG achieves substantial average improvements of 2.1 % in MRR and 2.9 % in Hit@10 across all 43 datasets over existing methods, demonstrating its effectiveness and strong generalization capability across diverse KGR tasks.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 3","pages":"Article 104570"},"PeriodicalIF":6.9,"publicationDate":"2025-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145839838","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
Multimodal learning for early prediction of COVID-19 outbreaks 用于COVID-19疫情早期预测的多模式学习
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-12-23 DOI: 10.1016/j.ipm.2025.104562
Jiwon Kim , Hyolim Jeon , Minhan Cho , Jiwon Kang , Shibo He , Jinyoung Han
The coronavirus disease 2019 (COVID-19) pandemic, which emerged in early 2020, has significantly affected global health and socioeconomic conditions. With significant fluctuations in case numbers, especially during critical events such as changes in the definition of the disease and diagnostic criteria, the need for accurate and early prediction of case numbers has become imperative. This study investigated the prediction of COVID-19 cases during the initial stages by merging (i) physical and behavioral data found in contact graphs and (ii) social media data. Recognizing the research gap in these multiple data modalities, we explored their potential synergy and the ensuing interplay between them to enhance the accuracy of outbreak prediction. To improve the predictive performance, we leveraged a cross-modal attention mechanism and investigated various fusion techniques. The major contributions of this study include the innovative use of multimodal data features and the development of a comprehensive methodology that integrates these features, allowing for a detailed analysis of the early dynamics of the COVID-19 pandemic. The paper concludes with a thorough discussion of the experimental results and outlines directions for future research on pandemic prediction modeling.
2019冠状病毒病(COVID-19)大流行于2020年初出现,对全球卫生和社会经济状况产生了重大影响。随着病例数的大幅波动,特别是在疾病定义和诊断标准发生变化等关键事件期间,对病例数进行准确和早期预测已成为当务之急。本研究通过合并(i)接触图中的身体和行为数据和(ii)社交媒体数据,调查了COVID-19病例在初始阶段的预测。认识到这些多种数据模式的研究差距,我们探索了它们的潜在协同作用以及它们之间随后的相互作用,以提高疫情预测的准确性。为了提高预测性能,我们利用了跨模态注意机制并研究了各种融合技术。本研究的主要贡献包括创新地使用了多模态数据特征,并开发了一种综合这些特征的综合方法,从而能够详细分析COVID-19大流行的早期动态。论文最后对实验结果进行了深入的讨论,并概述了流行病预测建模的未来研究方向。
{"title":"Multimodal learning for early prediction of COVID-19 outbreaks","authors":"Jiwon Kim ,&nbsp;Hyolim Jeon ,&nbsp;Minhan Cho ,&nbsp;Jiwon Kang ,&nbsp;Shibo He ,&nbsp;Jinyoung Han","doi":"10.1016/j.ipm.2025.104562","DOIUrl":"10.1016/j.ipm.2025.104562","url":null,"abstract":"<div><div>The coronavirus disease 2019 (COVID-19) pandemic, which emerged in early 2020, has significantly affected global health and socioeconomic conditions. With significant fluctuations in case numbers, especially during critical events such as changes in the definition of the disease and diagnostic criteria, the need for accurate and early prediction of case numbers has become imperative. This study investigated the prediction of COVID-19 cases during the initial stages by merging (i) physical and behavioral data found in contact graphs and (ii) social media data. Recognizing the research gap in these multiple data modalities, we explored their potential synergy and the ensuing interplay between them to enhance the accuracy of outbreak prediction. To improve the predictive performance, we leveraged a cross-modal attention mechanism and investigated various fusion techniques. The major contributions of this study include the innovative use of multimodal data features and the development of a comprehensive methodology that integrates these features, allowing for a detailed analysis of the early dynamics of the COVID-19 pandemic. The paper concludes with a thorough discussion of the experimental results and outlines directions for future research on pandemic prediction modeling.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 3","pages":"Article 104562"},"PeriodicalIF":6.9,"publicationDate":"2025-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145839839","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
A mechanistic study on the impact of entity degree distribution in open-world link prediction 开放世界连接预测中实体度分布影响的机理研究
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-12-23 DOI: 10.1016/j.ipm.2025.104565
Dinghong Lai, Jiang Xiaobo, Yongru Chen, Dongwei Hu
Current research in open-world link prediction typically attributes performance limitations to insufficient entity representation and a lack of entity-relation interaction. Consequently, most proposed improvements focus on addressing these specific issues. However, this research paradigm has yielded limited gains on benchmark datasets with stricter standards, such as FB15K-237-OWE, where inverse relations are explicitly removed. This outcome indicates that existing methods have not yet overcome the constraints imposed by the dataset’s structural characteristics. The underlying cause appears to be a lack of insight into how these structural features fundamentally influence model performance. Therefore, this study focuses on the FB15K-237-OWE knowledge graph dataset to explore the mechanisms by which its structural characteristics affect open-world link prediction performance. First, by designing a subgraph sampling method and conducting Sobol sensitivity analysis, we demonstrate the significant impact of entity degree distribution on model performance. Second, correlation analysis reveals a positive correlation between entity degree and prediction performance. Furthermore, this study investigates how entity link degree influences embedding space distribution and weight updates during neural network training, uncovering its deep impact on performance. Finally, to validate the utility of this mechanistic insight, we designed a targeted experiment to mitigate the imbalance caused by the identified gradient dominance effect. This approach yielded improvements of 2 % to 3 % across all metrics. This study lays the foundation for targeted improvements in open-world link prediction models.
目前开放世界链路预测的研究通常将性能限制归因于实体表示不足和缺乏实体-关系交互。因此,大多数建议的改进都集中在解决这些具体问题上。然而,这种研究范式在具有更严格标准的基准数据集上的收益有限,例如FB15K-237-OWE,其中明确删除了反比关系。这一结果表明,现有方法尚未克服数据集结构特征所施加的限制。潜在的原因似乎是缺乏对这些结构特征如何从根本上影响模型性能的洞察力。因此,本研究以FB15K-237-OWE知识图谱数据集为研究对象,探讨其结构特征影响开放世界链路预测性能的机制。首先,通过设计子图采样方法并进行Sobol敏感性分析,我们证明了实体度分布对模型性能的显著影响。其次,相关分析表明实体度与预测绩效呈正相关。此外,本研究还探讨了实体链接度对神经网络训练过程中嵌入空间分布和权重更新的影响,揭示了其对性能的深刻影响。最后,为了验证这一机制的效用,我们设计了一个有针对性的实验来减轻由确定的梯度优势效应引起的不平衡。这种方法在所有指标上产生了2%到3%的改进。本研究为有针对性地改进开放世界链路预测模型奠定了基础。
{"title":"A mechanistic study on the impact of entity degree distribution in open-world link prediction","authors":"Dinghong Lai,&nbsp;Jiang Xiaobo,&nbsp;Yongru Chen,&nbsp;Dongwei Hu","doi":"10.1016/j.ipm.2025.104565","DOIUrl":"10.1016/j.ipm.2025.104565","url":null,"abstract":"<div><div>Current research in open-world link prediction typically attributes performance limitations to insufficient entity representation and a lack of entity-relation interaction. Consequently, most proposed improvements focus on addressing these specific issues. However, this research paradigm has yielded limited gains on benchmark datasets with stricter standards, such as FB15K-237-OWE, where inverse relations are explicitly removed. This outcome indicates that existing methods have not yet overcome the constraints imposed by the dataset’s structural characteristics. The underlying cause appears to be a lack of insight into how these structural features fundamentally influence model performance. Therefore, this study focuses on the FB15K-237-OWE knowledge graph dataset to explore the mechanisms by which its structural characteristics affect open-world link prediction performance. First, by designing a subgraph sampling method and conducting Sobol sensitivity analysis, we demonstrate the significant impact of entity degree distribution on model performance. Second, correlation analysis reveals a positive correlation between entity degree and prediction performance. Furthermore, this study investigates how entity link degree influences embedding space distribution and weight updates during neural network training, uncovering its deep impact on performance. Finally, to validate the utility of this mechanistic insight, we designed a targeted experiment to mitigate the imbalance caused by the identified gradient dominance effect. This approach yielded improvements of 2 % to 3 % across all metrics. This study lays the foundation for targeted improvements in open-world link prediction models.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 3","pages":"Article 104565"},"PeriodicalIF":6.9,"publicationDate":"2025-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145840331","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
Syn-T5: Syntax-aware fine-tuning for aspect sentiment triplet extraction Syn-T5:面向方面情感三元组提取的语法感知微调
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-12-23 DOI: 10.1016/j.ipm.2025.104564
Wang Zou, Xia Sun, Jun Feng, Yaqiong Xing, Xiaodi Zhao
Aspect Sentiment Triplet Extraction (ASTE) aims to extract aspect terms, opinion terms, and identify the corresponding sentiment polarity from the text. However, current generative methods overlook the syntactic prior knowledge introduced by prompts, and the consistency of the generated triplet sequences still needs further improvement. To address the above issues, this paper proposes a syntax-aware fine-tuning method based on the T5 model for the ASTE task (Syn-T5). Specifically, this method is applicable to fine-tuning encoder-decoder Pre-trained Language Models (PLMs). Firstly, we construct syntactic prompts using noun cues, part-of-speech tags, and dependency information to provide the T5 encoder with contextual syntactic prior knowledge. Then, we design a Syntactic Cross-Attention (SCA) module to capture the syntactic dependencies between aspect and opinion terms within the encoder’s hidden representations. Finally, a triplet optimization strategy is employed to enhance the consistency of triplet sequence generation in the T5 decoder. We conduct extensive experiments on three public datasets: ASTE-Data-v2, ASTE-Data-v1, and DMASTE. The main experimental results show that Syn-T5 outperforms baseline models with an F1 score improvement of 1.2 % to 2 % on the ASTE-Data-v2 dataset, 1.15 % to 1.77 % on the ASTE-Data-v1 dataset, and an average improvement of around 1.5 % on the DMASTE dataset. Moreover, ablation and visualization experiments verify the effectiveness of the syntactic prompts and the SCA module. The source codeis available on https://github.com/ZouWang-spider/Syn-T5
面向情感三联体提取(ASTE)的目的是从文本中提取面向术语、观点术语,并识别相应的情感极性。然而,目前的生成方法忽略了提示语引入的句法先验知识,生成的三联体序列的一致性有待进一步提高。针对上述问题,本文提出了一种基于T5模型的基于句法感知的ASTE任务微调方法(Syn-T5)。具体来说,该方法适用于编码器-解码器预训练语言模型(plm)的微调。首先,我们使用名词线索、词性标签和依赖信息构建句法提示,为T5编码器提供上下文句法先验知识。然后,我们设计了一个语法交叉注意(SCA)模块来捕获编码器隐藏表示中的方面和意见术语之间的语法依赖关系。最后,采用三元组优化策略提高T5解码器中三元组序列生成的一致性。我们在三个公共数据集上进行了广泛的实验:ASTE-Data-v2、ASTE-Data-v1和daste。主要实验结果表明,Syn-T5优于基线模型,在ast - data -v2数据集上F1分数提高了1.2%至2%,在ast - data -v1数据集上提高了1.15%至1.77%,在DMASTE数据集上平均提高了1.5%左右。此外,消融实验和可视化实验验证了语法提示和SCA模块的有效性。源代码可在https://github.com/ZouWang-spider/Syn-T5上获得
{"title":"Syn-T5: Syntax-aware fine-tuning for aspect sentiment triplet extraction","authors":"Wang Zou,&nbsp;Xia Sun,&nbsp;Jun Feng,&nbsp;Yaqiong Xing,&nbsp;Xiaodi Zhao","doi":"10.1016/j.ipm.2025.104564","DOIUrl":"10.1016/j.ipm.2025.104564","url":null,"abstract":"<div><div>Aspect Sentiment Triplet Extraction (ASTE) aims to extract aspect terms, opinion terms, and identify the corresponding sentiment polarity from the text. However, current generative methods overlook the syntactic prior knowledge introduced by prompts, and the consistency of the generated triplet sequences still needs further improvement. To address the above issues, this paper proposes a syntax-aware fine-tuning method based on the T5 model for the ASTE task (Syn-T5). Specifically, this method is applicable to fine-tuning encoder-decoder Pre-trained Language Models (PLMs). Firstly, we construct syntactic prompts using noun cues, part-of-speech tags, and dependency information to provide the T5 encoder with contextual syntactic prior knowledge. Then, we design a Syntactic Cross-Attention (SCA) module to capture the syntactic dependencies between aspect and opinion terms within the encoder’s hidden representations. Finally, a triplet optimization strategy is employed to enhance the consistency of triplet sequence generation in the T5 decoder. We conduct extensive experiments on three public datasets: ASTE-Data-v2, ASTE-Data-v1, and DMASTE. The main experimental results show that Syn-T5 outperforms baseline models with an F1 score improvement of 1.2 % to 2 % on the ASTE-Data-v2 dataset, 1.15 % to 1.77 % on the ASTE-Data-v1 dataset, and an average improvement of around 1.5 % on the DMASTE dataset. Moreover, ablation and visualization experiments verify the effectiveness of the syntactic prompts and the SCA module. The source codeis available on <span><span>https://github.com/ZouWang-spider/Syn-T5</span><svg><path></path></svg></span></div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 3","pages":"Article 104564"},"PeriodicalIF":6.9,"publicationDate":"2025-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145840335","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
Label acceptance based label propagation algorithm for community detection 基于标签接受度的标签传播社区检测算法
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-12-22 DOI: 10.1016/j.ipm.2025.104573
Xunlian Wu , Anqi Zhang , Jingqi Hu , Han Zhang , Yining Quan , Qiguang Miao , Peng Gang Sun
Community detection plays a crucial role in network analysis. While the Label Propagation Algorithm (LPA) is known for its efficiency, it suffers from unstable results due to random label updates and the inability to capture higher-order structural information. To address these limitations, we propose LALPA (Label Acceptance-based Label Propagation Algorithm) for community detection. LALPA introduces a node importance measure based on neighbor similarity to guide a stable, ordered label update process. To better capture structural information, we reconstruct the network topology by integrating both low-order (adjacent links) and high-order (motif-based) interactions, modeling node influence acceptance. Label acceptance is then determined by combining node importance and influence acceptance. A novel propagation strategy is designed to aggregate labels not only from current neighbors but also from those sharing the same label. Extensive experiments on 10 real-world and 24 synthetic networks show that LALPA consistently outperforms state-of-the-art methods, especially in networks with unobvious community structures. In particular, on all unattributed graphs, LALPA achieves an average performance gain of 2.69 % over the best baseline.
社区检测在网络分析中起着至关重要的作用。虽然标签传播算法(LPA)以其效率而闻名,但由于随机标签更新和无法捕获高阶结构信息,它的结果不稳定。为了解决这些限制,我们提出了LALPA(基于标签接受的标签传播算法)用于社区检测。LALPA引入了一个基于邻居相似度的节点重要性度量来指导一个稳定有序的标签更新过程。为了更好地捕获结构信息,我们通过整合低阶(相邻链接)和高阶(基于图案的)交互来重建网络拓扑,建模节点影响接受度。然后通过结合节点重要性和影响接受度来确定标签接受度。设计了一种新的传播策略,不仅可以聚合当前邻居的标签,还可以聚合共享同一标签的标签。在10个真实网络和24个合成网络上进行的大量实验表明,LALPA始终优于最先进的方法,特别是在具有不明显社区结构的网络中。特别是,在所有未归属图上,LALPA在最佳基线上实现了2.69%的平均性能增益。
{"title":"Label acceptance based label propagation algorithm for community detection","authors":"Xunlian Wu ,&nbsp;Anqi Zhang ,&nbsp;Jingqi Hu ,&nbsp;Han Zhang ,&nbsp;Yining Quan ,&nbsp;Qiguang Miao ,&nbsp;Peng Gang Sun","doi":"10.1016/j.ipm.2025.104573","DOIUrl":"10.1016/j.ipm.2025.104573","url":null,"abstract":"<div><div>Community detection plays a crucial role in network analysis. While the Label Propagation Algorithm (LPA) is known for its efficiency, it suffers from unstable results due to random label updates and the inability to capture higher-order structural information. To address these limitations, we propose LALPA (Label Acceptance-based Label Propagation Algorithm) for community detection. LALPA introduces a node importance measure based on neighbor similarity to guide a stable, ordered label update process. To better capture structural information, we reconstruct the network topology by integrating both low-order (adjacent links) and high-order (motif-based) interactions, modeling node influence acceptance. Label acceptance is then determined by combining node importance and influence acceptance. A novel propagation strategy is designed to aggregate labels not only from current neighbors but also from those sharing the same label. Extensive experiments on 10 real-world and 24 synthetic networks show that LALPA consistently outperforms state-of-the-art methods, especially in networks with unobvious community structures. In particular, on all unattributed graphs, LALPA achieves an average performance gain of 2.69 % over the best baseline.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 3","pages":"Article 104573"},"PeriodicalIF":6.9,"publicationDate":"2025-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145840334","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
Representation learning for 12-lead ECGs via dual-view conditional diffusion and lead-aware attention 基于双视条件扩散和铅觉注意的12导联脑电图表征学习
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-12-22 DOI: 10.1016/j.ipm.2025.104569
Fanyi Yang , Xue Li , Wentao Wang , Xiguo Yuan
Recent advances in ECG representation learning have leveraged frequency-domain information to improve representation quality, yet most methods still suffer from inadequate view fusion and coarse-grained modeling of inter-lead structural dependencies. To address these challenges, we propose D2VLA, a novel framework for 12-lead ECG representation learning that integrates dual-view conditional diffusion with a lead-aware dual-attention mechanism. The diffusion module enables semantic alignment between time-domain and frequency-domain views through denoising-based conditional guidance, while the attention module jointly models the temporal dynamics of individual leads and the spatial relationships among leads within a unified encoder. In addition, we introduce a patch-level contrastive objective to further enhance the discriminative capability of the learned representations. Extensive experiments on three real-world ECG datasets demonstrate that D2VLA achieves competitive performance on classification tasks against eight baseline models, improving accuracy by 4.6 % on PTB-XL and by 4.5 % on CPSC, and achieving AUROC improvement of about 4.0 % on Chapman, thereby highlighting its superior structural modeling capability.
心电表征学习的最新进展利用频域信息来提高表征质量,但大多数方法仍然存在视图融合不足和导联间结构依赖性粗粒度建模的问题。为了解决这些挑战,我们提出了D2VLA,这是一种用于12导联ECG表征学习的新框架,它将双视图条件扩散与导联感知双注意机制集成在一起。扩散模块通过基于去噪的条件引导实现时域和频域视图之间的语义对齐,而注意力模块在统一的编码器中联合建模单个导联的时间动态和导联之间的空间关系。此外,我们引入了一个补丁级对比目标来进一步增强学习表征的判别能力。在三个真实心电图数据集上进行的大量实验表明,D2VLA在8个基线模型的分类任务上取得了具有竞争力的性能,在PTB-XL上提高了4.6%,在CPSC上提高了4.5%,在Chapman上实现了约4.0%的AUROC改进,从而突出了其优越的结构建模能力。
{"title":"Representation learning for 12-lead ECGs via dual-view conditional diffusion and lead-aware attention","authors":"Fanyi Yang ,&nbsp;Xue Li ,&nbsp;Wentao Wang ,&nbsp;Xiguo Yuan","doi":"10.1016/j.ipm.2025.104569","DOIUrl":"10.1016/j.ipm.2025.104569","url":null,"abstract":"<div><div>Recent advances in ECG representation learning have leveraged frequency-domain information to improve representation quality, yet most methods still suffer from inadequate view fusion and coarse-grained modeling of inter-lead structural dependencies. To address these challenges, we propose D<sup>2</sup>VLA, a novel framework for 12-lead ECG representation learning that integrates dual-view conditional diffusion with a lead-aware dual-attention mechanism. The diffusion module enables semantic alignment between time-domain and frequency-domain views through denoising-based conditional guidance, while the attention module jointly models the temporal dynamics of individual leads and the spatial relationships among leads within a unified encoder. In addition, we introduce a patch-level contrastive objective to further enhance the discriminative capability of the learned representations. Extensive experiments on three real-world ECG datasets demonstrate that D<sup>2</sup>VLA achieves competitive performance on classification tasks against eight baseline models, improving accuracy by 4.6 % on PTB-XL and by 4.5 % on CPSC, and achieving AUROC improvement of about 4.0 % on Chapman, thereby highlighting its superior structural modeling capability.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 3","pages":"Article 104569"},"PeriodicalIF":6.9,"publicationDate":"2025-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145840332","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
Multimodal hierarchical classification using cascade-of-thought 使用思维级联的多模态分层分类
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-12-21 DOI: 10.1016/j.ipm.2025.104555
Jingrui Hou , Zhihang Tan , Qibiao Hu , Ping Wang , Yan Gong
We propose Cascade-of-Thought (CSOT), a novel prompt-based method for multimodal hierarchical classification (MHC) that requires no training or labeled exemplars. Inspired by the LLM-as-a-Judge (LaaJ) paradigm, CSOT decomposes classification into rationale generation, confidence scoring, and decision ranking–each implemented via structured prompts to a vision-language model (VLM). Experiments on two public MHC benchmarks demonstrate that CSOT yields substantial performance gains, particularly for weaker VLMs, while also enhancing the output quality of near-ceiling models. CSOT offers a flexible, generalizable solution for real-world MHC tasks.
我们提出了一种新的基于提示的多模态分层分类(MHC)方法,该方法不需要训练或标记样本。受LLM-as-a-Judge (LaaJ)范式的启发,CSOT将分类分解为基本原理生成、置信度评分和决策排名——每一个都通过对视觉语言模型(VLM)的结构化提示来实现。在两个公开的MHC基准测试上的实验表明,CSOT产生了显著的性能提升,特别是对于较弱的vlm,同时也提高了接近上限模型的输出质量。CSOT为现实世界的MHC任务提供了一个灵活的、通用的解决方案。
{"title":"Multimodal hierarchical classification using cascade-of-thought","authors":"Jingrui Hou ,&nbsp;Zhihang Tan ,&nbsp;Qibiao Hu ,&nbsp;Ping Wang ,&nbsp;Yan Gong","doi":"10.1016/j.ipm.2025.104555","DOIUrl":"10.1016/j.ipm.2025.104555","url":null,"abstract":"<div><div>We propose Cascade-of-Thought (CSOT), a novel prompt-based method for multimodal hierarchical classification (MHC) that requires no training or labeled exemplars. Inspired by the <em>LLM-as-a-Judge</em> (LaaJ) paradigm, CSOT decomposes classification into rationale generation, confidence scoring, and decision ranking–each implemented via structured prompts to a vision-language model (VLM). Experiments on two public MHC benchmarks demonstrate that CSOT yields substantial performance gains, particularly for weaker VLMs, while also enhancing the output quality of near-ceiling models. CSOT offers a flexible, generalizable solution for real-world MHC tasks.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 3","pages":"Article 104555"},"PeriodicalIF":6.9,"publicationDate":"2025-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145840333","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
Simulating the people's voice: Leveraging algorithmic fidelity to assess ChatGPT's performance in modeling public opinion on Chinese government policies 模拟人民的声音:利用算法保真度来评估ChatGPT在模拟中国政府政策的公众舆论方面的表现
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-12-20 DOI: 10.1016/j.ipm.2025.104567
ShaoPeng Che , Min Zhu , Shunan Zhang , Hae Sun Jung , Haein Lee , Zhixiao Wang , Lee Miller
Traditional public opinion surveys face persistent challenges related to cost, sample representativeness, and respondent willingness. These limitations have encouraged growing interest in using large language models (LLMs) to generate silicon samples as synthetic substitutes for human data. Although previous studies report high algorithmic fidelity in Western contexts, much less is known about whether globally trained LLMs can reproduce public attitudes in regulated and non-Western information environments. Using nationally representative data from the Chinese General Social Survey (CGSS 2021), this study evaluates ChatGPT’s ability to simulate Chinese public opinion on ten policy issues by comparing human responses with demographic-conditioned silicon samples. Analyses of response rates, response distributions, and demographic subgroups show that LLM outputs approximate human attitudes on low-sensitivity and consensus-oriented topics, but diverge systematically on culturally embedded and governance-sensitive issues. Silicon samples also produce near-complete response rates, which fails to capture human patterns of strategic non-response, and show larger misalignment among politically embedded and highly educated subgroups. Robustness diagnostics across model generations reveal strong cross-model structural stability but continued limitations when the model is applied in different sociopolitical contexts. These findings reconceptualize algorithmic fidelity as a context-sensitive construct and extend Pattern Correspondence into a multidimensional framework that incorporates response rates, response distributions, and demographic subgroup patterns. Overall, the study highlights both the potential and the limits of using LLMs to simulate public opinion in non-Western settings, emphasizing the need for culturally grounded calibration, transparent reporting, and cautious use in policy-relevant domains.
传统的民意调查面临着成本、样本代表性和受访者意愿等方面的持续挑战。这些限制促使人们对使用大型语言模型(llm)生成硅样品作为人类数据的合成替代品越来越感兴趣。尽管先前的研究报告了西方环境下的高算法保真度,但对于全球培训的法学硕士是否可以在受监管的和非西方信息环境中再现公众态度,人们知之甚少。本研究使用来自中国综合社会调查(CGSS 2021)的具有全国代表性的数据,通过比较人类的反应和人口统计条件下的硅样本,评估ChatGPT在十个政策问题上模拟中国公众舆论的能力。对回复率、回复率分布和人口分组的分析表明,法学硕士在低敏感性和以共识为导向的话题上的产出近似于人类的态度,但在文化嵌入和治理敏感问题上存在系统性分歧。硅样品也产生了近乎完全的回应率,但未能捕捉到人类的战略不回应模式,并显示出政治背景深厚和受过高等教育的子群体之间更大的不一致。跨模型世代的稳健性诊断揭示了强大的跨模型结构稳定性,但当模型应用于不同的社会政治背景时,仍然存在局限性。这些发现将算法保真度重新定义为上下文敏感的结构,并将模式对应扩展为包含回复率、响应分布和人口统计子组模式的多维框架。总体而言,该研究强调了在非西方环境中使用法学硕士模拟公众舆论的潜力和局限性,强调了在政策相关领域中基于文化的校准、透明报告和谨慎使用的必要性。
{"title":"Simulating the people's voice: Leveraging algorithmic fidelity to assess ChatGPT's performance in modeling public opinion on Chinese government policies","authors":"ShaoPeng Che ,&nbsp;Min Zhu ,&nbsp;Shunan Zhang ,&nbsp;Hae Sun Jung ,&nbsp;Haein Lee ,&nbsp;Zhixiao Wang ,&nbsp;Lee Miller","doi":"10.1016/j.ipm.2025.104567","DOIUrl":"10.1016/j.ipm.2025.104567","url":null,"abstract":"<div><div>Traditional public opinion surveys face persistent challenges related to cost, sample representativeness, and respondent willingness. These limitations have encouraged growing interest in using large language models (LLMs) to generate silicon samples as synthetic substitutes for human data. Although previous studies report high algorithmic fidelity in Western contexts, much less is known about whether globally trained LLMs can reproduce public attitudes in regulated and non-Western information environments. Using nationally representative data from the Chinese General Social Survey (CGSS 2021), this study evaluates ChatGPT’s ability to simulate Chinese public opinion on ten policy issues by comparing human responses with demographic-conditioned silicon samples. Analyses of response rates, response distributions, and demographic subgroups show that LLM outputs approximate human attitudes on low-sensitivity and consensus-oriented topics, but diverge systematically on culturally embedded and governance-sensitive issues. Silicon samples also produce near-complete response rates, which fails to capture human patterns of strategic non-response, and show larger misalignment among politically embedded and highly educated subgroups. Robustness diagnostics across model generations reveal strong cross-model structural stability but continued limitations when the model is applied in different sociopolitical contexts. These findings reconceptualize algorithmic fidelity as a context-sensitive construct and extend Pattern Correspondence into a multidimensional framework that incorporates response rates, response distributions, and demographic subgroup patterns. Overall, the study highlights both the potential and the limits of using LLMs to simulate public opinion in non-Western settings, emphasizing the need for culturally grounded calibration, transparent reporting, and cautious use in policy-relevant domains.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 3","pages":"Article 104567"},"PeriodicalIF":6.9,"publicationDate":"2025-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145796796","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
期刊
Information Processing & Management
全部 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