Efficiently Transfer User Profile Across Networks

IF 7.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Mengting Diao;Zhongbao Zhang;Sen Su;Shuai Gao;Huafeng Cao;Junda Ye
{"title":"Efficiently Transfer User Profile Across Networks","authors":"Mengting Diao;Zhongbao Zhang;Sen Su;Shuai Gao;Huafeng Cao;Junda Ye","doi":"10.1109/TBDATA.2024.3414321","DOIUrl":null,"url":null,"abstract":"User profiling has very important applications for many downstream tasks. Most existing methods only focus on modeling user profiles of one social network with plenty of data. However, user profiles are difficult to acquire, especially when the data is scarce. Fortunately, we observed that similar users have similar behavior patterns in different social networks. Motivated by such observations, in this paper, we for the first time propose to study the user profiling problem from the transfer learning perspective. We design two efficient frameworks for User Profile transferring acrOss Networks, i.e., UPON and E-UPON. In UPON, we first design a novel graph convolutional networks based characteristic-aware domain attention model to find user dependencies within and between domains (i.e., social networks). We then design a dual-domain weighted adversarial learning method to address the domain shift problem existing in the transferring procedure. In E-UPON, we optimize UPON in terms of computational complexity and memory. Specifically, we design a mini-cluster gradient descent based graph representation algorithm to shrink the searching space and ensure parallel computation. Then we use an adaptive cluster matching method to adjust the clusters of users. Experimental results on Twitter-Foursquare dataset demonstrate that UPON and E-UPON outperform the state-of-the-art models.","PeriodicalId":13106,"journal":{"name":"IEEE Transactions on Big Data","volume":"11 1","pages":"271-285"},"PeriodicalIF":7.5000,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Big Data","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10557152/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

User profiling has very important applications for many downstream tasks. Most existing methods only focus on modeling user profiles of one social network with plenty of data. However, user profiles are difficult to acquire, especially when the data is scarce. Fortunately, we observed that similar users have similar behavior patterns in different social networks. Motivated by such observations, in this paper, we for the first time propose to study the user profiling problem from the transfer learning perspective. We design two efficient frameworks for User Profile transferring acrOss Networks, i.e., UPON and E-UPON. In UPON, we first design a novel graph convolutional networks based characteristic-aware domain attention model to find user dependencies within and between domains (i.e., social networks). We then design a dual-domain weighted adversarial learning method to address the domain shift problem existing in the transferring procedure. In E-UPON, we optimize UPON in terms of computational complexity and memory. Specifically, we design a mini-cluster gradient descent based graph representation algorithm to shrink the searching space and ensure parallel computation. Then we use an adaptive cluster matching method to adjust the clusters of users. Experimental results on Twitter-Foursquare dataset demonstrate that UPON and E-UPON outperform the state-of-the-art models.
有效地跨网络传输用户配置文件
用户分析对于许多下游任务具有非常重要的应用。现有的方法大多只关注一个社交网络的大量数据的用户画像建模。然而,用户档案很难获得,特别是在数据稀缺的情况下。幸运的是,我们发现相似的用户在不同的社交网络中有着相似的行为模式。基于这些观察结果,本文首次提出从迁移学习的角度研究用户分析问题。我们设计了两种高效的跨网络用户配置文件传输框架,即UPON和E-UPON。在UPON中,我们首先设计了一种基于特征感知域注意力模型的新颖的图卷积网络,以发现域内和域之间的用户依赖关系(即社交网络)。然后设计了一种双域加权对抗学习方法来解决迁移过程中存在的域漂移问题。在E-UPON中,我们在计算复杂度和内存方面对UPON进行了优化。具体来说,我们设计了一种基于小聚类梯度下降的图表示算法,以缩小搜索空间并保证并行计算。然后采用自适应聚类匹配方法对用户聚类进行调整。在Twitter-Foursquare数据集上的实验结果表明,UPON和E-UPON优于最先进的模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
11.80
自引率
2.80%
发文量
114
期刊介绍: The IEEE Transactions on Big Data publishes peer-reviewed articles focusing on big data. These articles present innovative research ideas and application results across disciplines, including novel theories, algorithms, and applications. Research areas cover a wide range, such as big data analytics, visualization, curation, management, semantics, infrastructure, standards, performance analysis, intelligence extraction, scientific discovery, security, privacy, and legal issues specific to big data. The journal also prioritizes applications of big data in fields generating massive datasets.
×
引用
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学术官方微信