首页 > 最新文献

Information Processing & Management最新文献

英文 中文
A Universal Adaptive Algorithm for Graph Anomaly Detection 图形异常检测的通用自适应算法
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-25 DOI: 10.1016/j.ipm.2024.103905
Graph-based anomaly detection aims to identify anomalous vertices in graph-structured data. It relies on the ability of graph neural networks (GNNs) to capture both relational and attribute information within graphs. However, previous GNN-based methods exhibit two critical shortcomings. Firstly, GNN is inherently a low-pass filter that tends to lead similar representations of neighboring vertices, which may result in the loss of critical anomalous information, termed as low-frequency constraints. Secondly, anomalous vertices that deliberately mimic normal vertices in features and structures are hard to detect, especially when the distribution of labels is unbalanced. To address these defects, we propose a Universal Adaptive Algorithm for Graph Anomaly Detection (U-A2GAD), which employs enhanced high frequency filters to overcome the low-frequency constraints, as well as aggregating both k-nearest neighbor (kNN) and k-farthest neighbor (kFN) to resolve the vertices’ camouflage problem. Extensive experiments demonstrated the effectiveness and universality of our proposed U-A2GAD and its constituent components, achieving improvements of up to 6% and an average increase of 2% on AUC-PR over the state-of-the-art methods. The source codes, and parameter setting details can be found at https://github.com/LIyvqi/U-A2GAD.
基于图的异常检测旨在识别图结构数据中的异常顶点。它依赖于图神经网络(GNN)捕捉图中关系和属性信息的能力。然而,以往基于图神经网络的方法存在两个关键缺陷。首先,图神经网络本质上是一种低通滤波器,往往会导致相邻顶点的相似表示,这可能会导致关键异常信息(称为低频约束)的丢失。其次,在特征和结构上刻意模仿正常顶点的异常顶点很难被检测到,尤其是在标签分布不平衡的情况下。针对这些缺陷,我们提出了一种通用自适应图形异常检测算法(U-A2GAD),该算法采用增强型高频滤波器来克服低频约束,并同时聚合 k-nearest neighbor(kNN)和 k-farthest neighbor(kFN)来解决顶点伪装问题。广泛的实验证明了我们提出的 U-A2GAD 及其组成部分的有效性和普遍性,与最先进的方法相比,U-A2GAD 的 AUC-PR 提高了 6%,平均提高了 2%。源代码和参数设置详情请访问 https://github.com/LIyvqi/U-A2GAD。
{"title":"A Universal Adaptive Algorithm for Graph Anomaly Detection","authors":"","doi":"10.1016/j.ipm.2024.103905","DOIUrl":"10.1016/j.ipm.2024.103905","url":null,"abstract":"<div><div>Graph-based anomaly detection aims to identify anomalous vertices in graph-structured data. It relies on the ability of graph neural networks (GNNs) to capture both relational and attribute information within graphs. However, previous GNN-based methods exhibit two critical shortcomings. Firstly, GNN is inherently a low-pass filter that tends to lead similar representations of neighboring vertices, which may result in the loss of critical anomalous information, termed as low-frequency constraints. Secondly, anomalous vertices that deliberately mimic normal vertices in features and structures are hard to detect, especially when the distribution of labels is unbalanced. To address these defects, we propose a <strong>U</strong>niversal <strong>A</strong>daptive <strong>A</strong>lgorithm for <strong>G</strong>raph <strong>A</strong>nomaly <strong>D</strong>etection (<strong>U-A</strong><span><math><msup><mrow></mrow><mrow><mn>2</mn></mrow></msup></math></span><strong>GAD</strong>), which employs enhanced high frequency filters to overcome the low-frequency constraints, as well as aggregating both <span><math><mi>k</mi></math></span>-nearest neighbor (<span><math><mi>k</mi></math></span>NN) and <span><math><mi>k</mi></math></span>-farthest neighbor (<span><math><mi>k</mi></math></span>FN) to resolve the vertices’ camouflage problem. Extensive experiments demonstrated the effectiveness and universality of our proposed <strong>U-A</strong><span><math><msup><mrow></mrow><mrow><mn>2</mn></mrow></msup></math></span><strong>GAD</strong> and its constituent components, achieving improvements of up to 6% and an average increase of 2% on AUC-PR over the state-of-the-art methods. The source codes, and parameter setting details can be found at <span><span>https://github.com/LIyvqi/U-A2GAD</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142319166","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
Fusing temporal and semantic dependencies for session-based recommendation 融合时间和语义依赖性,实现基于会话的推荐
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-25 DOI: 10.1016/j.ipm.2024.103896
Session-based recommendation (SBR) predicts the next item in user sequences. Existing research focuses on item transition patterns, neglecting semantic information dependencies crucial for understanding users’ preferences. Incorporating semantic characteristics is vital for accurate recommendations, especially in applications like user purchase sequences. In this paper, to tackle the above issue, we novelly propose a framework that hierarchically fuses temporal and semantic dependencies. Technically, we present the Item Transition Dependency Module and Semantic Dependency Module based on the whole session set: (i) Item Transition Dependency Module is exclusively to learn the item embeddings through temporal relations and utilizes item transitions from both global and local levels; (ii) Semantic Dependency Module develops mutually independent embeddings of both sessions and items via stable interaction relations. In addition, under the unified organization of the Cross View, semantic information is adaptively incorporated into the temporal dependency learning and used to improve the performance of SBR. Extensive experiments on three large-scale real-world datasets show the superiority of our framework over current state-of-the-art methods. In particular, our model improves its performance over SOTA on all three datasets, with 5.5%, 0.2%, and 3.0% improvements on Recall@20, and 5.8%, 4.6%, and 2.0% improvements on MRR@20, respectively.
基于会话的推荐(SBR)可预测用户序列中的下一个项目。现有研究侧重于项目转换模式,忽略了对了解用户偏好至关重要的语义信息依赖性。语义特征对于准确推荐至关重要,尤其是在用户购买序列等应用中。在本文中,为了解决上述问题,我们新颖地提出了一个分层融合时间和语义依赖关系的框架。在技术上,我们提出了基于整个会话集的项目转换依赖模块和语义依赖模块:(i) 项目转换依赖模块专门通过时间关系学习项目嵌入,并从全局和局部两个层面利用项目转换;(ii) 语义依赖模块通过稳定的交互关系开发会话和项目相互独立的嵌入。此外,在 "交叉视图 "的统一组织下,语义信息被自适应地纳入时间依赖学习,并用于提高 SBR 的性能。在三个大规模真实数据集上进行的广泛实验表明,我们的框架优于目前最先进的方法。特别是,在所有三个数据集上,我们的模型都比 SOTA 提高了性能,在 Recall@20 上分别提高了 5.5%、0.2% 和 3.0%,在 MRR@20 上分别提高了 5.8%、4.6% 和 2.0%。
{"title":"Fusing temporal and semantic dependencies for session-based recommendation","authors":"","doi":"10.1016/j.ipm.2024.103896","DOIUrl":"10.1016/j.ipm.2024.103896","url":null,"abstract":"<div><div>Session-based recommendation (SBR) predicts the next item in user sequences. Existing research focuses on item transition patterns, neglecting semantic information dependencies crucial for understanding users’ preferences. Incorporating semantic characteristics is vital for accurate recommendations, especially in applications like user purchase sequences. In this paper, to tackle the above issue, we novelly propose a framework that hierarchically fuses temporal and semantic dependencies. Technically, we present the Item Transition Dependency Module and Semantic Dependency Module based on the whole session set: (i) Item Transition Dependency Module is exclusively to learn the item embeddings through temporal relations and utilizes item transitions from both global and local levels; (ii) Semantic Dependency Module develops mutually independent embeddings of both sessions and items via stable interaction relations. In addition, under the unified organization of the Cross View, semantic information is adaptively incorporated into the temporal dependency learning and used to improve the performance of SBR. Extensive experiments on three large-scale real-world datasets show the superiority of our framework over current state-of-the-art methods. In particular, our model improves its performance over SOTA on all three datasets, with 5.5%, 0.2%, and 3.0% improvements on Recall@20, and 5.8%, 4.6%, and 2.0% improvements on MRR@20, respectively.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142319165","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 context-aware attention and graph neural network-based multimodal framework for misogyny detection 基于情境感知注意力和图神经网络的多模态厌女症检测框架
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-24 DOI: 10.1016/j.ipm.2024.103895
A substantial portion of offensive content on social media is directed towards women. Since the approaches for general offensive content detection face a challenge in detecting misogynistic content, it requires solutions tailored to address offensive content against women. To this end, we propose a novel multimodal framework for the detection of misogynistic and sexist content. The framework comprises three modules: the Multimodal Attention module (MANM), the Graph-based Feature Reconstruction Module (GFRM), and the Content-specific Features Learning Module (CFLM). The MANM employs adaptive gating-based multimodal context-aware attention, enabling the model to focus on relevant visual and textual information and generating contextually relevant features. The GFRM module utilizes graphs to refine features within individual modalities, while the CFLM focuses on learning text and image-specific features such as toxicity features and caption features. Additionally, we curate a set of misogynous lexicons to compute the misogyny-specific lexicon score from the text. We apply test-time augmentation in feature space to better generalize the predictions on diverse inputs. The performance of the proposed approach has been evaluated on two multimodal datasets, MAMI, and MMHS150K, with 11,000 and 13,494 samples, respectively. The proposed method demonstrates an average improvement of 11.87% and 10.82% in macro-F1 over existing multimodal methods on the MAMI and MMHS150K datasets, respectively.
社交媒体上的攻击性内容有很大一部分是针对女性的。由于一般的攻击性内容检测方法在检测厌女症内容方面面临挑战,因此需要专门针对针对女性的攻击性内容的解决方案。为此,我们提出了一个新颖的多模态框架,用于检测厌女症和性别歧视内容。该框架由三个模块组成:多模态注意模块(MANM)、基于图形的特征重构模块(GFRM)和特定内容特征学习模块(CFLM)。MANM 采用基于自适应门控的多模态上下文感知注意力,使模型能够关注相关的视觉和文本信息,并生成与上下文相关的特征。GFRM 模块利用图形来完善单个模态中的特征,而 CFLM 则侧重于学习文本和图像的特定特征,如毒性特征和标题特征。此外,我们还策划了一组厌女词库,以计算文本中的厌女词库得分。我们在特征空间中应用了测试时间增强技术,以更好地泛化对不同输入的预测。我们在两个多模态数据集 MAMI 和 MMHS150K(分别包含 11,000 和 13,494 个样本)上对所提出方法的性能进行了评估。在 MAMI 和 MMHS150K 数据集上,与现有的多模态方法相比,所提出的方法在 macro-F1 方面分别平均提高了 11.87% 和 10.82%。
{"title":"A context-aware attention and graph neural network-based multimodal framework for misogyny detection","authors":"","doi":"10.1016/j.ipm.2024.103895","DOIUrl":"10.1016/j.ipm.2024.103895","url":null,"abstract":"<div><div>A substantial portion of offensive content on social media is directed towards women. Since the approaches for general offensive content detection face a challenge in detecting misogynistic content, it requires solutions tailored to address offensive content against women. To this end, we propose a novel multimodal framework for the detection of misogynistic and sexist content. The framework comprises three modules: the Multimodal Attention module (MANM), the Graph-based Feature Reconstruction Module (GFRM), and the Content-specific Features Learning Module (CFLM). The MANM employs adaptive gating-based multimodal context-aware attention, enabling the model to focus on relevant visual and textual information and generating contextually relevant features. The GFRM module utilizes graphs to refine features within individual modalities, while the CFLM focuses on learning text and image-specific features such as toxicity features and caption features. Additionally, we curate a set of misogynous lexicons to compute the misogyny-specific lexicon score from the text. We apply test-time augmentation in feature space to better generalize the predictions on diverse inputs. The performance of the proposed approach has been evaluated on two multimodal datasets, MAMI, and MMHS150K, with 11,000 and 13,494 samples, respectively. The proposed method demonstrates an average improvement of 11.87% and 10.82% in macro-F1 over existing multimodal methods on the MAMI and MMHS150K datasets, respectively.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002541/pdfft?md5=d17cb5e20a69f9c766570983bc722abc&pid=1-s2.0-S0306457324002541-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142314954","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
Multi-granularity contrastive zero-shot learning model based on attribute decomposition 基于属性分解的多粒度对比零镜头学习模型
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-21 DOI: 10.1016/j.ipm.2024.103898

Zero-shot learning (ZSL) aims to identify new classes by transferring semantic knowledge from seen classes to unseen classes. However, existing models lack a differentiated understanding of different attributes and ignore the impact of global context information. Therefore, we propose a multi-granularity contrastive zero-shot learning model based on attribute decomposition. Specifically, as attributes are the carriers of semantic knowledge, we first classify attributes into key attributes and common attributes, i.e., attribute decomposition, and the importance of common attributes is increased by key attribute mask prediction. Then, inspired by Navon’s global–local paradigm, we work out the multi-granularity contrastive learning model, which is composed of the global learning module and the local one, to further enhance the interaction between the global and local information. Finally, zero-shot image classification is achieved by training a multi-granularity contrastive learning model. The method is experimented on three public ZSL benchmark datasets (i.e., AWA2, CUB, and SUN). Compared with the existing model, this model improves the accuracy by 2.2%/5.4% (AWA2/SUN) on conventional ZSL, 2.5%/1.6%/6.3% (AWA2/CUB/SUN) on generalized ZSL, further verifying the effectiveness of this model.

零点学习(Zero-shot learning,ZSL)旨在通过将语义知识从可见类别转移到未知类别来识别新类别。然而,现有模型缺乏对不同属性的区分理解,忽略了全局上下文信息的影响。因此,我们提出了一种基于属性分解的多粒度对比零点学习模型。具体来说,由于属性是语义知识的载体,我们首先将属性分为关键属性和普通属性,即属性分解,并通过关键属性掩码预测提高普通属性的重要性。然后,受 Navon 全局-局部范式的启发,我们建立了由全局学习模块和局部学习模块组成的多粒度对比学习模型,以进一步增强全局信息和局部信息之间的互动。最后,通过训练多粒度对比学习模型实现了零镜头图像分类。该方法在三个公开的 ZSL 基准数据集(即 AWA2、CUB 和 SUN)上进行了实验。与现有模型相比,该模型在传统 ZSL 上的准确率提高了 2.2%/5.4%(AWA2/SUN),在广义 ZSL 上的准确率提高了 2.5%/1.6%/6.3%(AWA2/CUB/SUN),进一步验证了该模型的有效性。
{"title":"Multi-granularity contrastive zero-shot learning model based on attribute decomposition","authors":"","doi":"10.1016/j.ipm.2024.103898","DOIUrl":"10.1016/j.ipm.2024.103898","url":null,"abstract":"<div><p>Zero-shot learning (ZSL) aims to identify new classes by transferring semantic knowledge from seen classes to unseen classes. However, existing models lack a differentiated understanding of different attributes and ignore the impact of global context information. Therefore, we propose a multi-granularity contrastive zero-shot learning model based on attribute decomposition. Specifically, as attributes are the carriers of semantic knowledge, we first classify attributes into key attributes and common attributes, i.e., attribute decomposition, and the importance of common attributes is increased by key attribute mask prediction. Then, inspired by Navon’s global–local paradigm, we work out the multi-granularity contrastive learning model, which is composed of the global learning module and the local one, to further enhance the interaction between the global and local information. Finally, zero-shot image classification is achieved by training a multi-granularity contrastive learning model. The method is experimented on three public ZSL benchmark datasets (i.e., AWA2, CUB, and SUN). Compared with the existing model, this model improves the accuracy by 2.2%/5.4% (AWA2/SUN) on conventional ZSL, 2.5%/1.6%/6.3% (AWA2/CUB/SUN) on generalized ZSL, further verifying the effectiveness of this model.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002577/pdfft?md5=c22471566c970cb53ade37147177d34d&pid=1-s2.0-S0306457324002577-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142272048","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
Asymmetric augmented paradigm-based graph neural architecture search 基于非对称增强范式的图神经架构搜索
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-20 DOI: 10.1016/j.ipm.2024.103897

In most scenarios of graph-based tasks, graph neural networks (GNNs) are trained end-to-end with labeled samples. Labeling graph samples, a time-consuming and expert-dependent process, leads to huge costs. Graph data augmentations can provide a promising method to expand labeled samples cheaply. However, graph data augmentations will damage the capacity of GNNs to distinguish non-isomorphic graphs during the supervised graph representation learning process. How to utilize graph data augmentations to expand labeled samples while preserving the capacity of GNNs to distinguish non-isomorphic graphs is a challenging research problem. To address the above problem, we abstract a novel asymmetric augmented paradigm in this paper and theoretically prove that it offers a principled approach. The asymmetric augmented paradigm can preserve the capacity of GNNs to distinguish non-isomorphic graphs while utilizing augmented labeled samples to improve the generalization capacity of GNNs. To be specific, the asymmetric augmented paradigm will utilize similar yet distinct asymmetric weights to classify the real sample and augmented sample, respectively. To systemically explore the benefits of asymmetric augmented paradigm under different GNN architectures, rather than studying individual asymmetric augmented GNN (A2GNN) instance, we then develop an auto-search engine called Asymmetric Augmented Graph Neural Architecture Search (A2GNAS) to save human efforts. We empirically validate our asymmetric augmented paradigm on multiple graph classification benchmarks, and demonstrate that representative A2GNN instances automatically discovered by our A2GNAS method achieve state-of-the-art performance compared with competitive baselines. Our codes are available at: https://github.com/csubigdata-Organization/A2GNAS.

在大多数基于图的任务场景中,图神经网络(GNN)都是通过标注样本进行端到端训练的。标记图样本是一个耗时且依赖专家的过程,会导致巨大的成本。图数据增强可以为廉价扩展标记样本提供一种有前途的方法。然而,在监督图表示学习过程中,图数据增强会损害 GNN 区分非同构图的能力。如何在保持 GNN 区分非同构图的能力的同时,利用图数据增强来扩展标记样本,是一个具有挑战性的研究课题。为了解决上述问题,我们在本文中抽象出了一种新颖的非对称增强范式,并从理论上证明它提供了一种原则性的方法。非对称增强范式既能保持 GNN 区分非同构图形的能力,又能利用增强标记样本提高 GNN 的泛化能力。具体来说,非对称增强范式将利用相似但不同的非对称权重分别对真实样本和增强样本进行分类。为了系统地探索非对称增强范式在不同 GNN 架构下的优势,我们没有研究单个非对称增强 GNN(A2GNN)实例,而是开发了一个名为 "非对称增强图神经架构搜索(A2GNAS)"的自动搜索引擎,以节省人力。我们在多个图分类基准上对非对称增强范例进行了实证验证,并证明由我们的 A2GNAS 方法自动发现的具有代表性的 A2GNN 实例与竞争基准相比达到了最先进的性能。我们的代码可在以下网址获取:https://github.com/csubigdata-Organization/A2GNAS。
{"title":"Asymmetric augmented paradigm-based graph neural architecture search","authors":"","doi":"10.1016/j.ipm.2024.103897","DOIUrl":"10.1016/j.ipm.2024.103897","url":null,"abstract":"<div><p>In most scenarios of graph-based tasks, graph neural networks (GNNs) are trained end-to-end with labeled samples. Labeling graph samples, a time-consuming and expert-dependent process, leads to huge costs. Graph data augmentations can provide a promising method to expand labeled samples cheaply. However, graph data augmentations will damage the capacity of GNNs to distinguish non-isomorphic graphs during the supervised graph representation learning process. How to utilize graph data augmentations to expand labeled samples while preserving the capacity of GNNs to distinguish non-isomorphic graphs is a challenging research problem. To address the above problem, we abstract a novel asymmetric augmented paradigm in this paper and theoretically prove that it offers a principled approach. The asymmetric augmented paradigm can preserve the capacity of GNNs to distinguish non-isomorphic graphs while utilizing augmented labeled samples to improve the generalization capacity of GNNs. To be specific, the asymmetric augmented paradigm will utilize similar yet distinct asymmetric weights to classify the real sample and augmented sample, respectively. To systemically explore the benefits of asymmetric augmented paradigm under different GNN architectures, rather than studying individual asymmetric augmented GNN (A<sup>2</sup>GNN) instance, we then develop an auto-search engine called <strong>A</strong>symmetric <strong>A</strong>ugmented <strong>G</strong>raph <strong>N</strong>eural <strong>A</strong>rchitecture <strong>S</strong>earch (A<sup>2</sup>GNAS) to save human efforts. We empirically validate our asymmetric augmented paradigm on multiple graph classification benchmarks, and demonstrate that representative A<sup>2</sup>GNN instances automatically discovered by our A<sup>2</sup>GNAS method achieve state-of-the-art performance compared with competitive baselines. Our codes are available at: <span><span>https://github.com/csubigdata-Organization/A2GNAS</span><svg><path></path></svg></span>.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002565/pdfft?md5=9b952876a2a78b6f526e18f25fd5b60e&pid=1-s2.0-S0306457324002565-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142271946","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
Are Multiple information sources better? The effect of multiple physicians in online medical teams on patient satisfaction 多种信息来源是否更好?在线医疗团队中多名医生对患者满意度的影响
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-18 DOI: 10.1016/j.ipm.2024.103889

An emerging service model in online health communities (OHCs) is that of medical teams comprising multiple physicians who collaborate to offer diagnoses and recommendations to patients. Given its multiple information sources, this model has the potential to deliver high-quality services and enhance patient satisfaction. However, the effect of a wider range of information on patient satisfaction has yet to be empirically examined. Therefore, the current research aims to examine the effect of multiple sources of health-related information on the satisfaction of patients in OHCs. We construct a sample model and empirically test it using a dataset comprising 115,367 consultation records sourced from WeDoctor. The results show that responses from multiple physicians in OHC medical teams increase patient satisfaction. In addition, we explore the moderating effects of team composition and team replies. The results show that physicians with higher titles and affiliations with the same department and the same question's replies from multiple physicians all play a positive moderating role, while reply time plays a negative moderating role. This research enriches the existing literature by focusing on patient satisfaction in the context of OHCs and offers recommendations for research and practice.

在线健康社区(OHC)中的一种新兴服务模式是由多名医生组成的医疗团队,他们合作为患者提供诊断和建议。鉴于其多种信息来源,这种模式具有提供高质量服务和提高患者满意度的潜力。然而,更广泛的信息对患者满意度的影响还有待实证研究。因此,本研究旨在探讨多种来源的健康相关信息对老年健康中心患者满意度的影响。我们构建了一个样本模型,并使用来自 WeDoctor 的 115,367 条咨询记录数据集对其进行了实证检验。结果表明,OHC 医疗团队中多名医生的回复会提高患者的满意度。此外,我们还探讨了团队组成和团队回复的调节作用。结果显示,职称越高、隶属于同一科室的医生以及同一问题的多位医生回复都起到了积极的调节作用,而回复时间则起到了消极的调节作用。这项研究通过关注开放式健康中心背景下的患者满意度,丰富了现有文献,并为研究和实践提供了建议。
{"title":"Are Multiple information sources better? The effect of multiple physicians in online medical teams on patient satisfaction","authors":"","doi":"10.1016/j.ipm.2024.103889","DOIUrl":"10.1016/j.ipm.2024.103889","url":null,"abstract":"<div><p>An emerging service model in online health communities (OHCs) is that of medical teams comprising multiple physicians who collaborate to offer diagnoses and recommendations to patients. Given its multiple information sources, this model has the potential to deliver high-quality services and enhance patient satisfaction. However, the effect of a wider range of information on patient satisfaction has yet to be empirically examined. Therefore, the current research aims to examine the effect of multiple sources of health-related information on the satisfaction of patients in OHCs. We construct a sample model and empirically test it using a dataset comprising 115,367 consultation records sourced from WeDoctor. The results show that responses from multiple physicians in OHC medical teams increase patient satisfaction. In addition, we explore the moderating effects of team composition and team replies. The results show that physicians with higher titles and affiliations with the same department and the same question's replies from multiple physicians all play a positive moderating role, while reply time plays a negative moderating role. This research enriches the existing literature by focusing on patient satisfaction in the context of OHCs and offers recommendations for research and practice.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002486/pdfft?md5=ada04d837fdffa5a217927ee41d3b329&pid=1-s2.0-S0306457324002486-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142243076","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
Feature enhancement based on hierarchical reconstruction framework for inductive prediction on sparse graphs 基于分层重构框架的特征增强,用于稀疏图上的归纳预测
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-18 DOI: 10.1016/j.ipm.2024.103894

Knowledge graph completion aims to infer the missing links of new elements, however, the missing links often lie in sparse regions of the graph. Primary subgraph-based methods rely heavily on structural information, which makes it difficult for them to play an essential role in sparse graph completion. To address this challenge, we propose a learning framework for feature-enhanced hierarchical reconstruction (FEHR). The proposed FEHR explores relational semantics at the global and local levels, minimizing the limitations of sparse structures. First, entity graphs are converted into relation graphs, and overreliance on the entity structure is reduced by obtaining prior knowledge on similar global graphs. Second, the relational features are further refined at the local level. Finally, an improved performer model expresses the degree of preference between the predicted behaviors and relations. Extensive inductive experiments showed that FEHR performs better than state-of-the-art baselines, achieving improvements in area under the prediction–recall curve (AUC-PR) and Hits@n metrics, ranging from 0.32% to 11.73%.

知识图谱补全旨在推断新元素的缺失链接,然而,缺失链接往往位于图谱的稀疏区域。基于子图的主要方法严重依赖结构信息,因此很难在稀疏图补全中发挥重要作用。为了应对这一挑战,我们提出了一种特征增强分层重建(FEHR)的学习框架。所提出的 FEHR 在全局和局部层面探索关系语义,最大限度地减少了稀疏结构的局限性。首先,实体图被转换成关系图,并通过获取类似全局图的先验知识来减少对实体结构的过度依赖。其次,在局部层面进一步完善关系特征。最后,改进的执行者模型表示了预测行为和关系之间的偏好程度。广泛的归纳实验表明,FEHR 的性能优于最先进的基线,在预测-召回曲线下面积(AUC-PR)和 Hits@n 指标方面取得了 0.32% 到 11.73% 的改进。
{"title":"Feature enhancement based on hierarchical reconstruction framework for inductive prediction on sparse graphs","authors":"","doi":"10.1016/j.ipm.2024.103894","DOIUrl":"10.1016/j.ipm.2024.103894","url":null,"abstract":"<div><p>Knowledge graph completion aims to infer the missing links of new elements, however, the missing links often lie in sparse regions of the graph. Primary subgraph-based methods rely heavily on structural information, which makes it difficult for them to play an essential role in sparse graph completion. To address this challenge, we propose a learning framework for feature-enhanced hierarchical reconstruction (FEHR). The proposed FEHR explores relational semantics at the global and local levels, minimizing the limitations of sparse structures. First, entity graphs are converted into relation graphs, and overreliance on the entity structure is reduced by obtaining prior knowledge on similar global graphs. Second, the relational features are further refined at the local level. Finally, an improved performer model expresses the degree of preference between the predicted behaviors and relations. Extensive inductive experiments showed that FEHR performs better than state-of-the-art baselines, achieving improvements in area under the prediction–recall curve (AUC-PR) and Hits@n metrics, ranging from 0.32% to 11.73%.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S030645732400253X/pdfft?md5=fab4be9f1bbace870e6db64d841a97c9&pid=1-s2.0-S030645732400253X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142243075","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
The use of convolutional neural networks for abnormal behavior recognition in crowd scenes 利用卷积神经网络识别人群场景中的异常行为
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-10 DOI: 10.1016/j.ipm.2024.103880

This study introduces the Abnormality Converging Scene Analysis Method (ACSAM) to detect abnormal group behavior using monitored videos or CCTV images in crowded scenarios. Abnormal behavior recognition involves classifying activities and gestures in continuous scenes, which traditionally presents significant computational challenges, particularly in complex crowd scenes, leading to reduced recognition accuracy. To address these issues, ACSAM employs a convolutional neural network (CNN) enhanced with Abnormality and Crowd Behavior Training layers to accurately detect and classify abnormal activities, regardless of crowd density. The method involves extracting frames from the input scene and using CNN to perform conditional validation of abnormality factors, comparing current values with previous high values to maximize detection accuracy. As the abnormality factor increases, the identification rate improves with higher training iterations. The system was tested on 26 video samples and trained on 34 samples, demonstrating superior performance to other approaches like DeepROD, MSI-CNN, and PT-2DCNN. Specifically, ACSAM achieved a 12.55% improvement in accuracy, a 12.97% increase in recall, and a 10.23% enhancement in convergence rate. These results suggest that ACSAM effectively overcomes the computational challenges inherent in crowd scene detection, offering a robust solution for real-time abnormal behavior recognition in crowded environments.

本研究介绍了异常聚合场景分析方法(ACSAM),利用监控视频或闭路电视图像检测拥挤场景中的异常群体行为。异常行为识别涉及对连续场景中的活动和手势进行分类,这在传统上给计算带来了巨大挑战,尤其是在复杂的人群场景中,导致识别准确率降低。为了解决这些问题,ACSAM 采用了一个卷积神经网络 (CNN),增强了异常和人群行为训练层,无论人群密度如何,都能准确检测异常活动并对其进行分类。该方法包括从输入场景中提取帧,并使用 CNN 对异常因子进行条件验证,将当前值与之前的高值进行比较,以最大限度地提高检测精度。随着异常因子的增加,识别率也会随着训练迭代次数的增加而提高。该系统在 26 个视频样本上进行了测试,并在 34 个样本上进行了训练,结果表明其性能优于 DeepROD、MSI-CNN 和 PT-2DCNN 等其他方法。具体来说,ACSAM 的准确率提高了 12.55%,召回率提高了 12.97%,收敛率提高了 10.23%。这些结果表明,ACSAM 有效地克服了人群场景检测中固有的计算挑战,为拥挤环境中的实时异常行为识别提供了一种稳健的解决方案。
{"title":"The use of convolutional neural networks for abnormal behavior recognition in crowd scenes","authors":"","doi":"10.1016/j.ipm.2024.103880","DOIUrl":"10.1016/j.ipm.2024.103880","url":null,"abstract":"<div><p>This study introduces the Abnormality Converging Scene Analysis Method (ACSAM) to detect abnormal group behavior using monitored videos or CCTV images in crowded scenarios. Abnormal behavior recognition involves classifying activities and gestures in continuous scenes, which traditionally presents significant computational challenges, particularly in complex crowd scenes, leading to reduced recognition accuracy. To address these issues, ACSAM employs a convolutional neural network (CNN) enhanced with Abnormality and Crowd Behavior Training layers to accurately detect and classify abnormal activities, regardless of crowd density. The method involves extracting frames from the input scene and using CNN to perform conditional validation of abnormality factors, comparing current values with previous high values to maximize detection accuracy. As the abnormality factor increases, the identification rate improves with higher training iterations. The system was tested on 26 video samples and trained on 34 samples, demonstrating superior performance to other approaches like DeepROD, MSI-CNN, and PT-2DCNN. Specifically, ACSAM achieved a 12.55% improvement in accuracy, a 12.97% increase in recall, and a 10.23% enhancement in convergence rate. These results suggest that ACSAM effectively overcomes the computational challenges inherent in crowd scene detection, offering a robust solution for real-time abnormal behavior recognition in crowded environments.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002395/pdfft?md5=1db6d11ff866a167a1abef7ca8f5215c&pid=1-s2.0-S0306457324002395-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142162322","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
Forecasting time to risk based on multi-party data: An explainable privacy-preserving decentralized survival analysis method 基于多方数据的风险时间预测:一种可解释的保护隐私的分散式生存分析方法
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-09 DOI: 10.1016/j.ipm.2024.103881

Forecasting time-to-risk poses a challenge in the information processing and risk management within financial markets. While previous studies have focused on centralized survival analysis, how to forecast the time to risk using multi-party data in a decentralized and privacy-preserving setting with the requirements of explainability and mitigating information redundancy is still challenging. To this end, we propose an explainable, privacy-preserving, decentralized survival analysis method. Specifically, we transform time-to-risk forecasting into a multi-label learning problem by independently modeling for multiple time horizons. For each forecasting time horizon, we use Taylor expansion and homomorphic encryption to securely build a decentralized logistic regression model. Considering the information redundancy among multiple parties, we design and add decentralized regularizations to each model. We also propose a decentralized proximal gradient descent method to estimate the decentralized coefficients. Empirical evaluation shows that the proposed method yields competitive forecasting performance and explainable results as compared to benchmarked methods.

预测风险时间是金融市场信息处理和风险管理中的一项挑战。以往的研究主要集中在集中式生存分析上,而如何在分散和保护隐私的环境下,利用多方数据预测风险时间,同时满足可解释性和减少信息冗余的要求,仍然具有挑战性。为此,我们提出了一种可解释、保护隐私的分散式生存分析方法。具体来说,我们通过对多个时间跨度进行独立建模,将时间风险预测转化为多标签学习问题。对于每个预测时间跨度,我们使用泰勒扩展和同态加密来安全地建立分散式逻辑回归模型。考虑到多方之间的信息冗余,我们为每个模型设计并添加了分散正则化。我们还提出了一种分散的近似梯度下降方法来估计分散系数。经验评估表明,与基准方法相比,所提出的方法能产生有竞争力的预测性能和可解释的结果。
{"title":"Forecasting time to risk based on multi-party data: An explainable privacy-preserving decentralized survival analysis method","authors":"","doi":"10.1016/j.ipm.2024.103881","DOIUrl":"10.1016/j.ipm.2024.103881","url":null,"abstract":"<div><p>Forecasting time-to-risk poses a challenge in the information processing and risk management within financial markets. While previous studies have focused on centralized survival analysis, how to forecast the time to risk using multi-party data in a decentralized and privacy-preserving setting with the requirements of explainability and mitigating information redundancy is still challenging. To this end, we propose an explainable, privacy-preserving, decentralized survival analysis method. Specifically, we transform time-to-risk forecasting into a multi-label learning problem by independently modeling for multiple time horizons. For each forecasting time horizon, we use Taylor expansion and homomorphic encryption to securely build a decentralized logistic regression model. Considering the information redundancy among multiple parties, we design and add decentralized regularizations to each model. We also propose a decentralized proximal gradient descent method to estimate the decentralized coefficients. Empirical evaluation shows that the proposed method yields competitive forecasting performance and explainable results as compared to benchmarked methods.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002401/pdfft?md5=17e60030bf2b1bfc21c31cf4d9f359d8&pid=1-s2.0-S0306457324002401-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142162321","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
EvolveDetector: Towards an evolving fake news detector for emerging events with continual knowledge accumulation and transfer EvolveDetector:不断积累和转移知识,为新兴事件开发不断发展的假新闻检测器
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-07 DOI: 10.1016/j.ipm.2024.103878

The prevalence of fake news on social media poses devastating and wide-ranging threats to political beliefs, economic activities, and public health. Due to the continuous emergence of news events on social media, the corresponding data distribution keeps changing, which places high demands on the generalizabilities of automatic detection methods. Current cross-event fake news detection methods often enhance generalization by training models on a broad range of events. However, they require storing historical training data and retraining the model from scratch when new events occur, resulting in substantial storage and computational costs. This limitation makes it challenging to meet the requirements of continual fake news detection on social media. Inspired by human abilities to consolidate learning from earlier tasks and transfer knowledge to new tasks, in this paper, we propose a fake news detection method based on parameter-level historical event knowledge transfer, namely EvolveDetector, which does not require storing historical event data to retrain the model from scratch. Specifically, we design the hard attention-based knowledge storing mechanism to efficiently store the knowledge of learned events, which mainly consists of a knowledge memory and corresponding event masks. Whenever a new event needs to be detected for fake news, EvolveDetector retrieves the neuron parameters of all similar historical events from the knowledge memory to guide the learning in the new event. Afterward, the multi-head self-attention is used to integrate the feature outputs corresponding to these similar events to train a classifier for the new event. Experiments on public datasets collected from Twitter and Sina Weibo demonstrate that our EvolveDetector outperforms state-of-the-art baselines, which can be utilized for cross-event fake news detection.

社交媒体上假新闻的盛行对政治信仰、经济活动和公众健康造成了破坏性的广泛威胁。由于社交媒体上新闻事件不断涌现,相应的数据分布也不断变化,这对自动检测方法的泛化能力提出了很高的要求。目前的跨事件假新闻检测方法通常通过在广泛的事件中训练模型来增强泛化能力。然而,这些方法需要存储历史训练数据,并在新事件发生时从头开始重新训练模型,从而导致大量的存储和计算成本。这种局限性使其难以满足在社交媒体上持续检测假新闻的要求。受人类从早期任务中巩固学习并将知识迁移到新任务的能力的启发,我们在本文中提出了一种基于参数级历史事件知识迁移的假新闻检测方法,即 EvolveDetector,它不需要存储历史事件数据来从头开始重新训练模型。具体来说,我们设计了基于硬注意力的知识存储机制来有效存储已学事件知识,该机制主要由知识存储器和相应的事件掩码组成。每当需要对新事件进行假新闻检测时,EvolveDetector 就会从知识存储器中检索所有类似历史事件的神经元参数,以指导新事件的学习。然后,利用多头自注意力整合这些类似事件对应的特征输出,为新事件训练分类器。在从 Twitter 和新浪微博收集的公共数据集上进行的实验表明,我们的 EvolveDetector 优于最先进的基线,可用于跨事件假新闻检测。
{"title":"EvolveDetector: Towards an evolving fake news detector for emerging events with continual knowledge accumulation and transfer","authors":"","doi":"10.1016/j.ipm.2024.103878","DOIUrl":"10.1016/j.ipm.2024.103878","url":null,"abstract":"<div><p>The prevalence of fake news on social media poses devastating and wide-ranging threats to political beliefs, economic activities, and public health. Due to the continuous emergence of news events on social media, the corresponding data distribution keeps changing, which places high demands on the generalizabilities of automatic detection methods. Current cross-event fake news detection methods often enhance generalization by training models on a broad range of events. However, they require storing historical training data and retraining the model from scratch when new events occur, resulting in substantial storage and computational costs. This limitation makes it challenging to meet the requirements of continual fake news detection on social media. Inspired by human abilities to consolidate learning from earlier tasks and transfer knowledge to new tasks, in this paper, we propose a fake news detection method based on parameter-level historical event knowledge transfer, namely EvolveDetector, which does not require storing historical event data to retrain the model from scratch. Specifically, we design the hard attention-based knowledge storing mechanism to efficiently store the knowledge of learned events, which mainly consists of a knowledge memory and corresponding event masks. Whenever a new event needs to be detected for fake news, EvolveDetector retrieves the neuron parameters of all similar historical events from the knowledge memory to guide the learning in the new event. Afterward, the multi-head self-attention is used to integrate the feature outputs corresponding to these similar events to train a classifier for the new event. Experiments on public datasets collected from Twitter and Sina Weibo demonstrate that our EvolveDetector outperforms state-of-the-art baselines, which can be utilized for cross-event fake news detection.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002371/pdfft?md5=a533d4b21ca6d972ae0c325e125eecb0&pid=1-s2.0-S0306457324002371-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142150504","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
期刊
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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1