基于域不可知图嵌入的少镜头链接预测

Hao Zhu, Mahashweta Das, M. Bendre, Fei Wang, Hao Yang, S. Hassoun
{"title":"基于域不可知图嵌入的少镜头链接预测","authors":"Hao Zhu, Mahashweta Das, M. Bendre, Fei Wang, Hao Yang, S. Hassoun","doi":"10.1109/ICMLA55696.2022.00109","DOIUrl":null,"url":null,"abstract":"Real-world link prediction problems often deal with data from multiple domains, where data may be highly skewed and imbalanced. Computer vision research has studied similar issues under the Few-Shot Learning (FSL) umbrella. However, this problem has rarely been addressed and explored in the graph domain, specifically for link prediction. In this work, we propose an adversarial training-based framework that aims at improving link prediction for highly skewed and imbalanced graphs from different domains by generating domain agnostic embedding. We introduce a domain discriminator on pairs of graph-level embedding. We then use the discriminator to improve the model in an adversarial way, such that the graph embedding generated by the model are domain agnostic. We test our ideas on one large real-world user-business-review dataset and three benchmark datasets. Our results demonstrate that when domain differences exist, our method creates better graph embedding that are more evenly distributed across domains and generate better prediction outcomes. In the absence of domain differences, our method is on par with state-of-the-art.","PeriodicalId":128160,"journal":{"name":"2022 21st IEEE International Conference on Machine Learning and Applications (ICMLA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Few-Shot Link Prediction with Domain-Agnostic Graph Embedding\",\"authors\":\"Hao Zhu, Mahashweta Das, M. Bendre, Fei Wang, Hao Yang, S. Hassoun\",\"doi\":\"10.1109/ICMLA55696.2022.00109\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Real-world link prediction problems often deal with data from multiple domains, where data may be highly skewed and imbalanced. Computer vision research has studied similar issues under the Few-Shot Learning (FSL) umbrella. However, this problem has rarely been addressed and explored in the graph domain, specifically for link prediction. In this work, we propose an adversarial training-based framework that aims at improving link prediction for highly skewed and imbalanced graphs from different domains by generating domain agnostic embedding. We introduce a domain discriminator on pairs of graph-level embedding. We then use the discriminator to improve the model in an adversarial way, such that the graph embedding generated by the model are domain agnostic. We test our ideas on one large real-world user-business-review dataset and three benchmark datasets. Our results demonstrate that when domain differences exist, our method creates better graph embedding that are more evenly distributed across domains and generate better prediction outcomes. In the absence of domain differences, our method is on par with state-of-the-art.\",\"PeriodicalId\":128160,\"journal\":{\"name\":\"2022 21st IEEE International Conference on Machine Learning and Applications (ICMLA)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 21st IEEE International Conference on Machine Learning and Applications (ICMLA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMLA55696.2022.00109\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 21st IEEE International Conference on Machine Learning and Applications (ICMLA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLA55696.2022.00109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

现实世界的链接预测问题通常涉及来自多个领域的数据,这些领域的数据可能高度倾斜和不平衡。计算机视觉研究在Few-Shot Learning (FSL)的框架下研究了类似的问题。然而,这个问题很少在图域中被解决和探索,特别是在链接预测方面。在这项工作中,我们提出了一个基于对抗性训练的框架,旨在通过生成域不可知嵌入来改进来自不同域的高度倾斜和不平衡图的链接预测。引入了图级嵌入对的域鉴别器。然后,我们使用鉴别器以对抗的方式改进模型,使模型生成的图嵌入是领域不可知论的。我们在一个大型的真实用户-业务-评论数据集和三个基准数据集上测试了我们的想法。我们的结果表明,当存在域差异时,我们的方法创建了更好的图嵌入,这些图嵌入更均匀地分布在各个域上,并产生更好的预测结果。在没有领域差异的情况下,我们的方法与最先进的方法相当。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Few-Shot Link Prediction with Domain-Agnostic Graph Embedding
Real-world link prediction problems often deal with data from multiple domains, where data may be highly skewed and imbalanced. Computer vision research has studied similar issues under the Few-Shot Learning (FSL) umbrella. However, this problem has rarely been addressed and explored in the graph domain, specifically for link prediction. In this work, we propose an adversarial training-based framework that aims at improving link prediction for highly skewed and imbalanced graphs from different domains by generating domain agnostic embedding. We introduce a domain discriminator on pairs of graph-level embedding. We then use the discriminator to improve the model in an adversarial way, such that the graph embedding generated by the model are domain agnostic. We test our ideas on one large real-world user-business-review dataset and three benchmark datasets. Our results demonstrate that when domain differences exist, our method creates better graph embedding that are more evenly distributed across domains and generate better prediction outcomes. In the absence of domain differences, our method is on par with state-of-the-art.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信