在社交网络的多个领域中寻找重要的朋友群

S. Tanbeer, Fan Jiang, C. Leung, Richard Kyle MacKinnon, Irish J. M. Medina
{"title":"在社交网络的多个领域中寻找重要的朋友群","authors":"S. Tanbeer, Fan Jiang, C. Leung, Richard Kyle MacKinnon, Irish J. M. Medina","doi":"10.1109/CASoN.2013.6622608","DOIUrl":null,"url":null,"abstract":"Social networking websites such as Facebook, LinkedIn, Twitter, and Weibo have been used for collaboration and knowledge sharing between users. The mining of social network data has become an important topic in data mining and computational aspects of social networks. Nowadays, it is not uncommon for most users in a social network to have many friends and in multiple social domains. Among these friends, some groups of friends are more significant than others. In this paper, we introduce a data mining technique that helps social network users find groups of friends who are significant across multiple domains in social networks.","PeriodicalId":221487,"journal":{"name":"2013 Fifth International Conference on Computational Aspects of Social Networks","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Finding groups of friends who are significant across multiple domains in social networks\",\"authors\":\"S. Tanbeer, Fan Jiang, C. Leung, Richard Kyle MacKinnon, Irish J. M. Medina\",\"doi\":\"10.1109/CASoN.2013.6622608\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Social networking websites such as Facebook, LinkedIn, Twitter, and Weibo have been used for collaboration and knowledge sharing between users. The mining of social network data has become an important topic in data mining and computational aspects of social networks. Nowadays, it is not uncommon for most users in a social network to have many friends and in multiple social domains. Among these friends, some groups of friends are more significant than others. In this paper, we introduce a data mining technique that helps social network users find groups of friends who are significant across multiple domains in social networks.\",\"PeriodicalId\":221487,\"journal\":{\"name\":\"2013 Fifth International Conference on Computational Aspects of Social Networks\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Fifth International Conference on Computational Aspects of Social Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CASoN.2013.6622608\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Fifth International Conference on Computational Aspects of Social Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASoN.2013.6622608","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

Facebook、LinkedIn、Twitter和微博等社交网站已被用于用户之间的协作和知识共享。社交网络数据的挖掘已经成为社交网络数据挖掘和计算方面的一个重要课题。如今,社交网络中的大多数用户在多个社交领域拥有许多朋友,这并不罕见。在这些朋友中,一些朋友群体比其他朋友群体更重要。在本文中,我们介绍了一种数据挖掘技术,可以帮助社交网络用户在社交网络的多个领域中找到重要的朋友群。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Finding groups of friends who are significant across multiple domains in social networks
Social networking websites such as Facebook, LinkedIn, Twitter, and Weibo have been used for collaboration and knowledge sharing between users. The mining of social network data has become an important topic in data mining and computational aspects of social networks. Nowadays, it is not uncommon for most users in a social network to have many friends and in multiple social domains. Among these friends, some groups of friends are more significant than others. In this paper, we introduce a data mining technique that helps social network users find groups of friends who are significant across multiple domains in social networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Implementing quasi-parallel breadth-first search in MapReduce for large-scale social network mining Expert user discovery in a spontaneous social network an approach using knowledge retrieval Instances of subconscious social intelligent computing Finding groups of friends who are significant across multiple domains in social networks Triads, transitivity, and social effects in user interactions on Facebook
×
引用
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