whoosnext:使用基于传播激活网络的方法推荐Twitter用户关注

Marco Siino, M. Cascia, I. Tinnirello
{"title":"whoosnext:使用基于传播激活网络的方法推荐Twitter用户关注","authors":"Marco Siino, M. Cascia, I. Tinnirello","doi":"10.1109/ICDMW51313.2020.00018","DOIUrl":null,"url":null,"abstract":"The huge number of modern social network users has made the web a fertile ground for the growth and development of a plethora of recommender systems. To date, recommending a new user profile X to a given user U that could be interested in creating a relationship with X has been tackled using techniques based on content analysis, existing friendship relationships and other pieces of information coming from different social networks or websites. In this paper we propose a recommending architecture - called WhoSNext (WSN) - tested on Twitter and which aim is promoting the creation of new relationships among users. As recent researches show, this is an interesting recommendation problem: for a given user U, find which other user might be proposed to U as a new friend. Instead of conducting a study based on a semantic approach (e.g. analyzing tweet content), the proposed algorithm exploits a graph created from a set of Twitter users called seeds. In this work - and, to the best of our knowledge, for the first time - this issue is addressed using only user ID for building a particular Spreading Activation Network. This network was firstly trained and then tested on a set consisting of over 400,000 real users. Experimental results show that this approach outperforms the results obtained from many well-known state-of-the-art systems, which are much more expensive in terms of either data preprocessing or computational resources.","PeriodicalId":426846,"journal":{"name":"2020 International Conference on Data Mining Workshops (ICDMW)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"WhoSNext: Recommending Twitter Users to Follow Using a Spreading Activation Network Based Approach\",\"authors\":\"Marco Siino, M. Cascia, I. Tinnirello\",\"doi\":\"10.1109/ICDMW51313.2020.00018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The huge number of modern social network users has made the web a fertile ground for the growth and development of a plethora of recommender systems. To date, recommending a new user profile X to a given user U that could be interested in creating a relationship with X has been tackled using techniques based on content analysis, existing friendship relationships and other pieces of information coming from different social networks or websites. In this paper we propose a recommending architecture - called WhoSNext (WSN) - tested on Twitter and which aim is promoting the creation of new relationships among users. As recent researches show, this is an interesting recommendation problem: for a given user U, find which other user might be proposed to U as a new friend. Instead of conducting a study based on a semantic approach (e.g. analyzing tweet content), the proposed algorithm exploits a graph created from a set of Twitter users called seeds. In this work - and, to the best of our knowledge, for the first time - this issue is addressed using only user ID for building a particular Spreading Activation Network. This network was firstly trained and then tested on a set consisting of over 400,000 real users. Experimental results show that this approach outperforms the results obtained from many well-known state-of-the-art systems, which are much more expensive in terms of either data preprocessing or computational resources.\",\"PeriodicalId\":426846,\"journal\":{\"name\":\"2020 International Conference on Data Mining Workshops (ICDMW)\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Data Mining Workshops (ICDMW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDMW51313.2020.00018\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Data Mining Workshops (ICDMW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMW51313.2020.00018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

庞大的现代社交网络用户数量使网络成为大量推荐系统成长和发展的沃土。迄今为止,向可能有兴趣与X建立关系的特定用户U推荐新用户档案X的技术已经解决了,该技术基于内容分析、现有的友谊关系和来自不同社交网络或网站的其他信息片段。在本文中,我们提出了一种推荐架构,称为WhoSNext (WSN),在Twitter上进行了测试,其目的是促进用户之间建立新的关系。最近的研究表明,这是一个有趣的推荐问题:对于给定的用户U,找出哪些其他用户可能被推荐给U作为新朋友。该算法不是基于语义方法(例如分析tweet内容)进行研究,而是利用一组被称为种子的Twitter用户创建的图。在这项工作中-据我们所知,这是第一次-仅使用用户ID来构建特定的传播激活网络来解决这个问题。首先对这个网络进行训练,然后在一个由40多万真实用户组成的集合上进行测试。实验结果表明,该方法优于许多众所周知的最先进的系统,这些系统在数据预处理或计算资源方面都要昂贵得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
WhoSNext: Recommending Twitter Users to Follow Using a Spreading Activation Network Based Approach
The huge number of modern social network users has made the web a fertile ground for the growth and development of a plethora of recommender systems. To date, recommending a new user profile X to a given user U that could be interested in creating a relationship with X has been tackled using techniques based on content analysis, existing friendship relationships and other pieces of information coming from different social networks or websites. In this paper we propose a recommending architecture - called WhoSNext (WSN) - tested on Twitter and which aim is promoting the creation of new relationships among users. As recent researches show, this is an interesting recommendation problem: for a given user U, find which other user might be proposed to U as a new friend. Instead of conducting a study based on a semantic approach (e.g. analyzing tweet content), the proposed algorithm exploits a graph created from a set of Twitter users called seeds. In this work - and, to the best of our knowledge, for the first time - this issue is addressed using only user ID for building a particular Spreading Activation Network. This network was firstly trained and then tested on a set consisting of over 400,000 real users. Experimental results show that this approach outperforms the results obtained from many well-known state-of-the-art systems, which are much more expensive in terms of either data preprocessing or computational resources.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信