• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

跨社交网络中基于稳定主题的多粒度对齐方法

Multi-grained alignment method based on stable topics in cross-social networks.

作者信息

Lu Jing, Gai Qikai

机构信息

School of Optical-Electrical and Computer Engineering, University of Shanghai for Science and Technology, Shanghai, China.

出版信息

PeerJ Comput Sci. 2024 Feb 28;10:e1892. doi: 10.7717/peerj-cs.1892. eCollection 2024.

DOI:10.7717/peerj-cs.1892
PMID:38435595
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC10909205/
Abstract

The user alignment of cross-social networks is divided into user and group alignments, respectively. Obtaining users' full features is difficult due to social network privacy protection policies in user alignment mode. In contrast, the alignment accuracy is low due to the large number of edge users in the group alignment mode. To resolve this issue, First, stable topics are obtained from user-generated content (UGC) based on embedded topic jitter time, and the weight of user edges is updated by using vector distances. An improved Louvain algorithm, called Stable Topic-Louvain (ST-L), is designed to accomplish multi-level community detection without predetermined tags. It aims to obtain fuzzy topic features of the community and finalize the community alignment across social networks. Furthermore, iterative alignment is executed from coarse-grained communities to fine-grained sub-communities until user-level alignment occurs. The process can be terminated at any layer to achieve multi-granularity alignment, which resolves the low accuracy issue of edge user alignment at a single granularity and improves the accuracy of user alignment. The effectiveness of the proposed method is shown by implementing real datasets.

摘要

跨社交网络的用户对齐分别分为用户对齐和群组对齐。在用户对齐模式下,由于社交网络隐私保护政策,获取用户的完整特征很困难。相比之下,在群组对齐模式下,由于边缘用户数量众多,对齐精度较低。为了解决这个问题,首先,基于嵌入式主题抖动时间从用户生成内容(UGC)中获取稳定主题,并使用向量距离更新用户边的权重。设计了一种改进的Louvain算法,称为稳定主题-Louvain(ST-L),用于在没有预定标签的情况下完成多层次社区检测。其目的是获取社区的模糊主题特征,并最终确定跨社交网络的社区对齐。此外,从粗粒度社区到细粒度子社区执行迭代对齐,直到发生用户级对齐。该过程可以在任何一层终止以实现多粒度对齐,这解决了单粒度边缘用户对齐精度低的问题,并提高了用户对齐的准确性。通过实现真实数据集展示了所提方法的有效性。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/da50f263d6b6/peerj-cs-10-1892-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/2a7397fbdc43/peerj-cs-10-1892-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/ba0001495303/peerj-cs-10-1892-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/3732c0b5757a/peerj-cs-10-1892-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/740016e0e3f8/peerj-cs-10-1892-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/134cd6b76cec/peerj-cs-10-1892-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/210dda189991/peerj-cs-10-1892-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/da50f263d6b6/peerj-cs-10-1892-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/2a7397fbdc43/peerj-cs-10-1892-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/ba0001495303/peerj-cs-10-1892-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/3732c0b5757a/peerj-cs-10-1892-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/740016e0e3f8/peerj-cs-10-1892-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/134cd6b76cec/peerj-cs-10-1892-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/210dda189991/peerj-cs-10-1892-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/53e8/10909205/da50f263d6b6/peerj-cs-10-1892-g007.jpg

相似文献

1
Multi-grained alignment method based on stable topics in cross-social networks.跨社交网络中基于稳定主题的多粒度对齐方法
PeerJ Comput Sci. 2024 Feb 28;10:e1892. doi: 10.7717/peerj-cs.1892. eCollection 2024.
2
A Semantic-Enhancement-Based Social Network User-Alignment Algorithm.一种基于语义增强的社交网络用户对齐算法。
Entropy (Basel). 2023 Jan 15;25(1):172. doi: 10.3390/e25010172.
3
Characterizing Twitter Discussions About HPV Vaccines Using Topic Modeling and Community Detection.使用主题建模和社区检测来刻画关于HPV疫苗的推特讨论。
J Med Internet Res. 2016 Aug 29;18(8):e232. doi: 10.2196/jmir.6045.
4
User Real-Time Influence Ranking Algorithm of Social Networks Considering Interactivity and Topicality.考虑交互性和主题性的社交网络用户实时影响力排名算法
Entropy (Basel). 2023 Jun 12;25(6):926. doi: 10.3390/e25060926.
5
A fine granularity based user collaboration algorithm for location privacy protection.一种基于细粒度的用户协作算法,用于保护位置隐私。
PLoS One. 2019 Jul 25;14(7):e0220278. doi: 10.1371/journal.pone.0220278. eCollection 2019.
6
CAMU: Cycle-Consistent Adversarial Mapping Model for User Alignment Across Social Networks.CAMU:跨社交网络的用户对齐的循环一致对抗映射模型。
IEEE Trans Cybern. 2022 Oct;52(10):10709-10720. doi: 10.1109/TCYB.2021.3064294. Epub 2022 Sep 19.
7
A clustering-based differential privacy protection algorithm for weighted social networks.一种用于加权社交网络的基于聚类的差分隐私保护算法。
Math Biosci Eng. 2024 Feb 18;21(3):3755-3773. doi: 10.3934/mbe.2024166.
8
A Multiple Salient Features-Based User Identification across Social Media.一种基于多显著特征的跨社交媒体用户识别方法。
Entropy (Basel). 2022 Apr 1;24(4):495. doi: 10.3390/e24040495.
9
POI-MELSH: Privacy Protection Target Point of Interest Recommendation Algorithm Based on Multi-Exploring Locality Sensitive Hashing.基于多探索局部敏感哈希的兴趣点推荐算法的隐私保护目标点(POI-MELSH)
Front Neurorobot. 2021 Apr 23;15:660304. doi: 10.3389/fnbot.2021.660304. eCollection 2021.
10
Anonymous group structure algorithm based on community structure.基于社区结构的匿名群体结构算法
PeerJ Comput Sci. 2024 Sep 18;10:e2244. doi: 10.7717/peerj-cs.2244. eCollection 2024.

本文引用的文献

1
Anchor Link Prediction across Attributed Networks via Network Embedding.通过网络嵌入实现属性网络中的锚点链接预测
Entropy (Basel). 2019 Mar 6;21(3):254. doi: 10.3390/e21030254.