{"title":"基于隐私保护的友谊强度预测:以Facebook为例","authors":"Nitish Dhakal, Francesca Spezzano, Dianxiang Xu","doi":"10.1145/3110025.3116196","DOIUrl":null,"url":null,"abstract":"Effective friend classification in Online Social Networks (OSN) has many benefits in privacy. Anything posted by a user in social networks like Facebook is distributed among all their friends. Although the user can select the manual option for their post-dissemination, it is not feasible every time. Since not all friends are the same in social networks, the visibility access for the post should be different for different strengths of friendship for privacy. Previous works in finding friendship strength in social networks have used interaction and similarity based features but none of them has considered using sentiment-based features as the driving factor to determine the strength. In this paper, we develop a supervised model to estimate the friendship strength based upon 23 different features comprising of structure based, interaction based, homophily based and sentiment based features. We evaluate our model on a real-world Facebook dataset we built that has ground truth for different types of friendship: close, good, acquaintance, and casual. Our model obtains an AUROC of 0.82 in identifying acquaintances from all the other three categories, and an AUROC of 0.85 in distinguishing between close friends and acquaintances. Our experiments suggest that features like average comment length, reaction scores for likes and love, friend tag score, Jaccard similarity and closeness variable consistently perform better in predicting friendship strength across different classifiers. In addition, combining language-based features with homophilic, structural and interaction features produces more accurate and trustworthy model to evaluate friendship strength.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"286 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Predicting Friendship Strength for Privacy Preserving: A Case Study on Facebook\",\"authors\":\"Nitish Dhakal, Francesca Spezzano, Dianxiang Xu\",\"doi\":\"10.1145/3110025.3116196\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Effective friend classification in Online Social Networks (OSN) has many benefits in privacy. Anything posted by a user in social networks like Facebook is distributed among all their friends. Although the user can select the manual option for their post-dissemination, it is not feasible every time. Since not all friends are the same in social networks, the visibility access for the post should be different for different strengths of friendship for privacy. Previous works in finding friendship strength in social networks have used interaction and similarity based features but none of them has considered using sentiment-based features as the driving factor to determine the strength. In this paper, we develop a supervised model to estimate the friendship strength based upon 23 different features comprising of structure based, interaction based, homophily based and sentiment based features. We evaluate our model on a real-world Facebook dataset we built that has ground truth for different types of friendship: close, good, acquaintance, and casual. Our model obtains an AUROC of 0.82 in identifying acquaintances from all the other three categories, and an AUROC of 0.85 in distinguishing between close friends and acquaintances. Our experiments suggest that features like average comment length, reaction scores for likes and love, friend tag score, Jaccard similarity and closeness variable consistently perform better in predicting friendship strength across different classifiers. In addition, combining language-based features with homophilic, structural and interaction features produces more accurate and trustworthy model to evaluate friendship strength.\",\"PeriodicalId\":399660,\"journal\":{\"name\":\"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017\",\"volume\":\"286 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3110025.3116196\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3110025.3116196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
摘要
在线社交网络(Online Social Networks, OSN)中有效的朋友分类在隐私方面有很多好处。用户在Facebook等社交网络上发布的任何内容都会在他们所有的朋友之间传播。虽然用户可以选择手工方式进行后期传播,但并非每次都可行。因为在社交网络中并不是所有的朋友都是一样的,所以对帖子的可见性访问应该根据不同的友谊强度和隐私而有所不同。之前在社交网络中寻找友谊强度的研究使用了基于交互和相似性的特征,但没有一个研究考虑将基于情感的特征作为决定友谊强度的驱动因素。在本文中,我们开发了一个监督模型来估计基于23个不同特征的友谊强度,包括基于结构的、基于交互的、基于同质性的和基于情感的特征。我们在一个真实的Facebook数据集上评估了我们的模型,这个数据集对不同类型的友谊有基本的真理:亲密的、好的、相识的和随意的。我们的模型在识别其他三个类别的熟人方面的AUROC为0.82,在区分亲密朋友和熟人方面的AUROC为0.85。我们的实验表明,平均评论长度、喜欢和爱的反应得分、朋友标签得分、Jaccard相似性和亲密度变量等特征在预测不同分类器之间的友谊强度方面表现得更好。此外,将基于语言的特征与同质性、结构性和互动性特征相结合,可以产生更准确、更可信的友谊强度评估模型。
Predicting Friendship Strength for Privacy Preserving: A Case Study on Facebook
Effective friend classification in Online Social Networks (OSN) has many benefits in privacy. Anything posted by a user in social networks like Facebook is distributed among all their friends. Although the user can select the manual option for their post-dissemination, it is not feasible every time. Since not all friends are the same in social networks, the visibility access for the post should be different for different strengths of friendship for privacy. Previous works in finding friendship strength in social networks have used interaction and similarity based features but none of them has considered using sentiment-based features as the driving factor to determine the strength. In this paper, we develop a supervised model to estimate the friendship strength based upon 23 different features comprising of structure based, interaction based, homophily based and sentiment based features. We evaluate our model on a real-world Facebook dataset we built that has ground truth for different types of friendship: close, good, acquaintance, and casual. Our model obtains an AUROC of 0.82 in identifying acquaintances from all the other three categories, and an AUROC of 0.85 in distinguishing between close friends and acquaintances. Our experiments suggest that features like average comment length, reaction scores for likes and love, friend tag score, Jaccard similarity and closeness variable consistently perform better in predicting friendship strength across different classifiers. In addition, combining language-based features with homophilic, structural and interaction features produces more accurate and trustworthy model to evaluate friendship strength.