首页 > 最新文献

Information Fusion最新文献

英文 中文
The bi-level consensus model with dual social networks for group decision making 用于群体决策的双社会网络双层共识模型
IF 14.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-25 DOI: 10.1016/j.inffus.2024.102714
Xiujuan Ma , Xinwang Liu , Zaiwu Gong , Fang Liu
The pursuit of consensus within social networks is a burgeoning area of research, pivotal for harmonizing decision-making amidst diverse opinions. However, existing studies often neglect the crucial balance between costs and benefits in optimizing consensus outcomes. Addressing this gap, this paper introduces a novel bi-level consensus optimization model within the framework of the dual social network. This model aims to achieve an equilibrium between minimizing costs and maximizing benefits, crucial for sustainable decision-making processes. The dual social network framework incorporates positive and negative interactions stemming from trust and opinion similarities, delineating nodes into close, distant, and mixed types based on their relational dynamics. Central to the model is a heterogeneous cost function that integrates individual influence and opinion adjustment, accounting comprehensively for moderator tolerance and incentivization mechanisms. To solve this multi-faceted optimization challenge, the paper proposes a solution leveraging a multi-objective particle swarm algorithm. Through simulation experiments conducted across four distinct social network decision-making scenarios, including a case study on capital investment in an epidemic response center, the paper validates the efficacy and practical applicability of the algorithm. The results underscore the model’s capability to achieve balanced consensus outcomes, offering insights into optimizing decision processes within complex social environments.
在社交网络中寻求共识是一个新兴的研究领域,对于在不同意见中协调决策至关重要。然而,现有研究往往忽视了在优化共识结果时成本与收益之间的关键平衡。为了弥补这一不足,本文在二元社会网络框架内引入了一个新颖的双层共识优化模型。该模型旨在实现成本最小化和收益最大化之间的平衡,这对可持续决策过程至关重要。双重社会网络框架包含了源自信任和观点相似性的积极和消极互动,根据节点的关系动态将其划分为亲密型、疏远型和混合型。该模型的核心是一个异质成本函数,它综合了个人影响力和意见调整,全面考虑了调节者容忍度和激励机制。为了解决这一多方面的优化难题,本文提出了一种利用多目标粒子群算法的解决方案。通过对四种不同的社交网络决策场景进行模拟实验,包括对流行病响应中心资本投资的案例研究,本文验证了该算法的有效性和实际适用性。结果强调了该模型实现平衡共识结果的能力,为在复杂的社会环境中优化决策过程提供了启示。
{"title":"The bi-level consensus model with dual social networks for group decision making","authors":"Xiujuan Ma ,&nbsp;Xinwang Liu ,&nbsp;Zaiwu Gong ,&nbsp;Fang Liu","doi":"10.1016/j.inffus.2024.102714","DOIUrl":"10.1016/j.inffus.2024.102714","url":null,"abstract":"<div><div>The pursuit of consensus within social networks is a burgeoning area of research, pivotal for harmonizing decision-making amidst diverse opinions. However, existing studies often neglect the crucial balance between costs and benefits in optimizing consensus outcomes. Addressing this gap, this paper introduces a novel bi-level consensus optimization model within the framework of the dual social network. This model aims to achieve an equilibrium between minimizing costs and maximizing benefits, crucial for sustainable decision-making processes. The dual social network framework incorporates positive and negative interactions stemming from trust and opinion similarities, delineating nodes into close, distant, and mixed types based on their relational dynamics. Central to the model is a heterogeneous cost function that integrates individual influence and opinion adjustment, accounting comprehensively for moderator tolerance and incentivization mechanisms. To solve this multi-faceted optimization challenge, the paper proposes a solution leveraging a multi-objective particle swarm algorithm. Through simulation experiments conducted across four distinct social network decision-making scenarios, including a case study on capital investment in an epidemic response center, the paper validates the efficacy and practical applicability of the algorithm. The results underscore the model’s capability to achieve balanced consensus outcomes, offering insights into optimizing decision processes within complex social environments.</div></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"114 ","pages":"Article 102714"},"PeriodicalIF":14.7,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142359390","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 survey on pragmatic processing techniques 实用处理技术调查
IF 14.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-25 DOI: 10.1016/j.inffus.2024.102712
Rui Mao , Mengshi Ge , Sooji Han , Wei Li , Kai He , Luyao Zhu , Erik Cambria
Pragmatics, situated in the domains of linguistics and computational linguistics, explores the influence of context on language interpretation, extending beyond the literal meaning of expressions. It constitutes a fundamental element for natural language understanding in machine intelligence. With the advancement of large language models, the research focus in natural language processing has predominantly shifted toward high-level task processing, inadvertently downplaying the importance of foundational pragmatic processing tasks. Nevertheless, pragmatics serves as a crucial medium for unraveling human language cognition. The exploration of pragmatic processing stands as a pivotal facet in realizing linguistic intelligence. This survey encompasses important pragmatic processing techniques for subjective and emotive tasks, such as personality recognition, sarcasm detection, metaphor understanding, aspect extraction, and sentiment polarity detection. It spans theoretical research, the forefront of pragmatic processing techniques, and downstream applications, aiming to highlight the significance of these low-level tasks in advancing natural language understanding and linguistic intelligence.
语用学属于语言学和计算语言学的范畴,探讨语境对语言解释的影响,超越表达的字面意义。它是机器智能中自然语言理解的基本要素。随着大型语言模型的发展,自然语言处理的研究重点主要转向高级任务处理,无意中淡化了基础语用处理任务的重要性。然而,语用学是揭示人类语言认知的重要媒介。对语用加工的探索是实现语言智能的一个关键方面。本调查涵盖了用于主观和情感任务的重要语用处理技术,如个性识别、讽刺检测、隐喻理解、方面提取和情感极性检测。它横跨理论研究、语用处理技术的前沿和下游应用,旨在强调这些低级任务在推进自然语言理解和语言智能方面的重要意义。
{"title":"A survey on pragmatic processing techniques","authors":"Rui Mao ,&nbsp;Mengshi Ge ,&nbsp;Sooji Han ,&nbsp;Wei Li ,&nbsp;Kai He ,&nbsp;Luyao Zhu ,&nbsp;Erik Cambria","doi":"10.1016/j.inffus.2024.102712","DOIUrl":"10.1016/j.inffus.2024.102712","url":null,"abstract":"<div><div>Pragmatics, situated in the domains of linguistics and computational linguistics, explores the influence of context on language interpretation, extending beyond the literal meaning of expressions. It constitutes a fundamental element for natural language understanding in machine intelligence. With the advancement of large language models, the research focus in natural language processing has predominantly shifted toward high-level task processing, inadvertently downplaying the importance of foundational pragmatic processing tasks. Nevertheless, pragmatics serves as a crucial medium for unraveling human language cognition. The exploration of pragmatic processing stands as a pivotal facet in realizing linguistic intelligence. This survey encompasses important pragmatic processing techniques for subjective and emotive tasks, such as personality recognition, sarcasm detection, metaphor understanding, aspect extraction, and sentiment polarity detection. It spans theoretical research, the forefront of pragmatic processing techniques, and downstream applications, aiming to highlight the significance of these low-level tasks in advancing natural language understanding and linguistic intelligence.</div></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"114 ","pages":"Article 102712"},"PeriodicalIF":14.7,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142329498","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
Cross-attention guided loss-based deep dual-branch fusion network for liver tumor classification 基于交叉注意引导损失的深度双分支融合网络用于肝脏肿瘤分类
IF 14.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-24 DOI: 10.1016/j.inffus.2024.102713
Rui Wang , Xiaoshuang Shi , Shuting Pang , Yidi Chen , Xiaofeng Zhu , Wentao Wang , Jiabin Cai , Danjun Song , Kang Li
Recently, convolutional neural networks (CNNs) and multiple instance learning (MIL) methods have been successfully applied to MRI images. However, CNNs directly utilize the whole image as the model input and the downsampling strategy (like max or mean pooling) to reduce the size of the feature map, thereby possibly neglecting some local details. And MIL methods learn instance-level or local features without considering spatial information. To overcome these issues, in this paper, we propose a novel cross-attention guided loss-based dual-branch framework (LCA-DB) to leverage spatial and local image information simultaneously, which is composed of an image-based attention network (IA-Net), a patch-based attention network (PA-Net) and a cross-attention module (CA). Specifically, IA-Net directly learns image features with loss-based attention to mine significant regions, meanwhile, PA-Net captures patch-specific representations to extract crucial patches related to the tumor. Additionally, the cross-attention module is designed to integrate patch-level features by using attention weights generated from each other, thereby assisting them in mining supplement region information and enhancing the interactive collaboration of the two branches. Moreover, we employ an attention similarity loss to further reduce the semantic inconsistency of attention weights obtained from the two branches. Finally, extensive experiments on three liver tumor classification tasks demonstrate the effectiveness of the proposed framework, e.g., on the LLD-MMRI–7, our method achieves 69.2%, 65.9% and 88.5% on the seven-class liver tumor classification tasks in terms of accuracy, F1 score and AUC, with the superior classification and interpretation performance over recent state-of-the-art methods. The source code of LCA-DB is available at https://github.com/Wangrui-berry/Cross-attention.
最近,卷积神经网络(CNN)和多实例学习(MIL)方法已成功应用于核磁共振成像。然而,卷积神经网络直接利用整个图像作为模型输入,并采用降采样策略(如最大值或均值池化)来缩小特征图的大小,从而可能忽略一些局部细节。而 MIL 方法只学习实例级或局部特征,不考虑空间信息。为了克服这些问题,我们在本文中提出了一种新颖的基于交叉注意力引导的损失双分支框架(LCA-DB),它由基于图像的注意力网络(IA-Net)、基于斑块的注意力网络(PA-Net)和交叉注意力模块(CA)组成,可同时利用空间和局部图像信息。具体来说,IA-Net 通过基于损失的注意力直接学习图像特征,挖掘重要区域;PA-Net 则捕捉特定的斑块表征,提取与肿瘤相关的关键斑块。此外,交叉注意力模块旨在通过使用彼此生成的注意力权重来整合补丁级特征,从而帮助它们挖掘补充区域信息,增强两个分支的交互协作。此外,我们还采用了注意力相似性损失来进一步降低两个分支所获得的注意力权重在语义上的不一致性。最后,在三个肝脏肿瘤分类任务上的大量实验证明了所提框架的有效性,例如,在 LLD-MMRI-7 七类肝脏肿瘤分类任务上,我们的方法在准确率、F1 分数和 AUC 方面分别达到了 69.2%、65.9% 和 88.5%,分类和解释性能均优于最近的先进方法。LCA-DB的源代码可在https://github.com/Wangrui-berry/Cross-attention。
{"title":"Cross-attention guided loss-based deep dual-branch fusion network for liver tumor classification","authors":"Rui Wang ,&nbsp;Xiaoshuang Shi ,&nbsp;Shuting Pang ,&nbsp;Yidi Chen ,&nbsp;Xiaofeng Zhu ,&nbsp;Wentao Wang ,&nbsp;Jiabin Cai ,&nbsp;Danjun Song ,&nbsp;Kang Li","doi":"10.1016/j.inffus.2024.102713","DOIUrl":"10.1016/j.inffus.2024.102713","url":null,"abstract":"<div><div>Recently, convolutional neural networks (CNNs) and multiple instance learning (MIL) methods have been successfully applied to MRI images. However, CNNs directly utilize the whole image as the model input and the downsampling strategy (like max or mean pooling) to reduce the size of the feature map, thereby possibly neglecting some local details. And MIL methods learn instance-level or local features without considering spatial information. To overcome these issues, in this paper, we propose a novel cross-attention guided loss-based dual-branch framework (LCA-DB) to leverage spatial and local image information simultaneously, which is composed of an image-based attention network (IA-Net), a patch-based attention network (PA-Net) and a cross-attention module (CA). Specifically, IA-Net directly learns image features with loss-based attention to mine significant regions, meanwhile, PA-Net captures patch-specific representations to extract crucial patches related to the tumor. Additionally, the cross-attention module is designed to integrate patch-level features by using attention weights generated from each other, thereby assisting them in mining supplement region information and enhancing the interactive collaboration of the two branches. Moreover, we employ an attention similarity loss to further reduce the semantic inconsistency of attention weights obtained from the two branches. Finally, extensive experiments on three liver tumor classification tasks demonstrate the effectiveness of the proposed framework, e.g., on the LLD-MMRI–7, our method achieves 69.2%, 65.9% and 88.5% on the seven-class liver tumor classification tasks in terms of accuracy, F<span><math><msub><mrow></mrow><mrow><mn>1</mn></mrow></msub></math></span> score and AUC, with the superior classification and interpretation performance over recent state-of-the-art methods. The source code of LCA-DB is available at <span><span>https://github.com/Wangrui-berry/Cross-attention</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"114 ","pages":"Article 102713"},"PeriodicalIF":14.7,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142322701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Knowledge-aware multimodal pre-training for fake news detection 用于假新闻检测的知识感知多模态预培训
IF 14.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-24 DOI: 10.1016/j.inffus.2024.102715
Litian Zhang , Xiaoming Zhang , Ziyi Zhou , Xi Zhang , Philip S. Yu , Chaozhuo Li
Amidst the rapid propagation of multimodal fake news across various social media platforms, the identification and filtering of disinformation have emerged as critical areas of academic research. A salient characteristic of fake news lies in its diversity, encompassing text–image inconsistency, content–knowledge inconsistency, and content fabrication. However, existing endeavors are generally tailored to a specific subset of fake news, leading to limited universality. Moreover, these models primarily rely on scarce and exorbitant manually labeled annotations, which is incapable of providing sufficient learning signals to detect a variety of fake news. To address these challenges, we propose a novel knowledge-aware multimodal pre-training paradigm for fake news detection, dubbed KAMP. Our motivation lies in incorporating unsupervised correlations through pre-training tasks as complementary to alleviate the dependency on annotations. KAMP consists of a novel multimodal learning model and various delicate pre-training tasks to simultaneously capture valuable knowledge from single modality, multiple modalities, and background knowledge graphs. Our proposal undergoes comprehensive evaluation across two widely utilized datasets, and experimental results demonstrate the superiority of our proposal.
随着多模态假新闻在各种社交媒体平台上的迅速传播,识别和过滤虚假信息已成为学术研究的关键领域。假新闻的一个显著特点在于其多样性,包括文本与图像不一致、内容与知识不一致以及内容捏造。然而,现有的研究一般都是针对特定的假新闻子集,导致其普遍性有限。此外,这些模型主要依赖于稀缺且昂贵的人工标注注释,无法提供足够的学习信号来检测各种假新闻。为了应对这些挑战,我们提出了一种用于假新闻检测的新型知识感知多模态预训练范式,称为 KAMP。我们的动机在于通过预训练任务纳入无监督相关性作为补充,以减轻对注释的依赖。KAMP 由一个新颖的多模态学习模型和各种精细的预训练任务组成,可同时从单模态、多模态和背景知识图谱中获取有价值的知识。我们的建议在两个广泛使用的数据集上进行了全面评估,实验结果证明了我们建议的优越性。
{"title":"Knowledge-aware multimodal pre-training for fake news detection","authors":"Litian Zhang ,&nbsp;Xiaoming Zhang ,&nbsp;Ziyi Zhou ,&nbsp;Xi Zhang ,&nbsp;Philip S. Yu ,&nbsp;Chaozhuo Li","doi":"10.1016/j.inffus.2024.102715","DOIUrl":"10.1016/j.inffus.2024.102715","url":null,"abstract":"<div><div>Amidst the rapid propagation of multimodal fake news across various social media platforms, the identification and filtering of disinformation have emerged as critical areas of academic research. A salient characteristic of fake news lies in its diversity, encompassing text–image inconsistency, content–knowledge inconsistency, and content fabrication. However, existing endeavors are generally tailored to a specific subset of fake news, leading to limited universality. Moreover, these models primarily rely on scarce and exorbitant manually labeled annotations, which is incapable of providing sufficient learning signals to detect a variety of fake news. To address these challenges, we propose a novel knowledge-aware multimodal pre-training paradigm for fake news detection, dubbed KAMP. Our motivation lies in incorporating unsupervised correlations through pre-training tasks as complementary to alleviate the dependency on annotations. KAMP consists of a novel multimodal learning model and various delicate pre-training tasks to simultaneously capture valuable knowledge from single modality, multiple modalities, and background knowledge graphs. Our proposal undergoes comprehensive evaluation across two widely utilized datasets, and experimental results demonstrate the superiority of our proposal.</div></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"114 ","pages":"Article 102715"},"PeriodicalIF":14.7,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142329497","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
Fault stands out in contrast: Zero-shot diagnosis method based on dual-level contrastive fusion network for control moment gyroscopes predictive maintenance 故障对比突出基于双级对比融合网络的零故障诊断方法用于控制时刻陀螺仪的预测性维护
IF 14.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-21 DOI: 10.1016/j.inffus.2024.102710
Hebin Liu , Qizhi Xu , Hongyan He
Control moment gyroscopes (CMGs) are the most common control actuators in spacecraft. Their predictive maintenance is crucial for on-orbit operations. However, due to the scarcity of CMG fault data, constructing a diagnosis system for predictive maintenance with CMGs poses significant challenges. Therefore, a zero-shot fault diagnosis method based on a dual-level contrastive learning fusion network was proposed. First, to address the difficulty in training CMG fault diagnosis models without fault data, a contrastive learning method based on CMG clusters was proposed to extract invariant features from healthy CMGs and achieve zero-shot diagnosis for predictive maintenance. Second, considering the limitations of information from a single sensor, a cross-sensor contrastive learning method was proposed to fuse features from different sensors. Third, to tackle the challenges of extracting weak potential fault features, a dual-level joint training method was introduced to enhance the model’s feature extraction capability. Finally, the proposed method was validated using real dataset collected from CMGs serviced on an in-orbit spacecraft. The results demonstrate that the method can achieve zero-shot fault diagnosis for control moment gyroscopes predictive maintenance. The code is available at https://github.com/IceLRiver/DCF.
控制力矩陀螺仪(CMG)是航天器中最常见的控制执行器。它们的预测性维护对在轨运行至关重要。然而,由于 CMG 故障数据稀缺,构建 CMG 预测性维护诊断系统面临着巨大挑战。因此,本文提出了一种基于双层对比学习融合网络的零点故障诊断方法。首先,针对在没有故障数据的情况下训练 CMG 故障诊断模型的困难,提出了一种基于 CMG 簇的对比学习方法,从健康的 CMG 中提取不变特征,实现预测性维护的零次诊断。其次,考虑到单一传感器信息的局限性,提出了一种跨传感器对比学习方法,以融合不同传感器的特征。第三,为解决提取弱潜在故障特征的难题,引入了双级联合训练方法,以增强模型的特征提取能力。最后,利用在轨航天器上安装的 CMG 收集的真实数据集对所提出的方法进行了验证。结果表明,该方法可以实现控制矩陀螺仪预测性维护的零故障诊断。代码见 https://github.com/IceLRiver/DCF。
{"title":"Fault stands out in contrast: Zero-shot diagnosis method based on dual-level contrastive fusion network for control moment gyroscopes predictive maintenance","authors":"Hebin Liu ,&nbsp;Qizhi Xu ,&nbsp;Hongyan He","doi":"10.1016/j.inffus.2024.102710","DOIUrl":"10.1016/j.inffus.2024.102710","url":null,"abstract":"<div><div>Control moment gyroscopes (CMGs) are the most common control actuators in spacecraft. Their predictive maintenance is crucial for on-orbit operations. However, due to the scarcity of CMG fault data, constructing a diagnosis system for predictive maintenance with CMGs poses significant challenges. Therefore, a zero-shot fault diagnosis method based on a dual-level contrastive learning fusion network was proposed. First, to address the difficulty in training CMG fault diagnosis models without fault data, a contrastive learning method based on CMG clusters was proposed to extract invariant features from healthy CMGs and achieve zero-shot diagnosis for predictive maintenance. Second, considering the limitations of information from a single sensor, a cross-sensor contrastive learning method was proposed to fuse features from different sensors. Third, to tackle the challenges of extracting weak potential fault features, a dual-level joint training method was introduced to enhance the model’s feature extraction capability. Finally, the proposed method was validated using real dataset collected from CMGs serviced on an in-orbit spacecraft. The results demonstrate that the method can achieve zero-shot fault diagnosis for control moment gyroscopes predictive maintenance. The code is available at <span><span>https://github.com/IceLRiver/DCF</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"114 ","pages":"Article 102710"},"PeriodicalIF":14.7,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142320190","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
Graph refinement and consistency self-supervision for tensorized incomplete multi-view clustering 张量不完全多视图聚类的图细化和一致性自监督
IF 14.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-20 DOI: 10.1016/j.inffus.2024.102709
Wei Liu , Xiaoyuan Jing , Deyu Zeng , Tengyu Zhang

In practical multi-view applications, some data in each view are missing. Although recent incomplete multi-view clustering (IMC) approaches have achieved encouraging performance, two challenges remain. They utilize the tensor nuclear norm to explore the high-order correlations among view-specific similarity graphs. Moreover, they only infer the missing views but do not recover the consensus cluster structure across complete views. To address these issues, we propose a new method called graph Refinement and consistency Self-Supervision for Tensorized Incomplete Multi-view Clustering (RS-TIMC). Specifically, RS-TIMC introduces graph decomposition to remove the diverse similarities from the view-specific graphs and utilizes the tensor Schatten-p norm to model the consistent parts. Additionally, by extracting features from the original observable data and inferring the missing instances, RS-TIMC enables the cluster structure of each complete view to be adjusted. Finally, RS-TIMC utilizes consistent similarity graphs to recover the shared local geometric structure across all complete views. Experimental evaluations on several datasets indicate that our method outperforms the start-of-the-art approaches.

在实际的多视图应用中,每个视图中都会缺少一些数据。尽管最近的不完整多视图聚类(IMC)方法取得了令人鼓舞的性能,但仍存在两个挑战。它们利用张量核规范来探索特定视图相似性图之间的高阶相关性。此外,它们只能推断出缺失的视图,却不能恢复完整视图中的共识聚类结构。为了解决这些问题,我们提出了一种名为 "张量化不完整多视图聚类的图细化和一致性自我监督(RS-TIMC)"的新方法。具体来说,RS-TIMC 引入了图分解,以去除特定视图图中的各种相似性,并利用张量 Schatten-p norm 对一致部分进行建模。此外,通过从原始可观测数据中提取特征并推断缺失实例,RS-TIMC 可以调整每个完整视图的聚类结构。最后,RS-TIMC 利用一致性相似图来恢复所有完整视图中共享的局部几何结构。在多个数据集上进行的实验评估表明,我们的方法优于最先进的方法。
{"title":"Graph refinement and consistency self-supervision for tensorized incomplete multi-view clustering","authors":"Wei Liu ,&nbsp;Xiaoyuan Jing ,&nbsp;Deyu Zeng ,&nbsp;Tengyu Zhang","doi":"10.1016/j.inffus.2024.102709","DOIUrl":"10.1016/j.inffus.2024.102709","url":null,"abstract":"<div><p>In practical multi-view applications, some data in each view are missing. Although recent incomplete multi-view clustering (IMC) approaches have achieved encouraging performance, two challenges remain. They utilize the tensor nuclear norm to explore the high-order correlations among view-specific similarity graphs. Moreover, they only infer the missing views but do not recover the consensus cluster structure across complete views. To address these issues, we propose a new method called graph Refinement and consistency Self-Supervision for Tensorized Incomplete Multi-view Clustering (RS-TIMC). Specifically, RS-TIMC introduces graph decomposition to remove the diverse similarities from the view-specific graphs and utilizes the tensor Schatten-p norm to model the consistent parts. Additionally, by extracting features from the original observable data and inferring the missing instances, RS-TIMC enables the cluster structure of each complete view to be adjusted. Finally, RS-TIMC utilizes consistent similarity graphs to recover the shared local geometric structure across all complete views. Experimental evaluations on several datasets indicate that our method outperforms the start-of-the-art approaches.</p></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"114 ","pages":"Article 102709"},"PeriodicalIF":14.7,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142272565","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 dual branch graph neural network based spatial interpolation method for traffic data inference in unobserved locations 基于双分支图神经网络的空间插值方法,用于无观测地点的交通数据推断
IF 14.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-20 DOI: 10.1016/j.inffus.2024.102703
Wujiang Zhu , Xinyuan Zhou , Shiyong Lan , Wenwu Wang , Zhiang Hou , Yao Ren , Tianyi Pan
Complete traffic data collection is crucial for intelligent transportation system, but due to various factors such as cost, it is not possible to deploy sensors at every location. Using spatial interpolation, the traffic data for unobserved locations can be inferred from the data of observed locations, providing fine-grained measurements for improved traffic monitoring and control. However, existing methods are limited in modeling the dynamic spatio-temporal dependencies between traffic locations, resulting in unsatisfactory performance of spatial interpolation for unobserved locations in traffic scene. To address this issue, we propose a novel dual branch graph neural network (DBGNN) for spatial interpolation by exploiting dynamic spatio-temporal correlation among traffic nodes. The proposed DBGNN is composed of two branches: the main branch and the auxiliary branch. They are designed to capture the wide-range dynamic spatial correlation and the local detailed spatial diffusion between nodes, respectively. Finally, they are fused via a self-attention mechanism. Extensive experiments on six public datasets demonstrate the advantages of our DBGNN over the state-of-the-art baselines. The codes will be available at https://github.com/SYLan2019/DBGNN.
完整的交通数据收集对智能交通系统至关重要,但由于成本等各种因素,不可能在每个地点都部署传感器。利用空间插值法,可以从观测点的数据中推断出未观测点的交通数据,为改进交通监控提供精细测量。然而,现有方法在模拟交通位置之间的动态时空依赖关系方面存在局限性,导致交通场景中未观测位置的空间插值效果不尽如人意。针对这一问题,我们提出了一种新型双分支图神经网络(DBGNN),利用交通节点之间的动态时空相关性进行空间插值。所提出的 DBGNN 由两个分支组成:主分支和辅助分支。它们分别用于捕捉节点间的大范围动态空间相关性和局部细节空间扩散。最后,它们通过自我关注机制进行融合。在六个公共数据集上进行的广泛实验证明了我们的 DBGNN 相对于最先进基线的优势。相关代码将发布在 https://github.com/SYLan2019/DBGNN 网站上。
{"title":"A dual branch graph neural network based spatial interpolation method for traffic data inference in unobserved locations","authors":"Wujiang Zhu ,&nbsp;Xinyuan Zhou ,&nbsp;Shiyong Lan ,&nbsp;Wenwu Wang ,&nbsp;Zhiang Hou ,&nbsp;Yao Ren ,&nbsp;Tianyi Pan","doi":"10.1016/j.inffus.2024.102703","DOIUrl":"10.1016/j.inffus.2024.102703","url":null,"abstract":"<div><div>Complete traffic data collection is crucial for intelligent transportation system, but due to various factors such as cost, it is not possible to deploy sensors at every location. Using spatial interpolation, the traffic data for unobserved locations can be inferred from the data of observed locations, providing fine-grained measurements for improved traffic monitoring and control. However, existing methods are limited in modeling the dynamic spatio-temporal dependencies between traffic locations, resulting in unsatisfactory performance of spatial interpolation for unobserved locations in traffic scene. To address this issue, we propose a novel dual branch graph neural network (DBGNN) for spatial interpolation by exploiting dynamic spatio-temporal correlation among traffic nodes. The proposed DBGNN is composed of two branches: the main branch and the auxiliary branch. They are designed to capture the wide-range dynamic spatial correlation and the local detailed spatial diffusion between nodes, respectively. Finally, they are fused via a self-attention mechanism. Extensive experiments on six public datasets demonstrate the advantages of our DBGNN over the state-of-the-art baselines. The codes will be available at <span><span>https://github.com/SYLan2019/DBGNN</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"114 ","pages":"Article 102703"},"PeriodicalIF":14.7,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142326323","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
Fortifying NLP models against poisoning attacks: The power of personalized prediction architectures 强化 NLP 模型,抵御中毒攻击:个性化预测架构的力量
IF 14.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-19 DOI: 10.1016/j.inffus.2024.102692
Teddy Ferdinan, Jan Kocoń

In Natural Language Processing (NLP), state-of-the-art machine learning models heavily depend on vast amounts of training data. Often, this data is sourced from third parties, such as crowdsourcing platforms, to enable swift and efficient annotation collection for supervised learning. Yet, such an approach is susceptible to poisoning attacks where malicious agents deliberately insert harmful data to skew the resulting model behavior. Current countermeasures to these attacks either come at a significant cost, lack full efficacy, or are simply non-applicable. This study introduces and evaluates the potential of personalized model architectures as a defense against these threats. By comparing two top-performing personalized model architectures, User-ID and HuBi-Medium, against a standard non-personalized baseline across two NLP tasks and various simulated attack scenarios, we found that the personalized model architectures significantly outperformed the baseline. The robustness advantage increased with the rise in malicious annotations. Notably, the User-ID model excelled in safeguarding predictions for legitimate users from the influence of malicious annotations. Our findings emphasize the benefit of adopting personalized model architectures to bolster NLP system defenses against poisoning attacks.

在自然语言处理(NLP)领域,最先进的机器学习模型在很大程度上依赖于大量的训练数据。这些数据通常来自第三方,如众包平台,以便为监督学习快速、高效地收集注释。然而,这种方法很容易受到 "中毒 "攻击,即恶意代理蓄意插入有害数据,以歪曲由此产生的模型行为。目前针对这些攻击的对策要么成本高昂,要么缺乏全面的有效性,要么根本无法应用。本研究介绍并评估了个性化模型架构作为防御这些威胁的潜力。通过在两个 NLP 任务和各种模拟攻击场景中将两个表现最佳的个性化模型架构(User-ID 和 HuBi-Medium )与标准非个性化基线进行比较,我们发现个性化模型架构的表现明显优于基线。随着恶意注释的增加,鲁棒性优势也在增加。值得注意的是,User-ID 模型在保护合法用户的预测不受恶意注释影响方面表现出色。我们的研究结果强调了采用个性化模型架构来增强 NLP 系统防御中毒攻击的优势。
{"title":"Fortifying NLP models against poisoning attacks: The power of personalized prediction architectures","authors":"Teddy Ferdinan,&nbsp;Jan Kocoń","doi":"10.1016/j.inffus.2024.102692","DOIUrl":"10.1016/j.inffus.2024.102692","url":null,"abstract":"<div><p>In Natural Language Processing (NLP), state-of-the-art machine learning models heavily depend on vast amounts of training data. Often, this data is sourced from third parties, such as crowdsourcing platforms, to enable swift and efficient annotation collection for supervised learning. Yet, such an approach is susceptible to poisoning attacks where malicious agents deliberately insert harmful data to skew the resulting model behavior. Current countermeasures to these attacks either come at a significant cost, lack full efficacy, or are simply non-applicable. This study introduces and evaluates the potential of personalized model architectures as a defense against these threats. By comparing two top-performing personalized model architectures, User-ID and HuBi-Medium, against a standard non-personalized baseline across two NLP tasks and various simulated attack scenarios, we found that the personalized model architectures significantly outperformed the baseline. The robustness advantage increased with the rise in malicious annotations. Notably, the User-ID model excelled in safeguarding predictions for legitimate users from the influence of malicious annotations. Our findings emphasize the benefit of adopting personalized model architectures to bolster NLP system defenses against poisoning attacks.</p></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"114 ","pages":"Article 102692"},"PeriodicalIF":14.7,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1566253524004706/pdfft?md5=3a6019ed5699d3ea16b3237461a74599&pid=1-s2.0-S1566253524004706-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142272904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Recent advances in complementary label learning 互补标签学习的最新进展
IF 14.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-19 DOI: 10.1016/j.inffus.2024.102702
Yingjie Tian , Haoran Jiang
Complementary Label Learning (CLL), a crucial aspect of weakly supervised learning, has seen significant theoretical and practical advancements. However, a comprehensive review of the field has been lacking. This survey provides the first exhaustive compilation and synthesis of state-of-the-art CLL approaches, filling a critical gap in the literature and serving as a foundational resource for the community. Key contributions of this survey include an extensive categorization of CLL methodologies, clarifying diverse algorithms based on their principles and applications. This classification scheme enhances understanding of the CLL landscape, highlighting its versatility across varied settings. Additionally, the survey examines the evolution of CLL, showcasing its adaptability and potential in addressing complex applications. It also explores experimental frameworks, including processes for generating complementary labels and datasets and numerical evaluation of existing state-of-the-art. Moreover, the survey delves into how CLL integrates with and enhances other weakly supervised and semi-supervised learning approaches, deepening understanding of its role in the broader machine learning ecosystem. Overall, this survey not only compiles CLL research but also guides future explorations, steering the field towards new horizons in weakly supervised learning.
互补标签学习(CLL)是弱监督学习的一个重要方面,在理论和实践方面都取得了重大进展。然而,该领域一直缺乏全面的综述。本调查报告首次对最先进的互补标签学习方法进行了详尽的汇编和综合,填补了文献中的一个重要空白,是该领域的基础资源。本调查报告的主要贡献包括对 CLL 方法进行了广泛分类,根据其原理和应用阐明了各种算法。这种分类方法加深了人们对 CLL 现状的了解,突出了其在不同环境中的多样性。此外,调查还研究了 CLL 的演变,展示了其在解决复杂应用方面的适应性和潜力。调查还探讨了实验框架,包括生成补充标签和数据集的过程,以及对现有先进技术的数值评估。此外,调查还深入探讨了 CLL 如何与其他弱监督和半监督学习方法相集成并增强其效果,从而加深了对 CLL 在更广泛的机器学习生态系统中的作用的理解。总之,本调查不仅汇编了 CLL 的研究,还为未来的探索提供了指导,引导该领域走向弱监督学习的新天地。
{"title":"Recent advances in complementary label learning","authors":"Yingjie Tian ,&nbsp;Haoran Jiang","doi":"10.1016/j.inffus.2024.102702","DOIUrl":"10.1016/j.inffus.2024.102702","url":null,"abstract":"<div><div>Complementary Label Learning (CLL), a crucial aspect of weakly supervised learning, has seen significant theoretical and practical advancements. However, a comprehensive review of the field has been lacking. This survey provides the first exhaustive compilation and synthesis of state-of-the-art CLL approaches, filling a critical gap in the literature and serving as a foundational resource for the community. Key contributions of this survey include an extensive categorization of CLL methodologies, clarifying diverse algorithms based on their principles and applications. This classification scheme enhances understanding of the CLL landscape, highlighting its versatility across varied settings. Additionally, the survey examines the evolution of CLL, showcasing its adaptability and potential in addressing complex applications. It also explores experimental frameworks, including processes for generating complementary labels and datasets and numerical evaluation of existing state-of-the-art. Moreover, the survey delves into how CLL integrates with and enhances other weakly supervised and semi-supervised learning approaches, deepening understanding of its role in the broader machine learning ecosystem. Overall, this survey not only compiles CLL research but also guides future explorations, steering the field towards new horizons in weakly supervised learning.</div></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"114 ","pages":"Article 102702"},"PeriodicalIF":14.7,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142322702","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
Multiplex graph aggregation and feature refinement for unsupervised incomplete multimodal emotion recognition 用于无监督不完整多模态情感识别的多重图聚合和特征细化
IF 14.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-19 DOI: 10.1016/j.inffus.2024.102711
Yuanyue Deng , Jintang Bian , Shisong Wu , Jianhuang Lai , Xiaohua Xie

Multimodal Emotion Recognition (MER) involves integrating information of various modalities, including audio, visual, text and physiological signals, to comprehensively grasp human sentiments, which has emerged as a vibrant area within human–computer interaction. Researchers have developed many methods for this task, but many of these methods rely on labeled supervised learning and struggle to address the issue of missing some modalities of data. To address these issues, we propose a Multiplex Graph Aggregation and Feature Refinement framework for unsupervised incomplete MER, comprising four modules: Completion, Aggregation, Refinement, and Embedding. Specifically, we first capture the correlation information between samples using the graph structures, which aids in the completion of missing data and the multiplex aggregation of multimodal data. Then, we perform refinement operations on the aggregated features as well as alignment and enhancement operations on the embedding features to obtain the fused feature representations, which are consistent, highly separable and conducive to emotion recognition. Experimental results on multimodal emotion recognition datasets demonstrate that our method achieves state-of-the-art performance among unsupervised methods, validating its effectiveness.

多模态情感识别(MER)涉及整合各种模态的信息,包括音频、视觉、文本和生理信号,以全面把握人类情感,这已成为人机交互中一个充满活力的领域。研究人员为这项任务开发了许多方法,但其中许多方法依赖于标记监督学习,难以解决某些模态数据缺失的问题。为了解决这些问题,我们提出了一个用于无监督不完整 MER 的多重图聚合和特征提炼框架,由四个模块组成:完成、聚合、提炼和嵌入。具体来说,我们首先利用图结构捕捉样本之间的相关信息,这有助于缺失数据的补全和多模态数据的多重聚合。然后,我们对聚合特征进行细化操作,并对嵌入特征进行对齐和增强操作,从而获得融合特征表示,这种表示具有一致性、高度可分性,有利于情感识别。在多模态情感识别数据集上的实验结果表明,我们的方法在无监督方法中取得了最先进的性能,验证了其有效性。
{"title":"Multiplex graph aggregation and feature refinement for unsupervised incomplete multimodal emotion recognition","authors":"Yuanyue Deng ,&nbsp;Jintang Bian ,&nbsp;Shisong Wu ,&nbsp;Jianhuang Lai ,&nbsp;Xiaohua Xie","doi":"10.1016/j.inffus.2024.102711","DOIUrl":"10.1016/j.inffus.2024.102711","url":null,"abstract":"<div><p>Multimodal Emotion Recognition (MER) involves integrating information of various modalities, including audio, visual, text and physiological signals, to comprehensively grasp human sentiments, which has emerged as a vibrant area within human–computer interaction. Researchers have developed many methods for this task, but many of these methods rely on labeled supervised learning and struggle to address the issue of missing some modalities of data. To address these issues, we propose a Multiplex Graph Aggregation and Feature Refinement framework for unsupervised incomplete MER, comprising four modules: Completion, Aggregation, Refinement, and Embedding. Specifically, we first capture the correlation information between samples using the graph structures, which aids in the completion of missing data and the multiplex aggregation of multimodal data. Then, we perform refinement operations on the aggregated features as well as alignment and enhancement operations on the embedding features to obtain the fused feature representations, which are consistent, highly separable and conducive to emotion recognition. Experimental results on multimodal emotion recognition datasets demonstrate that our method achieves state-of-the-art performance among unsupervised methods, validating its effectiveness.</p></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"114 ","pages":"Article 102711"},"PeriodicalIF":14.7,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142272905","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 Fusion
全部 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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1