Applying the multiclass classification methods for the classification of online social network friends

Nikolina Sever, Luka Humski, J. Ilic, Z. Skocir, D. Pintar, M. Vranić
{"title":"Applying the multiclass classification methods for the classification of online social network friends","authors":"Nikolina Sever, Luka Humski, J. Ilic, Z. Skocir, D. Pintar, M. Vranić","doi":"10.23919/SOFTCOM.2017.8115508","DOIUrl":null,"url":null,"abstract":"Online social networks (OSNs) are platforms which facilitate social interactions between their users through message exchange, photo and video sharing, status updates, etc. One of the most popular OSNs is Facebook. Connections between users on Facebook are modeled through concept of friendship. Each connection between users is binary — two users either are or aren't \"friends\". Information about of the actual intensity or nature of their connection is not available although in real life it can vary significantly. A majority of observed network friends are acquaintances in real-life while close friends are in the minority. The goal of this paper is to demonstrate and evaluate how user interaction statistics can be utilized for effective assessment of the nature of users' real-life relationship. Using an ensemble of popular classification algorithms, we will classify ego-user's network friends into 3 groups: close friends, friends and acquaintances. As our main contribution, we will compare the efficiency of chosen algorithms and suggest the best approach for conducting this type of analysis on similar OSN communication data.","PeriodicalId":189860,"journal":{"name":"2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/SOFTCOM.2017.8115508","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Online social networks (OSNs) are platforms which facilitate social interactions between their users through message exchange, photo and video sharing, status updates, etc. One of the most popular OSNs is Facebook. Connections between users on Facebook are modeled through concept of friendship. Each connection between users is binary — two users either are or aren't "friends". Information about of the actual intensity or nature of their connection is not available although in real life it can vary significantly. A majority of observed network friends are acquaintances in real-life while close friends are in the minority. The goal of this paper is to demonstrate and evaluate how user interaction statistics can be utilized for effective assessment of the nature of users' real-life relationship. Using an ensemble of popular classification algorithms, we will classify ego-user's network friends into 3 groups: close friends, friends and acquaintances. As our main contribution, we will compare the efficiency of chosen algorithms and suggest the best approach for conducting this type of analysis on similar OSN communication data.
应用多类分类方法对在线社交网络好友进行分类
在线社交网络是用户之间通过信息交换、照片和视频分享、状态更新等方式进行社交互动的平台。最流行的osn之一是Facebook。Facebook用户之间的联系是通过友谊的概念来建模的。用户之间的每个连接都是二元的——两个用户要么是“朋友”,要么不是。虽然在现实生活中,这种联系的强度或性质可能会有很大差异,但目前还无法获得有关这种联系的实际强度或性质的信息。大多数观察到的网络朋友是现实生活中的熟人,而亲密的朋友是少数。本文的目标是演示和评估如何利用用户交互统计来有效评估用户现实生活关系的性质。使用一组流行的分类算法,我们将自我用户的网络朋友分为3组:亲密朋友、朋友和熟人。作为我们的主要贡献,我们将比较所选算法的效率,并提出对类似OSN通信数据进行此类分析的最佳方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信