The identification of intimate friends in personal social network

Moohong Min, Donjung Choi, Jaekwang Kim, Jee-Hyong Lee
{"title":"The identification of intimate friends in personal social network","authors":"Moohong Min, Donjung Choi, Jaekwang Kim, Jee-Hyong Lee","doi":"10.1109/CASON.2011.6085950","DOIUrl":null,"url":null,"abstract":"Nowadays, social network services, such as Twitter and Facebook, are widely being exploited. Many people have participated in social network services to enjoy the communication with their friends and to extend personal social networks. Since it is easy to extend their relations to others, people usually have a large acquaintance list in social network services. In the lists, various users, not only friends but also unfamiliar users such as celebrities, news media, or even unknown users, can be included. Because of large acquaintance lists, it is usually hard to hear from intimate users because of heavy posting from unfamiliar users. So, social network services need to identify intimate friends of users for better services. We propose a new method to identify intimate users in the acquaintance list. This method ranks people in the list based on the amount of communication and common acquaintances. We combine those with weighted parameters, which are experimentally found. It is found that users had a higher satisfaction with our method through experimentations.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASON.2011.6085950","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Nowadays, social network services, such as Twitter and Facebook, are widely being exploited. Many people have participated in social network services to enjoy the communication with their friends and to extend personal social networks. Since it is easy to extend their relations to others, people usually have a large acquaintance list in social network services. In the lists, various users, not only friends but also unfamiliar users such as celebrities, news media, or even unknown users, can be included. Because of large acquaintance lists, it is usually hard to hear from intimate users because of heavy posting from unfamiliar users. So, social network services need to identify intimate friends of users for better services. We propose a new method to identify intimate users in the acquaintance list. This method ranks people in the list based on the amount of communication and common acquaintances. We combine those with weighted parameters, which are experimentally found. It is found that users had a higher satisfaction with our method through experimentations.
个人社交网络中亲密朋友的识别
如今,社交网络服务,如Twitter和Facebook,被广泛利用。许多人参与社交网络服务是为了享受与朋友的交流,扩展个人的社交网络。由于很容易将他们的关系扩展到其他人,人们通常在社交网络服务中有一个很大的熟人名单。在榜单中,各种各样的用户,不仅包括朋友,也包括不熟悉的用户,如名人、新闻媒体,甚至是不知名的用户。由于熟人列表很大,通常很难听到亲密用户的声音,因为不熟悉的用户发布了大量帖子。因此,社交网络服务需要识别用户的亲密朋友,以便更好地提供服务。提出了一种从熟人列表中识别亲密用户的新方法。这种方法根据交流的次数和共同认识的人对名单进行排名。我们将这些参数与实验发现的加权参数结合起来。通过实验发现,用户对我们的方法有较高的满意度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信