深度异构社会网络对齐

Lin Meng, Yuxiang Ren, Jiawei Zhang, Fanghua Ye, Philip S. Yu
{"title":"深度异构社会网络对齐","authors":"Lin Meng, Yuxiang Ren, Jiawei Zhang, Fanghua Ye, Philip S. Yu","doi":"10.1109/CogMI48466.2019.00015","DOIUrl":null,"url":null,"abstract":"The online social network alignment problem aims at inferring the anchor links connecting the shared users across social networks, which are usually subject to the one-to-one cardinality constraint. Several existing social network alignment models have been proposed, many of which are based on the supervised learning setting. Given a set of labeled anchor links, a group of features can be extracted manually for the anchor links to build these models. Meanwhile, such methods may encounter great challenges in the application on real-world social network datasets, since manual feature extraction can be extremely expensive and tedious for the social networks involving heterogeneous information. In this paper, we propose to address the heterogeneous social network alignment problem with a deep learning model, namely DETA (Deep nETwork Alignment). Besides a small number of explicit features, DETA can automatically learn a set of latent features from the heterogeneous information. DETA models the anchor link one-to-one cardinality constraint as a mathematical constraint on the node degrees. Extensive experiments have been done on real-world aligned heterogeneous social network datasets, and the experimental results have demonstrated the effectiveness of the proposed model compared against the existing state-of-the-art baseline methods.","PeriodicalId":116160,"journal":{"name":"2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Deep Heterogeneous Social Network Alignment\",\"authors\":\"Lin Meng, Yuxiang Ren, Jiawei Zhang, Fanghua Ye, Philip S. Yu\",\"doi\":\"10.1109/CogMI48466.2019.00015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The online social network alignment problem aims at inferring the anchor links connecting the shared users across social networks, which are usually subject to the one-to-one cardinality constraint. Several existing social network alignment models have been proposed, many of which are based on the supervised learning setting. Given a set of labeled anchor links, a group of features can be extracted manually for the anchor links to build these models. Meanwhile, such methods may encounter great challenges in the application on real-world social network datasets, since manual feature extraction can be extremely expensive and tedious for the social networks involving heterogeneous information. In this paper, we propose to address the heterogeneous social network alignment problem with a deep learning model, namely DETA (Deep nETwork Alignment). Besides a small number of explicit features, DETA can automatically learn a set of latent features from the heterogeneous information. DETA models the anchor link one-to-one cardinality constraint as a mathematical constraint on the node degrees. Extensive experiments have been done on real-world aligned heterogeneous social network datasets, and the experimental results have demonstrated the effectiveness of the proposed model compared against the existing state-of-the-art baseline methods.\",\"PeriodicalId\":116160,\"journal\":{\"name\":\"2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CogMI48466.2019.00015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CogMI48466.2019.00015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在线社交网络对齐问题旨在推断连接社交网络上共享用户的锚链接,这些锚链接通常受到一对一基数约束。现有的几种社会网络对齐模型已经被提出,其中许多是基于监督学习设置的。给定一组标记的锚链接,可以为锚链接手动提取一组特征来构建这些模型。同时,这种方法在现实社会网络数据集上的应用可能会遇到很大的挑战,因为人工特征提取对于涉及异构信息的社会网络来说是非常昂贵和繁琐的。在本文中,我们提出了一个深度学习模型,即DETA (deep network alignment)来解决异构社会网络对齐问题。除了少量的显式特征外,DETA还可以从异构信息中自动学习一组潜在特征。DETA将锚链接一对一基数约束建模为节点度的数学约束。在现实世界的异构社会网络数据集上进行了大量的实验,实验结果表明,与现有的最先进的基线方法相比,所提出的模型是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Deep Heterogeneous Social Network Alignment
The online social network alignment problem aims at inferring the anchor links connecting the shared users across social networks, which are usually subject to the one-to-one cardinality constraint. Several existing social network alignment models have been proposed, many of which are based on the supervised learning setting. Given a set of labeled anchor links, a group of features can be extracted manually for the anchor links to build these models. Meanwhile, such methods may encounter great challenges in the application on real-world social network datasets, since manual feature extraction can be extremely expensive and tedious for the social networks involving heterogeneous information. In this paper, we propose to address the heterogeneous social network alignment problem with a deep learning model, namely DETA (Deep nETwork Alignment). Besides a small number of explicit features, DETA can automatically learn a set of latent features from the heterogeneous information. DETA models the anchor link one-to-one cardinality constraint as a mathematical constraint on the node degrees. Extensive experiments have been done on real-world aligned heterogeneous social network datasets, and the experimental results have demonstrated the effectiveness of the proposed model compared against the existing state-of-the-art baseline methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信