Applying the binary classification methods for discovering the best friends on an online social network

Maja Stupalo, J. Ilic, Luka Humski, Z. Skocir, D. Pintar, M. Vranić
{"title":"Applying the binary classification methods for discovering the best friends on an online social network","authors":"Maja Stupalo, J. Ilic, Luka Humski, Z. Skocir, D. Pintar, M. Vranić","doi":"10.23919/ConTEL.2017.8000052","DOIUrl":null,"url":null,"abstract":"Online social networks (OSN) are one of the most widely adapted services of the Internet infrastructure, Facebook being one of the most popular among them. Facebook models connections between its users through the concept of “friendship”. However, the type and intensity of these connections between different people on Facebook vary significantly. In most cases, friends on Facebook correspond to mere acquaintances in real-life, with only a smaller subset representing actual close friends. The aim of research presented in this paper is to provide a method for estimating the intensity of Facebook friendships, i.e., to distinguish connections representing close friends from others. The study was performed by analyzing Facebook interactions between users (e.g. number of mutual likes, comments, shared photos, etc.) using supervised learning algorithms for binary classification of data. Among the chosen algorithms, the best results were gained by using random forest algorithm - accuracy of 84.73%.","PeriodicalId":410388,"journal":{"name":"2017 14th International Conference on Telecommunications (ConTEL)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 14th International Conference on Telecommunications (ConTEL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ConTEL.2017.8000052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Online social networks (OSN) are one of the most widely adapted services of the Internet infrastructure, Facebook being one of the most popular among them. Facebook models connections between its users through the concept of “friendship”. However, the type and intensity of these connections between different people on Facebook vary significantly. In most cases, friends on Facebook correspond to mere acquaintances in real-life, with only a smaller subset representing actual close friends. The aim of research presented in this paper is to provide a method for estimating the intensity of Facebook friendships, i.e., to distinguish connections representing close friends from others. The study was performed by analyzing Facebook interactions between users (e.g. number of mutual likes, comments, shared photos, etc.) using supervised learning algorithms for binary classification of data. Among the chosen algorithms, the best results were gained by using random forest algorithm - accuracy of 84.73%.
应用二元分类方法在在线社交网络中发现最好的朋友
在线社交网络(OSN)是互联网基础设施中应用最广泛的服务之一,Facebook是其中最受欢迎的服务之一。Facebook通过“友谊”的概念来建立用户之间的联系。然而,Facebook上不同用户之间这种联系的类型和强度差别很大。在大多数情况下,Facebook上的朋友只是现实生活中的熟人,只有一小部分代表真正的亲密朋友。本文提出的研究目的是提供一种估计Facebook友谊强度的方法,即区分代表亲密朋友的连接。该研究是通过使用监督学习算法对数据进行二分类来分析Facebook用户之间的互动(例如相互喜欢的数量,评论,分享的照片等)。在所选算法中,随机森林算法的准确率为84.73%,效果最好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信