DIFSoN: Discovering influential friends from social networks

S. Tanbeer, C. Leung, Juan J. Cameron
{"title":"DIFSoN: Discovering influential friends from social networks","authors":"S. Tanbeer, C. Leung, Juan J. Cameron","doi":"10.1109/CASoN.2012.6412389","DOIUrl":null,"url":null,"abstract":"Social networks, which are made of social entities (e.g., individual users) linked by some specific types of interdependencies such as friendship, have become popular to facilitate collaboration and knowledge sharing among users. Such interactions or interdependencies can be dependent on or influenced by user characteristics such as connectivity, centrality, weight, importance, and activity in the networks. As such, some users in the social networks can be considered as highly influential to others. In this paper, we propose a computational model that integrates data mining with social computing to help users to discover influential friends from the social networks.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASoN.2012.6412389","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Social networks, which are made of social entities (e.g., individual users) linked by some specific types of interdependencies such as friendship, have become popular to facilitate collaboration and knowledge sharing among users. Such interactions or interdependencies can be dependent on or influenced by user characteristics such as connectivity, centrality, weight, importance, and activity in the networks. As such, some users in the social networks can be considered as highly influential to others. In this paper, we propose a computational model that integrates data mining with social computing to help users to discover influential friends from the social networks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
DIFSoN:从社交网络中发现有影响力的朋友
社交网络是由一些特定类型的相互依赖关系(如友谊)连接起来的社会实体(如个人用户)组成的,它已经变得流行,以促进用户之间的协作和知识共享。这种交互或相互依赖可能依赖于或受到用户特征的影响,例如网络中的连通性、中心性、权重、重要性和活动。因此,社交网络中的一些用户可以被认为对其他人具有高度影响力。在本文中,我们提出了一个将数据挖掘与社会计算相结合的计算模型,以帮助用户从社交网络中发现有影响力的朋友。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Boosting Optimum-Path Forest clustering through harmony Search and its applications for intrusion detection in computer networks Graph-based cross-validated committees ensembles Automatic sentiment analysis of Twitter messages Identifying focal patterns in social networks Ontology-based Negotiation of security requirements in cloud
×
引用
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