首页 > 最新文献

Information Processing & Management最新文献

英文 中文
Retrieve–Revise–Refine: A novel framework for retrieval of concise entailing legal article set 检索-修订-再完善:检索简明内涵法律文章集的新框架
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-07 DOI: 10.1016/j.ipm.2024.103949
Chau Nguyen, Phuong Nguyen, Le-Minh Nguyen
The retrieval of entailing legal article sets aims to identify a concise set of legal articles that holds an entailment relationship with a legal query or its negation. Unlike traditional information retrieval that focuses on relevance ranking, this task demands conciseness. However, prior research has inadequately addressed this need by employing traditional methods. To bridge this gap, we propose a three-stage Retrieve–Revise–Refine framework which explicitly addresses the need for conciseness by utilizing both small and large language models (LMs) in distinct yet complementary roles. Empirical evaluations on the COLIEE 2022 and 2023 datasets demonstrate that our framework significantly enhances performance, achieving absolute increases in the macro F2 score by 3.17% and 4.24% over previous state-of-the-art methods, respectively. Specifically, our Retrieve stage, employing various tailored fine-tuning strategies for small LMs, achieved a recall rate exceeding 0.90 in the top-5 results alone—ensuring comprehensive coverage of entailing articles. In the subsequent Revise stage, large LMs narrow this set, improving precision while sacrificing minimal coverage. The Refine stage further enhances precision by leveraging specialized insights from small LMs, resulting in a relative improvement of up to 19.15% in the number of concise article sets retrieved compared to previous methods. Our framework offers a promising direction for further research on specialized methods for retrieving concise sets of entailing legal articles, thereby more effectively meeting the task’s demands.
蕴涵法律条文集检索的目的是找出与法律查询或其否定具有蕴涵关系的简明法律条文集。与注重相关性排序的传统信息检索不同,这项任务要求信息简洁。然而,之前的研究采用传统方法未能充分满足这一需求。为了弥补这一不足,我们提出了一个 "检索-修订-再完善 "的三阶段框架,该框架通过利用小型和大型语言模型(LMs)发挥不同但互补的作用,明确地满足了对简洁性的需求。在 COLIEE 2022 和 2023 数据集上进行的实证评估表明,我们的框架显著提高了性能,宏 F2 分数的绝对值比以前的先进方法分别提高了 3.17% 和 4.24%。具体来说,我们的 "检索"(Retrieve)阶段针对小型 LM 采用了各种量身定制的微调策略,仅在前五名结果中的召回率就超过了 0.90,确保了对相关文章的全面覆盖。在随后的 "修订 "阶段,大型 LMs 缩小了这一范围,在提高精确度的同时牺牲了最小的覆盖范围。精炼阶段利用小型 LM 的专业见解进一步提高了精确度,与以前的方法相比,检索到的简明文章集数量相对提高了 19.15%。我们的框架为进一步研究检索包含法律条文的简明文章集的专门方法提供了一个很有前景的方向,从而更有效地满足任务的需求。
{"title":"Retrieve–Revise–Refine: A novel framework for retrieval of concise entailing legal article set","authors":"Chau Nguyen,&nbsp;Phuong Nguyen,&nbsp;Le-Minh Nguyen","doi":"10.1016/j.ipm.2024.103949","DOIUrl":"10.1016/j.ipm.2024.103949","url":null,"abstract":"<div><div>The retrieval of entailing legal article sets aims to identify a concise set of legal articles that holds an entailment relationship with a legal query or its negation. Unlike traditional information retrieval that focuses on relevance ranking, this task demands conciseness. However, prior research has inadequately addressed this need by employing traditional methods. To bridge this gap, we propose a three-stage Retrieve–Revise–Refine framework which explicitly addresses the need for conciseness by utilizing both small and large language models (LMs) in distinct yet complementary roles. Empirical evaluations on the COLIEE 2022 and 2023 datasets demonstrate that our framework significantly enhances performance, achieving absolute increases in the macro F2 score by 3.17% and 4.24% over previous state-of-the-art methods, respectively. Specifically, our Retrieve stage, employing various tailored fine-tuning strategies for small LMs, achieved a recall rate exceeding 0.90 in the top-5 results alone—ensuring comprehensive coverage of entailing articles. In the subsequent Revise stage, large LMs narrow this set, improving precision while sacrificing minimal coverage. The Refine stage further enhances precision by leveraging specialized insights from small LMs, resulting in a relative improvement of up to 19.15% in the number of concise article sets retrieved compared to previous methods. Our framework offers a promising direction for further research on specialized methods for retrieving concise sets of entailing legal articles, thereby more effectively meeting the task’s demands.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103949"},"PeriodicalIF":7.4,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142657715","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
Upper bound on the predictability of rating prediction in recommender systems 推荐系统中评级预测可预测性的上限
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-07 DOI: 10.1016/j.ipm.2024.103950
En Xu , Kai Zhao , Zhiwen Yu , Hui Wang , Siyuan Ren , Helei Cui , Yunji Liang , Bin Guo
The task of rating prediction has undergone extensive scrutiny, employing diverse modeling approaches to enhance accuracy. However, it remains uncertain whether a maximum accuracy, synonymous with predictability, exists for a given dataset, guiding the quest for optimal algorithms. While existing theories quantify predictability in one-dimensional symbol sequences, extending this to multidimensional and heterogeneous data poses challenges, rendering it unsuitable for rating prediction tasks. Our approach initially employs conditional entropy to quantify rating entropy, overcoming its inherent complexity by transforming it into two easily calculable entropies. Unlike conventional entropy measures, we utilize sample entropy to account for the numerical impact of rating sequences. Furthermore, novel metrics for quantifying entropy in numerical sequences are integrated to enhance predictability scaling. Demonstrating the effectiveness of our method across datasets of varying sizes and domains, current leading rating prediction algorithms achieve approximately 80% predictability.
评级预测工作经过了广泛的研究,采用了多种建模方法来提高准确性。然而,对于一个给定的数据集,是否存在与可预测性同义的最高准确率,这一点仍不确定,这也是寻求最佳算法的方向。虽然现有理论量化了一维符号序列的可预测性,但将其扩展到多维和异构数据却带来了挑战,使其不适合评级预测任务。我们的方法最初采用条件熵来量化评级熵,通过将其转化为两个易于计算的熵来克服其固有的复杂性。与传统的熵测量方法不同,我们利用样本熵来考虑评级序列的数值影响。此外,我们还整合了量化数字序列熵的新指标,以增强可预测性比例。我们的方法在不同规模和领域的数据集上都非常有效,目前领先的评分预测算法可预测率约为 80%。
{"title":"Upper bound on the predictability of rating prediction in recommender systems","authors":"En Xu ,&nbsp;Kai Zhao ,&nbsp;Zhiwen Yu ,&nbsp;Hui Wang ,&nbsp;Siyuan Ren ,&nbsp;Helei Cui ,&nbsp;Yunji Liang ,&nbsp;Bin Guo","doi":"10.1016/j.ipm.2024.103950","DOIUrl":"10.1016/j.ipm.2024.103950","url":null,"abstract":"<div><div>The task of rating prediction has undergone extensive scrutiny, employing diverse modeling approaches to enhance accuracy. However, it remains uncertain whether a maximum accuracy, synonymous with predictability, exists for a given dataset, guiding the quest for optimal algorithms. While existing theories quantify predictability in one-dimensional symbol sequences, extending this to multidimensional and heterogeneous data poses challenges, rendering it unsuitable for rating prediction tasks. Our approach initially employs conditional entropy to quantify rating entropy, overcoming its inherent complexity by transforming it into two easily calculable entropies. Unlike conventional entropy measures, we utilize sample entropy to account for the numerical impact of rating sequences. Furthermore, novel metrics for quantifying entropy in numerical sequences are integrated to enhance predictability scaling. Demonstrating the effectiveness of our method across datasets of varying sizes and domains, current leading rating prediction algorithms achieve approximately 80% predictability.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103950"},"PeriodicalIF":7.4,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142657597","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
Enhancing pre-trained language models with Chinese character morphological knowledge 利用汉字形态知识增强预训练语言模型
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-06 DOI: 10.1016/j.ipm.2024.103945
Zhenzhong Zheng , Xiaoming Wu , Xiangzhi Liu
Pre-trained language models (PLMs) have demonstrated success in Chinese natural language processing (NLP) tasks by acquiring high-quality representations through contextual learning. However, these models tend to neglect the glyph features of Chinese characters, which contain valuable semantic knowledge. To address this issue, this paper introduces a self-supervised learning strategy, named SGBERT, aiming to learn high-quality semantic knowledge from Chinese Character morphology to enhance PLMs’ understanding of natural language. Specifically, the learning process of SGBERT can be divided into two stages. In the first stage, we preheat the glyph encoder by constructing contrastive learning between glyphs, enabling it to obtain preliminary glyph coding capabilities. In the second stage, we transform the glyph features captured by the glyph encoder into context-sensitive representations through a glyph-aware window. These representations are then contrasted with the character representations generated by the PLMs, leveraging the powerful representation capabilities of the PLMs to guide glyph learning. Finally, the glyph knowledge is fused with the pre-trained model representations to obtain semantically richer representations. We conduct experiments on ten datasets covering six Chinese NLP tasks, and the results demonstrate that SGBERT significantly enhances commonly used Chinese PLMs. On average, the introduction of SGBERT resulted in a performance improvement of 1.36% for BERT and 1.09% for RoBERTa.
预训练语言模型(PLM)通过上下文学习获得高质量的表征,在中文自然语言处理(NLP)任务中取得了成功。然而,这些模型往往忽略了汉字的字形特征,而这些特征包含了宝贵的语义知识。为解决这一问题,本文介绍了一种自监督学习策略(SGBERT),旨在从汉字字形中学习高质量的语义知识,以增强 PLM 对自然语言的理解。具体来说,SGBERT 的学习过程可分为两个阶段。在第一阶段,我们通过构建字形之间的对比学习来预热字形编码器,使其获得初步的字形编码能力。在第二阶段,我们通过字形感知窗口将字形编码器捕捉到的字形特征转换为上下文敏感表征。然后将这些表征与 PLM 生成的字符表征进行对比,利用 PLM 强大的表征能力来指导字形学习。最后,将字形知识与预先训练的模型表征融合,从而获得语义更丰富的表征。我们在涵盖六个中文 NLP 任务的十个数据集上进行了实验,结果表明 SGBERT 显著增强了常用的中文 PLM。平均而言,引入 SGBERT 后,BERT 和 RoBERTa 的性能分别提高了 1.36% 和 1.09%。
{"title":"Enhancing pre-trained language models with Chinese character morphological knowledge","authors":"Zhenzhong Zheng ,&nbsp;Xiaoming Wu ,&nbsp;Xiangzhi Liu","doi":"10.1016/j.ipm.2024.103945","DOIUrl":"10.1016/j.ipm.2024.103945","url":null,"abstract":"<div><div>Pre-trained language models (PLMs) have demonstrated success in Chinese natural language processing (NLP) tasks by acquiring high-quality representations through contextual learning. However, these models tend to neglect the glyph features of Chinese characters, which contain valuable semantic knowledge. To address this issue, this paper introduces a self-supervised learning strategy, named SGBERT, aiming to learn high-quality semantic knowledge from Chinese Character morphology to enhance PLMs’ understanding of natural language. Specifically, the learning process of SGBERT can be divided into two stages. In the first stage, we preheat the glyph encoder by constructing contrastive learning between glyphs, enabling it to obtain preliminary glyph coding capabilities. In the second stage, we transform the glyph features captured by the glyph encoder into context-sensitive representations through a glyph-aware window. These representations are then contrasted with the character representations generated by the PLMs, leveraging the powerful representation capabilities of the PLMs to guide glyph learning. Finally, the glyph knowledge is fused with the pre-trained model representations to obtain semantically richer representations. We conduct experiments on ten datasets covering six Chinese NLP tasks, and the results demonstrate that SGBERT significantly enhances commonly used Chinese PLMs. On average, the introduction of SGBERT resulted in a performance improvement of 1.36% for BERT and 1.09% for RoBERTa.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103945"},"PeriodicalIF":7.4,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142657543","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
Hierarchical multi-label text classification of tourism resources using a label-aware dual graph attention network 使用标签感知双图注意力网络对旅游资源进行分层多标签文本分类
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-05 DOI: 10.1016/j.ipm.2024.103952
Quan Cheng, Wenwan Shi
In the era of big data, classifying online tourism resource information can facilitate the matching of user needs with tourism resources and enhance the efficiency of tourism resource integration. However, most research in this field has concentrated on a simple classification problem with a single level of single labelling. In this paper, a Hierarchical Label-Aware Tourism-Informed Dual Graph Attention Network (HLT-DGAT) is proposed for the complex multi-level and multi-label classification presented by online textual information about Chinese tourism resources. This model integrates domain knowledge into a pre-trained language model and employs attention mechanisms to transform the text representation into the label-based representation. Subsequently, the model utilizes dual Graph Attention Network (GAT), with one component capturing vertical information and the other capturing horizontal information within the label hierarchy. The model's performance is validated on two commonly used public datasets as well as on a manually curated Chinese tourism resource dataset, which consists of online textual overviews of Chinese tourism resources above 3A level. Experimental results indicate that HLT-DGAT demonstrates superiority in threshold-based and area-under-curve evaluation metrics. Specifically, the AU(PRC) reaches 64.5 % on the Chinese tourism resource dataset with enforced leaf nodes, which is 3 % higher than the optimal corresponding metric of the baseline model. Furthermore, ablation studies show that (1) integrating domain knowledge, (2) combining local information, (3) considering label dependencies within the same level of label hierarchy, and (4) merging dynamic reconstruction can enhance overall model performance.
在大数据时代,对在线旅游资源信息进行分类可以促进用户需求与旅游资源的匹配,提高旅游资源整合的效率。然而,该领域的大多数研究都集中在单层单标签的简单分类问题上。本文针对中国旅游资源在线文本信息所呈现的多层次、多标签的复杂分类问题,提出了分层标签感知旅游信息双图注意网络(HLT-DGAT)。该模型将领域知识整合到预先训练好的语言模型中,并利用注意力机制将文本表示转换为基于标签的表示。随后,该模型利用双图注意网络(GAT),其中一个组件捕捉标签层次结构中的纵向信息,另一个组件捕捉横向信息。该模型的性能在两个常用的公共数据集和一个人工编辑的中国旅游资源数据集上得到了验证,该数据集由中国 3A 级以上旅游资源的在线文本概述组成。实验结果表明,HLT-DGAT 在基于阈值和曲线下面积的评价指标上表现出了优势。具体而言,在具有强制叶节点的中国旅游资源数据集上,AU(PRC‾)达到了64.5%,比基线模型的最优相应指标高出3%。此外,消融研究表明:(1)整合领域知识;(2)结合本地信息;(3)考虑同级标签层次中的标签依赖关系;(4)合并动态重构可以提高模型的整体性能。
{"title":"Hierarchical multi-label text classification of tourism resources using a label-aware dual graph attention network","authors":"Quan Cheng,&nbsp;Wenwan Shi","doi":"10.1016/j.ipm.2024.103952","DOIUrl":"10.1016/j.ipm.2024.103952","url":null,"abstract":"<div><div>In the era of big data, classifying online tourism resource information can facilitate the matching of user needs with tourism resources and enhance the efficiency of tourism resource integration. However, most research in this field has concentrated on a simple classification problem with a single level of single labelling. In this paper, a Hierarchical Label-Aware Tourism-Informed Dual Graph Attention Network (HLT-DGAT) is proposed for the complex multi-level and multi-label classification presented by online textual information about Chinese tourism resources. This model integrates domain knowledge into a pre-trained language model and employs attention mechanisms to transform the text representation into the label-based representation. Subsequently, the model utilizes dual Graph Attention Network (GAT), with one component capturing vertical information and the other capturing horizontal information within the label hierarchy. The model's performance is validated on two commonly used public datasets as well as on a manually curated Chinese tourism resource dataset, which consists of online textual overviews of Chinese tourism resources above 3A level. Experimental results indicate that HLT-DGAT demonstrates superiority in threshold-based and area-under-curve evaluation metrics. Specifically, the <span><math><mrow><mrow><mtext>AU</mtext><mo>(</mo></mrow><mover><mrow><mtext>PRC</mtext></mrow><mo>‾</mo></mover><mrow><mo>)</mo></mrow></mrow></math></span> reaches 64.5 % on the Chinese tourism resource dataset with enforced leaf nodes, which is 3 % higher than the optimal corresponding metric of the baseline model. Furthermore, ablation studies show that (1) integrating domain knowledge, (2) combining local information, (3) considering label dependencies within the same level of label hierarchy, and (4) merging dynamic reconstruction can enhance overall model performance.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103952"},"PeriodicalIF":7.4,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142587301","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
ME3A: A Multimodal Entity Entailment framework for multimodal Entity Alignment ME3A:用于多模态实体对齐的多模态实体关联框架
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-05 DOI: 10.1016/j.ipm.2024.103951
Yu Zhao, Ying Zhang, Xuhui Sui, Xiangrui Cai
Current methods for multimodal entity alignment (MEA) primarily rely on entity representation learning, which undermines entity alignment performance because of cross-KG interaction deficiency and multimodal heterogeneity. In this paper, we propose a Multimodal Entity Entailment framework of multimodal Entity Alignment task, ME3A, and recast the MEA task as an entailment problem about entities in the two KGs. This way, the cross-KG modality information directly interacts with each other in the unified textual space. Specifically, we construct the multimodal information in the unified textual space as textual sequences: for relational and attribute modalities, we combine the neighbors and attribute values of entities as sentences; for visual modality, we map the entity image as trainable prefixes and insert them into sequences. Then, we input the concatenated sequences of two entities into the pre-trained language model (PLM) as an entailment reasoner to capture the unified fine-grained correlation pattern of the multimodal tokens between entities. Two types of entity aligners are proposed to model the bi-directional entailment probability as the entity similarity. Extensive experiments conducted on nine MEA datasets with various modality combination settings demonstrate that our ME3A effectively incorporates multimodal information and surpasses the performance of the state-of-the-art MEA methods by 16.5% at most.
目前的多模态实体配准(MEA)方法主要依赖于实体表征学习,但由于跨 KG 交互缺陷和多模态异质性,实体配准性能受到影响。本文提出了多模态实体对齐任务 ME3A 的多模态实体枚举框架,并将多模态实体对齐任务重塑为两个 KG 中实体的枚举问题。这样,跨 KG 的模态信息就可以在统一的文本空间中直接交互。具体来说,我们将统一文本空间中的多模态信息构建为文本序列:对于关系模态和属性模态,我们将实体的相邻关系和属性值组合为句子;对于视觉模态,我们将实体图像映射为可训练的前缀,并将其插入序列中。然后,我们将两个实体的串联序列输入预先训练好的语言模型(PLM)作为蕴涵推理器,以捕捉实体间多模态标记的统一细粒度关联模式。我们提出了两类实体对齐器,将双向 "entailment probability "建模为实体相似性。在九个具有不同模态组合设置的 MEA 数据集上进行的广泛实验表明,我们的 ME3A 有效地整合了多模态信息,其性能最多比最先进的 MEA 方法高出 16.5%。
{"title":"ME3A: A Multimodal Entity Entailment framework for multimodal Entity Alignment","authors":"Yu Zhao,&nbsp;Ying Zhang,&nbsp;Xuhui Sui,&nbsp;Xiangrui Cai","doi":"10.1016/j.ipm.2024.103951","DOIUrl":"10.1016/j.ipm.2024.103951","url":null,"abstract":"<div><div>Current methods for multimodal entity alignment (MEA) primarily rely on entity representation learning, which undermines entity alignment performance because of cross-KG interaction deficiency and multimodal heterogeneity. In this paper, we propose a <strong>M</strong>ultimodal <strong>E</strong>ntity <strong>E</strong>ntailment framework of multimodal <strong>E</strong>ntity <strong>A</strong>lignment task, <strong>ME<sup>3</sup>A</strong>, and recast the MEA task as an entailment problem about entities in the two KGs. This way, the cross-KG modality information directly interacts with each other in the unified textual space. Specifically, we construct the multimodal information in the unified textual space as textual sequences: for relational and attribute modalities, we combine the neighbors and attribute values of entities as sentences; for visual modality, we map the entity image as trainable prefixes and insert them into sequences. Then, we input the concatenated sequences of two entities into the pre-trained language model (PLM) as an entailment reasoner to capture the unified fine-grained correlation pattern of the multimodal tokens between entities. Two types of entity aligners are proposed to model the bi-directional entailment probability as the entity similarity. Extensive experiments conducted on nine MEA datasets with various modality combination settings demonstrate that our ME<span><math><msup><mrow></mrow><mrow><mn>3</mn></mrow></msup></math></span>A effectively incorporates multimodal information and surpasses the performance of the state-of-the-art MEA methods by 16.5% at most.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103951"},"PeriodicalIF":7.4,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142587300","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
Impact of economic and socio-political risk factors on sovereign credit ratings 经济和社会政治风险因素对主权信用评级的影响
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-05 DOI: 10.1016/j.ipm.2024.103943
Abhinav Goel, Archana Singh
Sovereign Credit Ratings (SCRs) help international investors price the risk of lending to sovereigns or entities domiciled within that sovereign, thereby impacting cost and availability of capital flows into an economy. The international credit rating agencies (CRAs - Moody's, S&P and Fitch) consider both quantitative (economic) and qualitative (socio-political) factors while determining the SCR of a country. However, research in the field of SCR has focussed largely on quantitative factors giving lesser importance to qualitative factors. The present work analyses the linkage of banking sector risks and SCR, the bias in rating process towards high-income nations, and the impact of both quantitative and qualitative factors to provide a more holistic picture of the determinants of SCR.
To attain these objectives, the present work develops two datasets covering 55 countries and compiles the data for 10 years (2011–2020) in terms of SCR obtained from Moody's and Fitch, and the values for various quantitative and qualitative factors. The dataset comprises of 18,700 data points obtained from 32 independent variables; 17 are quantitative and 15 qualitative. Some qualitative factors are also introduced which were not used earlier in SCR literature The data has been collated from World Bank, International Monetary Fund, United Nations etc. Correlation analysis has been performed on these two datasets followed by the application of Extra Tree Classifier for predicting SCR. Thorough result analysis indicates that qualitative factors, individually and as a group, are more important in determining SCR than quantitative factors. The results also indicate the presence of bias towards high-income nations and moderate importance of banking parameters in determination of SCR. Further, the use of Extra Tree Classifier gives a prediction accuracy of 97 % - 98 % for dataset 1 and dataset 2, respectively. Comparative analysis with existing work proves the efficacy of the present work.
主权信用评级(SCR)有助于国际投资者对主权国家或主权国家内实体的贷款风险进行定价,从而影响资本流入一个经济体的成本和可用性。国际信用评级机构(CRAs - 穆迪、S&P 和惠誉)在确定一个国家的 SCR 时,会同时考虑定量(经济)和定性(社会政治)因素。然而,SCR 领域的研究主要集中在定量因素上,对定性因素的重视程度较低。为了实现这些目标,本研究开发了两个数据集,涵盖 55 个国家,并汇编了穆迪和惠誉提供的 10 年(2011-2020 年)SCR 数据以及各种定量和定性因素的值。数据集包括从 32 个自变量中获得的 18,700 个数据点;其中 17 个为定量变量,15 个为定性变量。数据来自世界银行、国际货币基金组织、联合国等机构。对这两个数据集进行了相关性分析,然后应用 Extra Tree 分类器预测 SCR。全面的结果分析表明,在决定 SCR 时,定性因素(单独或作为一个群体)比定量因素更重要。结果还表明,在确定 SCR 时,存在对高收入国家的偏见,银行参数的重要性适中。此外,使用 Extra Tree 分类器对数据集 1 和数据集 2 的预测准确率分别为 97% - 98%。与现有工作的比较分析证明了本工作的有效性。
{"title":"Impact of economic and socio-political risk factors on sovereign credit ratings","authors":"Abhinav Goel,&nbsp;Archana Singh","doi":"10.1016/j.ipm.2024.103943","DOIUrl":"10.1016/j.ipm.2024.103943","url":null,"abstract":"<div><div>Sovereign Credit Ratings (SCRs) help international investors price the risk of lending to sovereigns or entities domiciled within that sovereign, thereby impacting cost and availability of capital flows into an economy. The international credit rating agencies (CRAs - Moody's, S&amp;P and Fitch) consider both quantitative (economic) and qualitative (socio-political) factors while determining the SCR of a country. However, research in the field of SCR has focussed largely on quantitative factors giving lesser importance to qualitative factors. The present work analyses the linkage of banking sector risks and SCR, the bias in rating process towards high-income nations, and the impact of both quantitative and qualitative factors to provide a more holistic picture of the determinants of SCR.</div><div>To attain these objectives, the present work develops two datasets covering 55 countries and compiles the data for 10 years (2011–2020) in terms of SCR obtained from Moody's and Fitch, and the values for various quantitative and qualitative factors. The dataset comprises of 18,700 data points obtained from 32 independent variables; 17 are quantitative and 15 qualitative. Some qualitative factors are also introduced which were not used earlier in SCR literature The data has been collated from World Bank, International Monetary Fund, United Nations etc. Correlation analysis has been performed on these two datasets followed by the application of Extra Tree Classifier for predicting SCR. Thorough result analysis indicates that qualitative factors, individually and as a group, are more important in determining SCR than quantitative factors. The results also indicate the presence of bias towards high-income nations and moderate importance of banking parameters in determination of SCR. Further, the use of Extra Tree Classifier gives a prediction accuracy of 97 % - 98 % for dataset 1 and dataset 2, respectively. Comparative analysis with existing work proves the efficacy of the present work.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103943"},"PeriodicalIF":7.4,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142587302","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
CKEMI: Concept knowledge enhanced metaphor identification framework CKEMI:概念知识增强隐喻识别框架
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-04 DOI: 10.1016/j.ipm.2024.103946
Dian Wang , Yang Li , Suge Wang , Xin Chen , Jian Liao , Deyu Li , Xiaoli Li
Metaphor is pervasive in our life, there is roughly one metaphor every three sentences on average in our daily conversations. Previous metaphor identification researches in NLP have rarely focused on similarity between concepts from different domains. In this paper, we propose a Concept Knowledge Enhanced Metaphor Identification Framework (CKEMI) to model similarity between concepts from different domains. First, we construct the descriptive concept word set and the inter-word relation concept word set by selecting knowledge from the ConceptNet knowledge base. Then, we devise two hierarchical relation concept graph networks to refine inter-word relation concept knowledge. Next, we design the concept consistency mapping function to constrain the representation of inter-word relation concept and learn similarity information between concepts. Finally, we construct the target domain semantic scene by integrating the representation of inter-word relation concept knowledge for metaphor identification. Specifically, the F1 score of CKEMI is superior to the state-of-the-art (SOTA) methods, achieving improvements of over 0.5%, 1.0%, and 1.2% on the VUA-18(10k), VUA-20(16k), and MOH-X(0.6k) datasets, respectively.
隐喻在我们的生活中无处不在,在我们的日常对话中,平均每三句话就有一个隐喻。以往的 NLP 隐喻识别研究很少关注不同领域概念之间的相似性。在本文中,我们提出了一个概念知识增强隐喻识别框架(CKEMI)来模拟不同领域概念之间的相似性。首先,我们从 ConceptNet 知识库中选取知识,构建描述性概念词集和词间关系概念词集。然后,我们设计了两个分层关系概念图网络来提炼词间关系概念知识。接着,我们设计了概念一致性映射函数来约束词间关系概念的表示,并学习概念间的相似性信息。最后,我们通过整合词间关系概念知识表征来构建目标域语义场景,从而实现隐喻识别。具体来说,CKEMI的F1得分优于最先进的(SOTA)方法,在VUA-18(10k)、VUA-20(16k)和MOH-X(0.6k)数据集上分别提高了0.5%、1.0%和1.2%以上。
{"title":"CKEMI: Concept knowledge enhanced metaphor identification framework","authors":"Dian Wang ,&nbsp;Yang Li ,&nbsp;Suge Wang ,&nbsp;Xin Chen ,&nbsp;Jian Liao ,&nbsp;Deyu Li ,&nbsp;Xiaoli Li","doi":"10.1016/j.ipm.2024.103946","DOIUrl":"10.1016/j.ipm.2024.103946","url":null,"abstract":"<div><div>Metaphor is pervasive in our life, there is roughly one metaphor every three sentences on average in our daily conversations. Previous metaphor identification researches in NLP have rarely focused on similarity between concepts from different domains. In this paper, we propose a Concept Knowledge Enhanced Metaphor Identification Framework (CKEMI) to model similarity between concepts from different domains. First, we construct the descriptive concept word set and the inter-word relation concept word set by selecting knowledge from the ConceptNet knowledge base. Then, we devise two hierarchical relation concept graph networks to refine inter-word relation concept knowledge. Next, we design the concept consistency mapping function to constrain the representation of inter-word relation concept and learn similarity information between concepts. Finally, we construct the target domain semantic scene by integrating the representation of inter-word relation concept knowledge for metaphor identification. Specifically, the F1 score of CKEMI is superior to the state-of-the-art (SOTA) methods, achieving improvements of over 0.5%, 1.0%, and 1.2% on the VUA-18(10k), VUA-20(16k), and MOH-X(0.6k) datasets, respectively.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103946"},"PeriodicalIF":7.4,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142577976","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
Membership inference attacks via spatial projection-based relative information loss in MLaaS 通过 MLaaS 中基于空间投影的相对信息损失进行成员推理攻击
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-04 DOI: 10.1016/j.ipm.2024.103947
Zehua Ding , Youliang Tian , Guorong Wang , Jinbo Xiong , Jinchuan Tang , Jianfeng Ma
Machine Learning as a Service (MLaaS) has significantly advanced data-driven decision-making and the development of intelligent applications. However, the privacy risks posed by membership inference attacks (MIAs) remain a critical concern. MIAs are primarily classified into score-based and perturbation-based attacks. The former relies on shadow data and models, which are difficult to obtain in practical applications, while the latter depends solely on perturbation distance, resulting in insufficient identification performance. To this end, we propose a Spatial Projection-based Relative Information Loss (SPRIL) MIA to ascertain the sample membership by flexibly controlling the size of perturbations in the noise space and integrating relative information loss. Firstly, we analyze the alterations in predicted probability distributions induced by adversarial perturbations and leverage these changes as pivotal features for membership identification. Secondly, we introduce a spatial projection technique that flexibly modulates the perturbation amplitude to accentuate the difference in probability distributions between member and non-member data. Thirdly, this quantifies the distribution difference by calculating relative information loss based on KL divergence to identify membership. SPRIL provides a solid method to assess the potential risks of DNN models in MLaaS and demonstrates its efficacy and precision in black-box and white-box settings. Finally, experimental results demonstrate the effectiveness of SPRIL across various datasets and model architectures. Notably, on the CIFAR-100 dataset, SPRIL achieves the highest attack accuracy and AUC, reaching 99.27% and 99.73%, respectively.
机器学习即服务(MLaaS)极大地推动了数据驱动决策和智能应用的开发。然而,成员推理攻击(MIAs)带来的隐私风险仍是一个重要问题。成员推理攻击主要分为基于分数的攻击和基于扰动的攻击。前者依赖于影子数据和模型,在实际应用中很难获得;后者则完全依赖于扰动距离,导致识别性能不足。为此,我们提出了一种基于空间投影的相对信息损失(SPRIL)MIA,通过灵活控制噪声空间中扰动的大小和整合相对信息损失来确定样本的成员资格。首先,我们分析了对抗性扰动引起的预测概率分布的变化,并利用这些变化作为成员身份识别的关键特征。其次,我们引入了一种空间投影技术,可灵活调节扰动幅度,以突出成员数据和非成员数据之间概率分布的差异。第三,通过计算基于 KL 发散的相对信息损失来量化分布差异,从而识别成员身份。SPRIL 提供了一种可靠的方法来评估 DNN 模型在 MLaaS 中的潜在风险,并证明了其在黑盒和白盒设置中的有效性和精确性。最后,实验结果证明了 SPRIL 在各种数据集和模型架构中的有效性。值得注意的是,在 CIFAR-100 数据集上,SPRIL 实现了最高的攻击准确率和 AUC,分别达到 99.27% 和 99.73%。
{"title":"Membership inference attacks via spatial projection-based relative information loss in MLaaS","authors":"Zehua Ding ,&nbsp;Youliang Tian ,&nbsp;Guorong Wang ,&nbsp;Jinbo Xiong ,&nbsp;Jinchuan Tang ,&nbsp;Jianfeng Ma","doi":"10.1016/j.ipm.2024.103947","DOIUrl":"10.1016/j.ipm.2024.103947","url":null,"abstract":"<div><div>Machine Learning as a Service (MLaaS) has significantly advanced data-driven decision-making and the development of intelligent applications. However, the privacy risks posed by membership inference attacks (MIAs) remain a critical concern. MIAs are primarily classified into score-based and perturbation-based attacks. The former relies on shadow data and models, which are difficult to obtain in practical applications, while the latter depends solely on perturbation distance, resulting in insufficient identification performance. To this end, we propose a Spatial Projection-based Relative Information Loss (SPRIL) MIA to ascertain the sample membership by flexibly controlling the size of perturbations in the noise space and integrating relative information loss. Firstly, we analyze the alterations in predicted probability distributions induced by adversarial perturbations and leverage these changes as pivotal features for membership identification. Secondly, we introduce a spatial projection technique that flexibly modulates the perturbation amplitude to accentuate the difference in probability distributions between member and non-member data. Thirdly, this quantifies the distribution difference by calculating relative information loss based on KL divergence to identify membership. SPRIL provides a solid method to assess the potential risks of DNN models in MLaaS and demonstrates its efficacy and precision in black-box and white-box settings. Finally, experimental results demonstrate the effectiveness of SPRIL across various datasets and model architectures. Notably, on the CIFAR-100 dataset, SPRIL achieves the highest attack accuracy and AUC, reaching 99.27% and 99.73%, respectively.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103947"},"PeriodicalIF":7.4,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142577975","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
Higher-order structure based node importance evaluation in directed networks 基于高阶结构的有向网络节点重要性评估
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-04 DOI: 10.1016/j.ipm.2024.103948
Meng Li , Zhigang Wang , An Zeng , Zengru Di
Evaluating the significance of objects with possible relevant information is a crucial topic in information science. Due to the fact that objects related to each other can often be described using complex networks, this topic also forms a fundamental theme in network science. Most traditional methods for characterizing the importance of nodes in complex networks only utilize the binary relationships between node pairs, neglecting the influence brought by higher-order structures. Considering the specific interaction modes between local nodes in the network, this paper associates the higher-order structural characteristics of the network with the importance of the nodes. It constructs an evaluation framework for the importance of nodes in directed networks based on higher-order structures. Experimental analysis on both artificial data and scientific citation data from the APS dataset has validated the effectiveness of the proposed algorithms. Compared with PageRank and eigenvector centrality, the proposed algorithms demonstrated higher accuracy, revealing the role of higher-order structures in node importance evaluation. Finally, a robustness analysis of several algorithms indicated that the proposed algorithms exhibited good robustness.
评估具有可能相关信息的对象的重要性是信息科学的一个重要课题。由于相互关联的对象通常可以用复杂网络来描述,因此这一课题也构成了网络科学的一个基本主题。表征复杂网络中节点重要性的传统方法大多只利用节点对之间的二元关系,忽略了高阶结构带来的影响。考虑到网络中局部节点之间的特定交互模式,本文将网络的高阶结构特征与节点的重要性联系起来。本文构建了一个基于高阶结构的有向网络节点重要性评估框架。对人工数据和来自 APS 数据集的科学引文数据的实验分析验证了所提算法的有效性。与 PageRank 和特征向量中心性相比,所提出的算法具有更高的准确性,揭示了高阶结构在节点重要性评价中的作用。最后,对几种算法的鲁棒性分析表明,所提出的算法具有良好的鲁棒性。
{"title":"Higher-order structure based node importance evaluation in directed networks","authors":"Meng Li ,&nbsp;Zhigang Wang ,&nbsp;An Zeng ,&nbsp;Zengru Di","doi":"10.1016/j.ipm.2024.103948","DOIUrl":"10.1016/j.ipm.2024.103948","url":null,"abstract":"<div><div>Evaluating the significance of objects with possible relevant information is a crucial topic in information science. Due to the fact that objects related to each other can often be described using complex networks, this topic also forms a fundamental theme in network science. Most traditional methods for characterizing the importance of nodes in complex networks only utilize the binary relationships between node pairs, neglecting the influence brought by higher-order structures. Considering the specific interaction modes between local nodes in the network, this paper associates the higher-order structural characteristics of the network with the importance of the nodes. It constructs an evaluation framework for the importance of nodes in directed networks based on higher-order structures. Experimental analysis on both artificial data and scientific citation data from the APS dataset has validated the effectiveness of the proposed algorithms. Compared with PageRank and eigenvector centrality, the proposed algorithms demonstrated higher accuracy, revealing the role of higher-order structures in node importance evaluation. Finally, a robustness analysis of several algorithms indicated that the proposed algorithms exhibited good robustness.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103948"},"PeriodicalIF":7.4,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142577974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-view graph contrastive representation learning for bundle recommendation 用于捆绑推荐的多视图对比表示学习
IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-03 DOI: 10.1016/j.ipm.2024.103956
Peng Zhang , Zhendong Niu , Ru Ma , Fuzhi Zhang
Bundle recommendation can recommend a collection of associated items that can be consumed together to a user rather than recommending these items separately, making it extremely suitable for some scenarios such as product bundle recommendation and game bundle recommendation. Recent bundle recommendation approaches consider auxiliary data to mitigate sparse user-bundle interactions. However, these approaches obtain the node embeddings directly from the established user-bundle graph and do not explicitly exploit the relationships between users (bundles) when constructing recommendation models. Moreover, bundle recommendation approaches based on graph contrastive learning usually construct contrastive views by randomly discarding nodes (edges) in the graph, while discarding some essential nodes or edges will destroy the structure of the original graph, thereby deteriorating the quality of the learned node embeddings. Aiming at these limitations, we propose a bundle recommendation approach based on multi-view graph contrastive representation learning. First, we present a multi-view modeling method to model the relations between entities as several views from different perspectives. These views serve as inputs of graph neural networks for graph representation learning and provide contrastive views for the contrastive learning tasks. Second, we propose a novel framework for bundle recommendation. This framework obtains the user (bundle) embeddings from different views by performing multi-view graph representation learning and enhances the learned user and bundle embeddings through a two-level contrastive learning strategy. On this basis, the enhanced user (bundle) embeddings are fused for prediction. Finally, we design a joint optimization objective to optimize the model parameters, combining the prediction loss that supports multiple negative samples and the contrastive losses. Experiments on the Netease and Youshu datasets reveal that our approach outperforms the state-of-the-art (SOTA) baselines. Furthermore, the average improvements of Recall@K and NDCG@K of our approach over the SOTA baselines are approximately 3.38% and 2.80% on Netease and 3.94% and 4.84% on Youshu.
捆绑推荐可以向用户推荐一系列可以一起消费的关联项目,而不是单独推荐这些项目,因此非常适合一些场景,如产品捆绑推荐和游戏捆绑推荐。最近的捆绑推荐方法考虑了辅助数据,以减轻用户-捆绑交互的稀疏性。然而,这些方法直接从已建立的用户-捆绑图中获取节点嵌入,在构建推荐模型时没有明确利用用户(捆绑)之间的关系。此外,基于图对比学习的捆绑推荐方法通常通过随机丢弃图中的节点(边)来构建对比视图,而丢弃一些重要的节点或边会破坏原始图的结构,从而降低学习到的节点嵌入的质量。针对这些局限性,我们提出了一种基于多视图对比表示学习的捆绑推荐方法。首先,我们提出了一种多视图建模方法,将实体之间的关系建模为来自不同视角的多个视图。这些视图作为图神经网络的输入,用于图表示学习,并为对比学习任务提供对比视图。其次,我们提出了一种新颖的捆绑推荐框架。该框架通过执行多视角图表示学习从不同视角获取用户(捆绑)嵌入,并通过两级对比学习策略增强学习到的用户和捆绑嵌入。在此基础上,融合增强的用户(包)嵌入进行预测。最后,我们设计了一个联合优化目标,结合支持多个负样本的预测损失和对比损失来优化模型参数。在网易和优酷数据集上的实验表明,我们的方法优于最先进的(SOTA)基线。此外,与 SOTA 基线相比,我们的方法在网易数据集上的 Recall@K 和 NDCG@K 平均提高了约 3.38% 和 2.80%,在优树数据集上的 Recall@K 和 NDCG@K 平均提高了约 3.94% 和 4.84%。
{"title":"Multi-view graph contrastive representation learning for bundle recommendation","authors":"Peng Zhang ,&nbsp;Zhendong Niu ,&nbsp;Ru Ma ,&nbsp;Fuzhi Zhang","doi":"10.1016/j.ipm.2024.103956","DOIUrl":"10.1016/j.ipm.2024.103956","url":null,"abstract":"<div><div>Bundle recommendation can recommend a collection of associated items that can be consumed together to a user rather than recommending these items separately, making it extremely suitable for some scenarios such as product bundle recommendation and game bundle recommendation. Recent bundle recommendation approaches consider auxiliary data to mitigate sparse user-bundle interactions. However, these approaches obtain the node embeddings directly from the established user-bundle graph and do not explicitly exploit the relationships between users (bundles) when constructing recommendation models. Moreover, bundle recommendation approaches based on graph contrastive learning usually construct contrastive views by randomly discarding nodes (edges) in the graph, while discarding some essential nodes or edges will destroy the structure of the original graph, thereby deteriorating the quality of the learned node embeddings. Aiming at these limitations, we propose a bundle recommendation approach based on multi-view graph contrastive representation learning. First, we present a multi-view modeling method to model the relations between entities as several views from different perspectives. These views serve as inputs of graph neural networks for graph representation learning and provide contrastive views for the contrastive learning tasks. Second, we propose a novel framework for bundle recommendation. This framework obtains the user (bundle) embeddings from different views by performing multi-view graph representation learning and enhances the learned user and bundle embeddings through a two-level contrastive learning strategy. On this basis, the enhanced user (bundle) embeddings are fused for prediction. Finally, we design a joint optimization objective to optimize the model parameters, combining the prediction loss that supports multiple negative samples and the contrastive losses. Experiments on the Netease and Youshu datasets reveal that our approach outperforms the state-of-the-art (SOTA) baselines. Furthermore, the average improvements of Recall@K and NDCG@K of our approach over the SOTA baselines are approximately 3.38% and 2.80% on Netease and 3.94% and 4.84% on Youshu.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103956"},"PeriodicalIF":7.4,"publicationDate":"2024-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142573158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Information Processing & Management
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1