首页 > 最新文献

Information Processing & Management最新文献

英文 中文
A dynamic association multi-attribute fusion graph network for multivariate time series forecasting 多变量时间序列预测的动态关联多属性融合图网络
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-01-06 DOI: 10.1016/j.ipm.2025.104588
Minglan Zhang , Linfu Sun , Jing Yang , Yisheng Zou , Wei Long
Multivariate time series (MTS) forecasting is of critical importance in practical applications. Graph neural networks (GNNs) offer new insights for MTS forecasting, but traditional GNN methods rely on static graph structures, making it difficult to capture dynamic correlations and evolutionary patterns, and they also have limitations in the fusion of node and edge features. To address these challenges, this paper proposes a dynamic association multi-attribute fusion graph network (DyAMFG) for multivariate time series forecasting. The model first employs the association feature extraction and feature-driven edge learning mechanism to construct an adaptively evolving dynamic association graph, capturing the non-stationary patterns of node-edge co-evolution. Then, the complementary multi-feature encoders are designed to jointly model the neighbor aggregation, the neighbor co-occurrence, and the time dependence edge features, comprehensively covering dynamic changes and data trends. Finally, the adaptive fusion mechanism is used to break through the information barriers between node and edge features, achieving deep fusion across attribute features. Extensive experiments are conducted on five real-world datasets and the results validate that the DyAMFG model demonstrates outstanding prediction and generalization performance. Compared with other reported methods, the DyAMFG model achieves average improvements of 37.9%, 42.5%, and 11.7% in the RRSE metric across three datasets, and improves the RMSE metric by 25.8% and 6.90% on the remaining two datasets.
多元时间序列(MTS)预测在实际应用中具有重要意义。图神经网络(GNN)为MTS预测提供了新的见解,但传统的GNN方法依赖于静态图结构,难以捕捉动态相关性和进化模式,并且在节点和边缘特征的融合方面也存在局限性。为了解决这些问题,本文提出了一种用于多元时间序列预测的动态关联多属性融合图网络(DyAMFG)。该模型首先利用关联特征提取和特征驱动的边缘学习机制构建自适应进化的动态关联图,捕捉节点-边缘协同进化的非平稳模式;然后,设计互补性多特征编码器,共同建模邻居聚集、邻居共现和时间依赖边缘特征,全面覆盖动态变化和数据趋势;最后,利用自适应融合机制突破节点特征和边缘特征之间的信息屏障,实现属性特征间的深度融合。在五个实际数据集上进行了大量实验,结果验证了DyAMFG模型具有出色的预测和泛化性能。与其他已报道的方法相比,DyAMFG模型在三个数据集上的RRSE指标平均提高了37.9%、42.5%和11.7%,在其余两个数据集上的RMSE指标平均提高了25.8%和6.90%。
{"title":"A dynamic association multi-attribute fusion graph network for multivariate time series forecasting","authors":"Minglan Zhang ,&nbsp;Linfu Sun ,&nbsp;Jing Yang ,&nbsp;Yisheng Zou ,&nbsp;Wei Long","doi":"10.1016/j.ipm.2025.104588","DOIUrl":"10.1016/j.ipm.2025.104588","url":null,"abstract":"<div><div>Multivariate time series (MTS) forecasting is of critical importance in practical applications. Graph neural networks (GNNs) offer new insights for MTS forecasting, but traditional GNN methods rely on static graph structures, making it difficult to capture dynamic correlations and evolutionary patterns, and they also have limitations in the fusion of node and edge features. To address these challenges, this paper proposes a dynamic association multi-attribute fusion graph network (DyAMFG) for multivariate time series forecasting. The model first employs the association feature extraction and feature-driven edge learning mechanism to construct an adaptively evolving dynamic association graph, capturing the non-stationary patterns of node-edge co-evolution. Then, the complementary multi-feature encoders are designed to jointly model the neighbor aggregation, the neighbor co-occurrence, and the time dependence edge features, comprehensively covering dynamic changes and data trends. Finally, the adaptive fusion mechanism is used to break through the information barriers between node and edge features, achieving deep fusion across attribute features. Extensive experiments are conducted on five real-world datasets and the results validate that the DyAMFG model demonstrates outstanding prediction and generalization performance. Compared with other reported methods, the DyAMFG model achieves average improvements of 37.9%, 42.5%, and 11.7% in the RRSE metric across three datasets, and improves the RMSE metric by 25.8% and 6.90% on the remaining two datasets.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 4","pages":"Article 104588"},"PeriodicalIF":6.9,"publicationDate":"2026-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927590","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
Formal modeling and discovery of cross-organizational business processes: A privacy-preserving two-stage approach 跨组织业务流程的正式建模和发现:一种保护隐私的两阶段方法
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-01-06 DOI: 10.1016/j.ipm.2025.104585
Wei Liu , Ge Xin , Xiaoliang Chen , Xu Gu , Duoqian Miao , Peng Lu , Lujia Li
To address the limitations of traditional process mining techniques in meeting the practical requirements of cross-organizational business processes, this paper proposes a dedicated modeling and mining method for such settings. First, we introduce HTC_WF_Net (Hierarchical Temporal Collaborative Workflow Net), an extension of workflow nets that incorporates nested transitions, temporal attributes, and collaboration-related places across organizations. Next, a hierarchical construction method for cross-organizational business event logs is proposed, together with the definition of corresponding collaboration patterns. Finally, a privacy-preserving cross-organizational process discovery method (COPM, Cross-Organizational Process Mining) is developed based on HTC_WF_Net and the hierarchical logs. Experimental results demonstrate the effectiveness of the proposed approach. Compared with several baseline methods on four real-world and two simulated event log datasets, the approach achieves higher model precision and F-score, along with improved readability and mining efficiency.
为了解决传统流程挖掘技术在满足跨组织业务流程实际需求方面的局限性,本文提出了一种专门的跨组织业务流程建模和挖掘方法。首先,我们介绍HTC_WF_Net(分层时间协作工作流网),它是工作流网的扩展,包含了嵌套转换、时间属性和跨组织的协作相关位置。其次,提出了跨组织业务事件日志的分层构建方法,并定义了相应的协作模式。最后,基于HTC_WF_Net和分层日志,提出了一种保护隐私的跨组织过程发现方法(COPM, cross-organizational process Mining)。实验结果证明了该方法的有效性。在4个真实事件日志数据集和2个模拟事件日志数据集上,与几种基线方法相比,该方法获得了更高的模型精度和f值,同时提高了可读性和挖掘效率。
{"title":"Formal modeling and discovery of cross-organizational business processes: A privacy-preserving two-stage approach","authors":"Wei Liu ,&nbsp;Ge Xin ,&nbsp;Xiaoliang Chen ,&nbsp;Xu Gu ,&nbsp;Duoqian Miao ,&nbsp;Peng Lu ,&nbsp;Lujia Li","doi":"10.1016/j.ipm.2025.104585","DOIUrl":"10.1016/j.ipm.2025.104585","url":null,"abstract":"<div><div>To address the limitations of traditional process mining techniques in meeting the practical requirements of cross-organizational business processes, this paper proposes a dedicated modeling and mining method for such settings. First, we introduce HTC_WF_Net (Hierarchical Temporal Collaborative Workflow Net), an extension of workflow nets that incorporates nested transitions, temporal attributes, and collaboration-related places across organizations. Next, a hierarchical construction method for cross-organizational business event logs is proposed, together with the definition of corresponding collaboration patterns. Finally, a privacy-preserving cross-organizational process discovery method (COPM, Cross-Organizational Process Mining) is developed based on HTC_WF_Net and the hierarchical logs. Experimental results demonstrate the effectiveness of the proposed approach. Compared with several baseline methods on four real-world and two simulated event log datasets, the approach achieves higher model precision and F-score, along with improved readability and mining efficiency.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 4","pages":"Article 104585"},"PeriodicalIF":6.9,"publicationDate":"2026-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927589","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
End-to-end scheduling for carrier-based aircraft sortie operations using deep reinforcement learning 基于深度强化学习的舰载机出动作战端到端调度
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-01-05 DOI: 10.1016/j.ipm.2025.104590
Changjiu Li , Wei Han , Yong Zhang , Xinwei Wang , Xichao Su
Efficient scheduling of carrier-based aircraft sorties is essential for enhancing the effectiveness of aircraft carriers. The key research challenges stem from the limitations of traditional algorithms, which struggle with this complex scheduling problem due to their high computational complexity, poor adaptability to dynamic events, and a tendency to converge to local optima, rendering them unsuitable for meeting real-time operational demands. To tackle these challenges, we propose an end-to-end deep reinforcement learning scheduling framework that leverages a multi-head attention mechanism to extract features from a heterogeneous graph of the scheduling environment. Using the proximal policy optimization-clip algorithm, the framework enables iterative interaction with a simulation environment to train the scheduling agent. Our experimental findings quantitatively demonstrate the superiority of the proposed framework: the agent outperforms traditional combined rules by over 5% and metaheuristic algorithms by approximately 1%, while achieving an average decision-making time of just 0.7 seconds. The model also demonstrates strong robustness, maintaining a minimal optimality gap even under a 30% reduction in resources. This research provides commanders with a more efficient decision support tool, thereby improving their battlefield response capabilities.
有效的舰载机出动调度是提高航母战斗力的关键。关键的研究挑战源于传统算法的局限性,传统算法由于计算量大、对动态事件的适应性差、倾向于收敛于局部最优而无法满足实时操作需求,难以解决复杂的调度问题。为了解决这些挑战,我们提出了一个端到端的深度强化学习调度框架,该框架利用多头注意机制从调度环境的异构图中提取特征。该框架采用近端策略优化-剪辑算法,实现了与仿真环境的迭代交互,以训练调度代理。我们的实验结果定量地证明了所提出框架的优越性:智能体比传统的组合规则高出5%以上,比元启发式算法高出约1%,而平均决策时间仅为0.7秒。该模型还显示出很强的鲁棒性,即使在资源减少30%的情况下,也能保持最小的最优性差距。本研究为指挥官提供了更有效的决策支持工具,从而提高了他们的战场响应能力。
{"title":"End-to-end scheduling for carrier-based aircraft sortie operations using deep reinforcement learning","authors":"Changjiu Li ,&nbsp;Wei Han ,&nbsp;Yong Zhang ,&nbsp;Xinwei Wang ,&nbsp;Xichao Su","doi":"10.1016/j.ipm.2025.104590","DOIUrl":"10.1016/j.ipm.2025.104590","url":null,"abstract":"<div><div>Efficient scheduling of carrier-based aircraft sorties is essential for enhancing the effectiveness of aircraft carriers. The key research challenges stem from the limitations of traditional algorithms, which struggle with this complex scheduling problem due to their high computational complexity, poor adaptability to dynamic events, and a tendency to converge to local optima, rendering them unsuitable for meeting real-time operational demands. To tackle these challenges, we propose an end-to-end deep reinforcement learning scheduling framework that leverages a multi-head attention mechanism to extract features from a heterogeneous graph of the scheduling environment. Using the proximal policy optimization-clip algorithm, the framework enables iterative interaction with a simulation environment to train the scheduling agent. Our experimental findings quantitatively demonstrate the superiority of the proposed framework: the agent outperforms traditional combined rules by over 5% and metaheuristic algorithms by approximately 1%, while achieving an average decision-making time of just 0.7 seconds. The model also demonstrates strong robustness, maintaining a minimal optimality gap even under a 30% reduction in resources. This research provides commanders with a more efficient decision support tool, thereby improving their battlefield response capabilities.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 4","pages":"Article 104590"},"PeriodicalIF":6.9,"publicationDate":"2026-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927586","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
Topic propagation prediction model based on topic lifecycle and user social circle 基于主题生命周期和用户社交圈的主题传播预测模型
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-01-05 DOI: 10.1016/j.ipm.2025.104558
Chaolong Jia, Kangle Chen, Guoding Wang, Guicai Deng, Rong Wang, Tun Li, Yunpeng Xiao
This paper presents a topic propagation prediction model that jointly considers topic lifecycle stages and dynamic social circles. A time-window-based topic representation captures lifecycle-aware evolution patterns, while SC2vec embeds dynamic social circle structures based on interaction strength and topology. These features are fused via a Temporal Graph Convolutional Network (TGCN) to model spatiotemporal propagation dynamics. Experiments on Weibo and Twitter datasets, covering over 1.5 million user interactions across four real-world trending topics, show that the proposed model consistently outperforms recent baselines in MAE and RMSE, effectively mitigating data sparsity and improving prediction accuracy.
提出了一种综合考虑话题生命周期阶段和动态社交圈的话题传播预测模型。基于时间窗口的主题表示捕获生命周期感知的进化模式,而SC2vec则基于交互强度和拓扑嵌入动态社交圈结构。这些特征通过时间图卷积网络(TGCN)进行融合,以模拟时空传播动态。在微博和Twitter数据集上进行的实验,涵盖了四个现实世界趋势主题的150多万用户交互,表明所提出的模型始终优于MAE和RMSE的最新基线,有效地降低了数据稀疏性并提高了预测精度。
{"title":"Topic propagation prediction model based on topic lifecycle and user social circle","authors":"Chaolong Jia,&nbsp;Kangle Chen,&nbsp;Guoding Wang,&nbsp;Guicai Deng,&nbsp;Rong Wang,&nbsp;Tun Li,&nbsp;Yunpeng Xiao","doi":"10.1016/j.ipm.2025.104558","DOIUrl":"10.1016/j.ipm.2025.104558","url":null,"abstract":"<div><div>This paper presents a topic propagation prediction model that jointly considers topic lifecycle stages and dynamic social circles. A time-window-based topic representation captures lifecycle-aware evolution patterns, while SC2vec embeds dynamic social circle structures based on interaction strength and topology. These features are fused via a Temporal Graph Convolutional Network (TGCN) to model spatiotemporal propagation dynamics. Experiments on Weibo and Twitter datasets, covering over 1.5 million user interactions across four real-world trending topics, show that the proposed model consistently outperforms recent baselines in MAE and RMSE, effectively mitigating data sparsity and improving prediction accuracy.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 4","pages":"Article 104558"},"PeriodicalIF":6.9,"publicationDate":"2026-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927587","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
Adaptive overlap penalization and probabilistic modeling in hypergraph influence maximization 超图中的自适应重叠惩罚和概率建模影响最大化
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-01-03 DOI: 10.1016/j.ipm.2025.104594
Lingyu Wu , Cong Li , Bo Qu , Xiang Li
Influence maximization (IM) algorithms aim to iteratively identify a seed set that could maximize the spreading range. In this paper, we concentrate on the hypergraph influence maximization (HyperIM) problem. The overlapping neighborhood caused by the higher-order interactions leads to an overestimation of the diffusion capability of candidate nodes. Moreover, selecting the candidate node with a high infected probability as a new seed node is low payoff with a small influence range gain. Thus, we develop adaptive metrics and propose two algorithms, i.e., high adaptive contact efficiency (HACE) algorithm and high contact with a low infected probability (HCLI) algorithm. First, we penalize the contribution of the neighborhood of the seed set to the evaluation of the influence gain to the seed set to correct the impact of overlapping influence. Additionally, the proposed HACE algorithm uses the being contacted capability to reveal the infected possibility of candidate nodes, while the proposed HCLI algorithm estimates the global infected probability of nodes. The experiments and analysis on eight real-world hypergraphs demonstrate the better balance of the HACE and HCLI algorithms than the state-of-the-art (SOTA) algorithms in selecting influential seed set and ensuring computational efficiency. Compared with the existing SOTA algorithms, HACE and HCLI run at least ten times faster than SOTA, and at most nearly 70 times faster. On large-scale hypergraphs, the HACE and HCLI algorithms still show great computational efficiency and significantly improved performances compared with other low-time complexity algorithms.
影响最大化算法的目标是迭代地确定一个能够使传播范围最大化的种子集。本文主要研究超图影响最大化问题。由高阶相互作用引起的重叠邻域导致对候选节点扩散能力的高估。此外,选择感染概率高的候选节点作为新的种子节点,其收益低,影响范围增益小。因此,我们开发了自适应度量并提出了两种算法,即高自适应接触效率(HACE)算法和高接触低感染概率(HCLI)算法。首先,我们惩罚种子集的邻域对种子集的影响增益评价的贡献,以纠正重叠影响的影响。此外,HACE算法利用被接触能力来揭示候选节点的感染可能性,HCLI算法估计节点的全局感染概率。在八个真实超图上的实验和分析表明,HACE和HCLI算法在选择有影响的种子集和保证计算效率方面比最先进的SOTA算法更好地平衡了计算效率。与现有的SOTA算法相比,HACE和HCLI的运行速度比SOTA至少快10倍,最多快近70倍。在大规模超图上,与其他低时间复杂度算法相比,HACE和HCLI算法仍然显示出很高的计算效率和显著的性能提升。
{"title":"Adaptive overlap penalization and probabilistic modeling in hypergraph influence maximization","authors":"Lingyu Wu ,&nbsp;Cong Li ,&nbsp;Bo Qu ,&nbsp;Xiang Li","doi":"10.1016/j.ipm.2025.104594","DOIUrl":"10.1016/j.ipm.2025.104594","url":null,"abstract":"<div><div>Influence maximization (IM) algorithms aim to iteratively identify a seed set that could maximize the spreading range. In this paper, we concentrate on the hypergraph influence maximization (HyperIM) problem. The overlapping neighborhood caused by the higher-order interactions leads to an overestimation of the diffusion capability of candidate nodes. Moreover, selecting the candidate node with a high infected probability as a new seed node is low payoff with a small influence range gain. Thus, we develop adaptive metrics and propose two algorithms, i.e., high adaptive contact efficiency (HACE) algorithm and high contact with a low infected probability (HCLI) algorithm. First, we penalize the contribution of the neighborhood of the seed set to the evaluation of the influence gain to the seed set to correct the impact of overlapping influence. Additionally, the proposed HACE algorithm uses the being contacted capability to reveal the infected possibility of candidate nodes, while the proposed HCLI algorithm estimates the global infected probability of nodes. The experiments and analysis on eight real-world hypergraphs demonstrate the better balance of the HACE and HCLI algorithms than the state-of-the-art (SOTA) algorithms in selecting influential seed set and ensuring computational efficiency. Compared with the existing SOTA algorithms, HACE and HCLI run at least ten times faster than SOTA, and at most nearly 70 times faster. On large-scale hypergraphs, the HACE and HCLI algorithms still show great computational efficiency and significantly improved performances compared with other low-time complexity algorithms.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 4","pages":"Article 104594"},"PeriodicalIF":6.9,"publicationDate":"2026-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886173","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
Developing Fairness, Accuracy, and Serendipity Objective Functions for Recommendation System and Establishing Trade-off through Multi-Objective Evolutionary Optimization 基于多目标进化优化的推荐系统公平性、准确性和偶然性目标函数建立权衡关系
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-01-03 DOI: 10.1016/j.ipm.2025.104604
Shresth Khaitan , Rahul Shrivastava
Balancing accuracy while establishing a trade-off optimization with fairness and serendipity remains a challenging problem in commercial recommender systems. However, recent multi-objective recommendation methods have often overlooked the need to investigate pleasantly surprising items, thereby mitigating popularity bias and ensuring the equitable inclusion of items in the recommendation list. Hence, this study develops the objective functions for Fairness, Accuracy, and Serendipity and integrates them into a proposed unified Multi-Objective Evolutionary Algorithm-Based Recommendation Framework (FAS-MOEA). The proposed objective functions for accuracy ensure the balanced inclusion of long-tail and popular items through weighted evaluation. The fairness-based objective function incorporates genre-aware fairness, aligning recommendation distributions with both global and user-specific genre profiles. The serendipity-based proposed objective function learns implicit, context-sensitive preferences for novel yet relevant items. Lastly, the proposed framework establishes the balanced trade-off among these competing objectives to generate the Pareto optimal recommendation solution. The proposed models' validation demonstrates substantial improvement over the competing models on three benchmark datasets, MovieLens 100K, MovieLens 1M, and Amazon Electronics (5-core), attaining an enhancement of 27.21% in F1-score, 8.44% in fairness, and 16.66% in serendipity score. The generated Pareto front exhibits the models' ability to navigate trade-offs among these competing goals and develop an accurate, fair, and pleasantly surprising recommendation.
在商业推荐系统中,平衡准确性的同时建立公平性和偶然性的权衡优化仍然是一个具有挑战性的问题。然而,最近的多目标推荐方法往往忽略了调查令人惊喜的项目的需要,从而减轻了受欢迎程度的偏见,并确保在推荐列表中公平地包含项目。因此,本研究开发了公平性、准确性和偶然性的目标函数,并将它们整合到一个统一的多目标进化算法推荐框架(FAS-MOEA)中。所提出的精度目标函数通过加权评价确保了长尾项目和热门项目的均衡纳入。基于公平性的目标函数结合了类型感知公平性,将推荐分布与全局和用户特定类型配置文件对齐。基于偶然性的目标函数学习对新颖但相关的物品的内隐的、上下文敏感的偏好。最后,提出的框架在这些竞争目标之间建立平衡权衡,以生成帕累托最优推荐解。在MovieLens 100K、MovieLens 1M和Amazon Electronics(5核)三个基准数据集上,所提出模型的验证表明,与竞争模型相比,该模型有了很大的改进,f1得分提高了27.21%,公平性提高了8.44%,意外得分提高了16.66%。生成的帕累托前沿展示了模型在这些相互竞争的目标之间进行权衡的能力,并开发出准确、公平和令人惊喜的建议。
{"title":"Developing Fairness, Accuracy, and Serendipity Objective Functions for Recommendation System and Establishing Trade-off through Multi-Objective Evolutionary Optimization","authors":"Shresth Khaitan ,&nbsp;Rahul Shrivastava","doi":"10.1016/j.ipm.2025.104604","DOIUrl":"10.1016/j.ipm.2025.104604","url":null,"abstract":"<div><div>Balancing accuracy while establishing a trade-off optimization with fairness and serendipity remains a challenging problem in commercial recommender systems. However, recent multi-objective recommendation methods have often overlooked the need to investigate pleasantly surprising items, thereby mitigating popularity bias and ensuring the equitable inclusion of items in the recommendation list. Hence, this study develops the objective functions for Fairness, Accuracy, and Serendipity and integrates them into a proposed unified Multi-Objective Evolutionary Algorithm-Based Recommendation Framework (FAS-MOEA). The proposed objective functions for accuracy ensure the balanced inclusion of long-tail and popular items through weighted evaluation. The fairness-based objective function incorporates genre-aware fairness, aligning recommendation distributions with both global and user-specific genre profiles. The serendipity-based proposed objective function learns implicit, context-sensitive preferences for novel yet relevant items. Lastly, the proposed framework establishes the balanced trade-off among these competing objectives to generate the Pareto optimal recommendation solution. The proposed models' validation demonstrates substantial improvement over the competing models on three benchmark datasets, MovieLens 100K, MovieLens 1M, and Amazon Electronics (5-core), attaining an enhancement of 27.21% in F1-score, 8.44% in fairness, and 16.66% in serendipity score. The generated Pareto front exhibits the models' ability to navigate trade-offs among these competing goals and develop an accurate, fair, and pleasantly surprising recommendation.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 4","pages":"Article 104604"},"PeriodicalIF":6.9,"publicationDate":"2026-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927592","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
Language models for environmental, social, and governance analysis: A review 环境、社会和治理分析的语言模型:综述
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-01-02 DOI: 10.1016/j.ipm.2025.104596
Kelvin Du , Rui Mao , Frank Xing , Gianmarco Mengaldo , Erik Cambria
Language models have revolutionized information processing, elevating it to new levels and generating opportunities to positively impact our society, e.g., in Environmental, Social, and Governance (ESG) domains. This article surveys the current use of language models for ESG analysis, focusing on their applicable scope, effectiveness, and transformative impact. It highlights how these models facilitate a deeper understanding of ESG practices and impacts by integrating unstructured data while acknowledging existing limitations and challenges. Specifically, based on a review of over ninety ESG studies published since the introduction of Transformers in 2018, we discovered that the potential of language models is particularly notable in four primary themes: (1) ESG Frameworks and Standards, which involve the classification of ESG-related texts into binary categories, coarse-grained ESG factors, or fine-grained ESG topics. This theme also includes identifying ESG topic trends and assessing the alignment of corporate ESG disclosures with sustainable development goals; (2) ESG Reporting and Disclosure, which include ESG narrative processing, ESG reporting assurance and ESG report generation; (3) ESG Measurement and Evaluation, which involves calculating ESG ratings, extracting key performance indicators (KPIs), assessing ESG risks, detecting ESG controversy categories, analyzing ESG impact and duration, and assessing the effects of ESG on sustainable growth and corporate financial performance, among other functions; (4) ESG Integration and Application, aiming to incorporate ESG factors into broader financial applications and thereby innovate financial tasks, including ESG sentiment analysis, ESG chatbots and AI assistants, ESG-based financial risk and credit analysis, and ESG investing strategies. We conclude by emphasizing the significance of language models in advancing ESG studies and discussing future research directions.
语言模型已经彻底改变了信息处理,将其提升到新的水平,并产生了积极影响我们社会的机会,例如在环境,社会和治理(ESG)领域。本文调查了ESG分析中语言模型的当前使用情况,重点关注它们的适用范围、有效性和变革影响。它强调了这些模型如何通过整合非结构化数据促进对ESG实践和影响的更深入理解,同时承认现有的局限性和挑战。具体来说,基于对自2018年《变压器》推出以来发表的90多项ESG研究的回顾,我们发现语言模型的潜力在四个主要主题中尤为显著:(1)ESG框架和标准,其中涉及将ESG相关文本分为二元类别、粗粒度ESG因素或细粒度ESG主题。该主题还包括确定ESG主题趋势,评估企业ESG披露与可持续发展目标的一致性;(2) ESG报告与披露,包括ESG叙事处理、ESG报告保证和ESG报告生成;(3) ESG测量与评估,包括计算ESG评级、提取关键绩效指标、评估ESG风险、发现ESG争议类别、分析ESG影响和持续时间、评估ESG对可持续增长和公司财务绩效的影响等功能;(4) ESG整合与应用,旨在将ESG因素纳入更广泛的金融应用,从而创新金融任务,包括ESG情绪分析、ESG聊天机器人和人工智能助手、基于ESG的金融风险和信用分析以及ESG投资策略。最后,我们强调了语言模型在推进ESG研究中的重要意义,并讨论了未来的研究方向。
{"title":"Language models for environmental, social, and governance analysis: A review","authors":"Kelvin Du ,&nbsp;Rui Mao ,&nbsp;Frank Xing ,&nbsp;Gianmarco Mengaldo ,&nbsp;Erik Cambria","doi":"10.1016/j.ipm.2025.104596","DOIUrl":"10.1016/j.ipm.2025.104596","url":null,"abstract":"<div><div>Language models have revolutionized information processing, elevating it to new levels and generating opportunities to positively impact our society, e.g., in Environmental, Social, and Governance (ESG) domains. This article surveys the current use of language models for ESG analysis, focusing on their applicable scope, effectiveness, and transformative impact. It highlights how these models facilitate a deeper understanding of ESG practices and impacts by integrating unstructured data while acknowledging existing limitations and challenges. Specifically, based on a review of over ninety ESG studies published since the introduction of Transformers in 2018, we discovered that the potential of language models is particularly notable in four primary themes: (1) <strong>ESG Frameworks and Standards</strong>, which involve the classification of ESG-related texts into binary categories, coarse-grained ESG factors, or fine-grained ESG topics. This theme also includes identifying ESG topic trends and assessing the alignment of corporate ESG disclosures with sustainable development goals; (2) <strong>ESG Reporting and Disclosure</strong>, which include ESG narrative processing, ESG reporting assurance and ESG report generation; (3) <strong>ESG Measurement and Evaluation</strong>, which involves calculating ESG ratings, extracting key performance indicators (KPIs), assessing ESG risks, detecting ESG controversy categories, analyzing ESG impact and duration, and assessing the effects of ESG on sustainable growth and corporate financial performance, among other functions; (4) <strong>ESG Integration and Application</strong>, aiming to incorporate ESG factors into broader financial applications and thereby innovate financial tasks, including ESG sentiment analysis, ESG chatbots and AI assistants, ESG-based financial risk and credit analysis, and ESG investing strategies. We conclude by emphasizing the significance of language models in advancing ESG studies and discussing future research directions.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 4","pages":"Article 104596"},"PeriodicalIF":6.9,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886272","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
Multi-view clustering based on the association of graph structure and feature distribution 基于图结构与特征分布关联的多视图聚类
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-01-02 DOI: 10.1016/j.ipm.2025.104586
Chenhui Shi , Yongjie Xin , Haifeng Yang , Jianghui Cai , Jie Wang , Lichan Zhou , Yanting He , Fuxing Cui , Xujun Zhao , Yaling Xun
Graph-based multi-view clustering methods have gained considerable attention in recent years. However, most existing techniques ignore the association of graph and feature distributions between different views. In addition, noise and redundant information in data will leads to an inability to accurately learn consistent distributions among multiple views. To overcome these issues, this study proposes a framework termed “multi-view clustering based on the association of graph structure and feature distribution” (MLGF). Specifically, we provide collaborative training based on a similar distribution comparison mechanism that unifies the graph structures and feature distributions of different views, to construct multiple high-quality similarity matrices. Noisy information is effectively eliminated from the raw data by embedding graph spectral decomposition and automatic weighting methods into the graph encoder to learn clean, low-dimensional embedded representations of the data. Finally, multiple similarity matrices are fused in a locally weighted manner to obtain consistent similarity matrices. Experiments on five benchmark datasets demonstrated the superiority of our method, achieving 100%, 97.28% on COIL-20 and Handwritten datasets. This is attributed to the effective joint optimization of graph structure and feature distribution, which is validated by its outstanding performance across diverse datasets. The code will be available at https://github.com/shichenhui/MLGF.
基于图的多视图聚类方法近年来得到了广泛的关注。然而,大多数现有的技术忽略了不同视图之间的图和特征分布的关联。此外,数据中的噪声和冗余信息将导致无法准确地学习多个视图之间的一致分布。为了克服这些问题,本研究提出了一种基于图结构和特征分布关联的多视图聚类框架(MLGF)。具体来说,我们提供了基于相似分布比较机制的协同训练,该机制统一了不同视图的图结构和特征分布,以构建多个高质量的相似矩阵。通过将图谱分解和自动加权方法嵌入到图编码器中,以学习数据的干净、低维嵌入表示,有效地消除了原始数据中的噪声信息。最后,对多个相似矩阵进行局部加权融合,得到一致性相似矩阵。在5个基准数据集上的实验证明了该方法的优越性,在COIL-20和手写数据集上的准确率分别为100%、97.28%。这归功于图结构和特征分布的有效联合优化,其在不同数据集上的出色性能验证了这一点。代码可在https://github.com/shichenhui/MLGF上获得。
{"title":"Multi-view clustering based on the association of graph structure and feature distribution","authors":"Chenhui Shi ,&nbsp;Yongjie Xin ,&nbsp;Haifeng Yang ,&nbsp;Jianghui Cai ,&nbsp;Jie Wang ,&nbsp;Lichan Zhou ,&nbsp;Yanting He ,&nbsp;Fuxing Cui ,&nbsp;Xujun Zhao ,&nbsp;Yaling Xun","doi":"10.1016/j.ipm.2025.104586","DOIUrl":"10.1016/j.ipm.2025.104586","url":null,"abstract":"<div><div>Graph-based multi-view clustering methods have gained considerable attention in recent years. However, most existing techniques ignore the association of graph and feature distributions between different views. In addition, noise and redundant information in data will leads to an inability to accurately learn consistent distributions among multiple views. To overcome these issues, this study proposes a framework termed “multi-view clustering based on the association of graph structure and feature distribution” (MLGF). Specifically, we provide collaborative training based on a similar distribution comparison mechanism that unifies the graph structures and feature distributions of different views, to construct multiple high-quality similarity matrices. Noisy information is effectively eliminated from the raw data by embedding graph spectral decomposition and automatic weighting methods into the graph encoder to learn clean, low-dimensional embedded representations of the data. Finally, multiple similarity matrices are fused in a locally weighted manner to obtain consistent similarity matrices. Experiments on five benchmark datasets demonstrated the superiority of our method, achieving 100%, 97.28% on COIL-20 and Handwritten datasets. This is attributed to the effective joint optimization of graph structure and feature distribution, which is validated by its outstanding performance across diverse datasets. The code will be available at <span><span>https://github.com/shichenhui/MLGF</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 4","pages":"Article 104586"},"PeriodicalIF":6.9,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886174","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 multi-criteria sorting method for preference maps based on Nash-Stackelberg game 基于Nash-Stackelberg博弈的偏好图多准则排序方法
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-01-02 DOI: 10.1016/j.ipm.2025.104587
Xinru Han , Yukun Bao , Jianming Zhan , Yufeng Shen
Existing multi-criteria sorting methods predominantly rely on preset classification thresholds or fixed numbers of alternatives for classification, exhibiting strong subjectivity and overlooking potential consensus correlations between classifications. In group decision-making (GDM), the consensus feedback mechanism drives the consensus reaching process (CRP) and gives rise to the problem of adjustment amount allocation among decision-makers (DMs). However, existing studies over-rely on consensus thresholds and neglect differences in DMs’ adjustment capabilities and sequences, which significantly reduces the applicability and accuracy of the methods. To address the above issues, this study proposes a novel group consensus method (NS-FPR-PM) integrating the Nash-Stackelberg game and preference maps within the framework of fuzzy preference relations (FPRs). Specifically, class probability thresholds are objectively derived through an optimization model; the classification results are then converted into preference maps based on these class probability thresholds to explore the inherent consensus relations, thereby eliminating reliance on consensus thresholds. The Nash-Stackelberg game model can characterize the differences in bargaining power among DMs, and an asynchronous adjustment mechanism is designed accordingly to achieve fair allocation of adjustment amount. Finally, we provide an example to illustrate the proposed method, the experimental results and analysis demonstrate that the method exhibits significant advantages over similar methods in terms of consensus reaching efficiency and unit adjustment conversion rate.
现有的多标准分类方法主要依赖于预设的分类阈值或固定数量的备选分类,表现出很强的主观性,忽略了分类之间潜在的共识相关性。在群体决策(GDM)中,共识反馈机制推动了共识达成过程(CRP),并产生了决策者之间调整量分配的问题。然而,现有研究过度依赖共识阈值,忽视了dm调整能力和序列的差异,大大降低了方法的适用性和准确性。为了解决上述问题,本研究提出了一种新的群体共识方法(NS-FPR-PM),该方法将纳什- stackelberg博弈和模糊偏好关系(FPRs)框架下的偏好图相结合。具体而言,通过优化模型客观地推导出类概率阈值;然后将分类结果转换为基于这些类概率阈值的偏好图,以探索固有的共识关系,从而消除对共识阈值的依赖。Nash-Stackelberg博弈模型可以表征dm之间议价能力的差异,并据此设计异步调整机制,实现调整金额的公平分配。最后,给出了一个算例,实验结果和分析表明,该方法在共识达成效率和单位调整转化率方面比同类方法具有显著的优势。
{"title":"A multi-criteria sorting method for preference maps based on Nash-Stackelberg game","authors":"Xinru Han ,&nbsp;Yukun Bao ,&nbsp;Jianming Zhan ,&nbsp;Yufeng Shen","doi":"10.1016/j.ipm.2025.104587","DOIUrl":"10.1016/j.ipm.2025.104587","url":null,"abstract":"<div><div>Existing multi-criteria sorting methods predominantly rely on preset classification thresholds or fixed numbers of alternatives for classification, exhibiting strong subjectivity and overlooking potential consensus correlations between classifications. In group decision-making (GDM), the consensus feedback mechanism drives the consensus reaching process (CRP) and gives rise to the problem of adjustment amount allocation among decision-makers (DMs). However, existing studies over-rely on consensus thresholds and neglect differences in DMs’ adjustment capabilities and sequences, which significantly reduces the applicability and accuracy of the methods. To address the above issues, this study proposes a novel group consensus method (NS-FPR-PM) integrating the Nash-Stackelberg game and preference maps within the framework of fuzzy preference relations (FPRs). Specifically, class probability thresholds are objectively derived through an optimization model; the classification results are then converted into preference maps based on these class probability thresholds to explore the inherent consensus relations, thereby eliminating reliance on consensus thresholds. The Nash-Stackelberg game model can characterize the differences in bargaining power among DMs, and an asynchronous adjustment mechanism is designed accordingly to achieve fair allocation of adjustment amount. Finally, we provide an example to illustrate the proposed method, the experimental results and analysis demonstrate that the method exhibits significant advantages over similar methods in terms of consensus reaching efficiency and unit adjustment conversion rate.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 4","pages":"Article 104587"},"PeriodicalIF":6.9,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886177","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
Less is more: Towards green code large language models via unified structural pruning 少即是多:通过统一的结构修剪实现绿色代码大型语言模型
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-01-01 DOI: 10.1016/j.ipm.2025.104580
Guang Yang , Yu Zhou , Xiangyu Zhang , Wei Cheng , Ke Liu , Xiang Chen , Terry Yue Zhuo , Taolue Chen
The extensive application of Large Language Models (LLMs) in generative coding tasks has raised concerns due to their high computational demands and energy consumption. Unlike previous structural pruning methods designed for classification models that deal with low-dimensional classification logits, generative Code LLMs produce high-dimensional token logit sequences, making traditional pruning objectives inherently limited. Moreover, existing single-component pruning approaches further constrain the effectiveness when applied to generative Code LLMs. In response, we propose Flab-Pruner, an innovative unified structural pruning method that combines vocabulary, layer, and Feed-Forward Network (FFN) pruning. This approach effectively reduces model parameters while maintaining performance. Additionally, we introduce a customized code instruction data strategy for coding tasks to enhance the performance recovery efficiency of the pruned model. Through extensive evaluations on three state-of-the-art Code LLMs across multiple generative coding tasks, the results demonstrate that Flab-Pruner retains 97% of the original code generation performance on average after pruning 22% of the parameters, and achieves the same or even better performance after post-training. The pruned models exhibit significant improvements in storage, GPU usage, computational efficiency, and environmental impact, while maintaining well robustness. Our research provides a sustainable solution for green software engineering and promotes the efficient deployment of LLMs in real-world generative coding intelligence applications.
大语言模型(LLMs)在生成式编码任务中的广泛应用由于其高计算量和高能耗而引起了人们的关注。与以前为处理低维分类逻辑的分类模型设计的结构修剪方法不同,生成代码llm产生高维令牌逻辑序列,这使得传统的修剪目标固有地受到限制。此外,现有的单组件修剪方法进一步限制了应用于生成代码llm时的有效性。为此,我们提出了Flab-Pruner,这是一种结合词汇、层和前馈网络(FFN)修剪的创新的统一结构修剪方法。这种方法在保持性能的同时有效地减少了模型参数。此外,我们还引入了针对编码任务的定制代码指令数据策略,以提高剪枝模型的性能恢复效率。通过对三个最先进的代码llm在多个生成编码任务中的广泛评估,结果表明,在修剪22%的参数后,Flab-Pruner平均保留了原始代码生成性能的97%,并且在训练后达到相同甚至更好的性能。修剪后的模型在存储、GPU使用、计算效率和环境影响方面都有显著改善,同时保持了良好的鲁棒性。我们的研究为绿色软件工程提供了一个可持续的解决方案,并促进了llm在现实世界生成编码智能应用中的有效部署。
{"title":"Less is more: Towards green code large language models via unified structural pruning","authors":"Guang Yang ,&nbsp;Yu Zhou ,&nbsp;Xiangyu Zhang ,&nbsp;Wei Cheng ,&nbsp;Ke Liu ,&nbsp;Xiang Chen ,&nbsp;Terry Yue Zhuo ,&nbsp;Taolue Chen","doi":"10.1016/j.ipm.2025.104580","DOIUrl":"10.1016/j.ipm.2025.104580","url":null,"abstract":"<div><div>The extensive application of Large Language Models (LLMs) in generative coding tasks has raised concerns due to their high computational demands and energy consumption. Unlike previous structural pruning methods designed for classification models that deal with low-dimensional classification logits, generative Code LLMs produce high-dimensional token logit sequences, making traditional pruning objectives inherently limited. Moreover, existing single-component pruning approaches further constrain the effectiveness when applied to generative Code LLMs. In response, we propose <span>Flab-Pruner</span>, an innovative unified structural pruning method that combines vocabulary, layer, and Feed-Forward Network (FFN) pruning. This approach effectively reduces model parameters while maintaining performance. Additionally, we introduce a customized code instruction data strategy for coding tasks to enhance the performance recovery efficiency of the pruned model. Through extensive evaluations on three state-of-the-art Code LLMs across multiple generative coding tasks, the results demonstrate that <span>Flab-Pruner</span> retains 97% of the original code generation performance on average after pruning 22% of the parameters, and achieves the same or even better performance after post-training. The pruned models exhibit significant improvements in storage, GPU usage, computational efficiency, and environmental impact, while maintaining well robustness. Our research provides a sustainable solution for green software engineering and promotes the efficient deployment of LLMs in real-world generative coding intelligence applications.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 4","pages":"Article 104580"},"PeriodicalIF":6.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886176","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