面向频道推荐的通信平台开放数据隐式用户网络分析

A. Bobic, Igor Jakovljevic, C. Gütl, Jean-Marie Le Goff, Andreas Wagner
{"title":"面向频道推荐的通信平台开放数据隐式用户网络分析","authors":"A. Bobic, Igor Jakovljevic, C. Gütl, Jean-Marie Le Goff, Andreas Wagner","doi":"10.1109/SNAMS58071.2022.10062597","DOIUrl":null,"url":null,"abstract":"Recommender systems play a pivotal role in various human-centered online systems by filtering out relevant information from large databases. However, most recommender systems consume explicit private user information such as exchanged messages and information between users and items such as likes and shares without exploring other latent factors. Past events have shown that this can have decremental consequences on users' privacy. One type of application where alternative solutions have not yet been investigated are messaging platforms in larger corporate environments. These applications would benefit from recommender systems that consume only anonymized implicit data to enable employees to discover new communities and people. As a first step in developing such a recommender system, this paper describes the construction and analysis of implicit social network data from the messaging platform Mattermost at CERN and the extraction of measures for indicating similarity between users and channels. Additionally, it describes the use of these measures to evaluate multiple existing collaborative filter-based recommender systems, where their performances are compared and evaluated against simple measures. The evaluation results indicate that combining clustering approaches and custom features extracted through our data analysis outperforms standard collaborative filtering techniques. These results will be used in the future to create a new custom recommender system for messaging at CERN that only uses anonymized and implicit data.","PeriodicalId":371668,"journal":{"name":"2022 Ninth International Conference on Social Networks Analysis, Management and Security (SNAMS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Implicit User Network Analysis of Communication Platform Open Data for Channel Recommendation\",\"authors\":\"A. Bobic, Igor Jakovljevic, C. Gütl, Jean-Marie Le Goff, Andreas Wagner\",\"doi\":\"10.1109/SNAMS58071.2022.10062597\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recommender systems play a pivotal role in various human-centered online systems by filtering out relevant information from large databases. However, most recommender systems consume explicit private user information such as exchanged messages and information between users and items such as likes and shares without exploring other latent factors. Past events have shown that this can have decremental consequences on users' privacy. One type of application where alternative solutions have not yet been investigated are messaging platforms in larger corporate environments. These applications would benefit from recommender systems that consume only anonymized implicit data to enable employees to discover new communities and people. As a first step in developing such a recommender system, this paper describes the construction and analysis of implicit social network data from the messaging platform Mattermost at CERN and the extraction of measures for indicating similarity between users and channels. Additionally, it describes the use of these measures to evaluate multiple existing collaborative filter-based recommender systems, where their performances are compared and evaluated against simple measures. The evaluation results indicate that combining clustering approaches and custom features extracted through our data analysis outperforms standard collaborative filtering techniques. These results will be used in the future to create a new custom recommender system for messaging at CERN that only uses anonymized and implicit data.\",\"PeriodicalId\":371668,\"journal\":{\"name\":\"2022 Ninth International Conference on Social Networks Analysis, Management and Security (SNAMS)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 Ninth International Conference on Social Networks Analysis, Management and Security (SNAMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNAMS58071.2022.10062597\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Ninth International Conference on Social Networks Analysis, Management and Security (SNAMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNAMS58071.2022.10062597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

推荐系统通过从大型数据库中过滤出相关信息,在各种以人为中心的在线系统中发挥着关键作用。然而,大多数推荐系统使用明确的私人用户信息,如用户与物品之间的交换消息和信息,如喜欢和分享,而没有探索其他潜在因素。过去的事件表明,这可能会对用户的隐私产生负面影响。有一种类型的应用程序的替代解决方案还没有被研究过,那就是大型企业环境中的消息传递平台。这些应用程序将受益于仅使用匿名隐式数据的推荐系统,从而使员工能够发现新的社区和人员。作为开发这种推荐系统的第一步,本文描述了来自CERN消息传递平台Mattermost的隐式社交网络数据的构建和分析,以及用户和频道之间表示相似性的度量的提取。此外,它还描述了使用这些度量来评估多个现有的基于过滤器的协作推荐系统,其中它们的性能与简单的度量进行比较和评估。评估结果表明,结合聚类方法和通过我们的数据分析提取的自定义特征优于标准的协同过滤技术。这些结果将在未来用于在CERN创建一个新的定制推荐系统,该系统只使用匿名和隐式数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Implicit User Network Analysis of Communication Platform Open Data for Channel Recommendation
Recommender systems play a pivotal role in various human-centered online systems by filtering out relevant information from large databases. However, most recommender systems consume explicit private user information such as exchanged messages and information between users and items such as likes and shares without exploring other latent factors. Past events have shown that this can have decremental consequences on users' privacy. One type of application where alternative solutions have not yet been investigated are messaging platforms in larger corporate environments. These applications would benefit from recommender systems that consume only anonymized implicit data to enable employees to discover new communities and people. As a first step in developing such a recommender system, this paper describes the construction and analysis of implicit social network data from the messaging platform Mattermost at CERN and the extraction of measures for indicating similarity between users and channels. Additionally, it describes the use of these measures to evaluate multiple existing collaborative filter-based recommender systems, where their performances are compared and evaluated against simple measures. The evaluation results indicate that combining clustering approaches and custom features extracted through our data analysis outperforms standard collaborative filtering techniques. These results will be used in the future to create a new custom recommender system for messaging at CERN that only uses anonymized and implicit data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Classifying Arabian Gulf Tweets to Detect People's Trends: A case study Implicit User Network Analysis of Communication Platform Open Data for Channel Recommendation Anomalous/Relevant Event Detection (A/RED): Active Machine Learning for Finding Rare Events Knowledge Management Role in Enhancing Customer Relationship Management in Hotels Industry in the UK Social Media Acceptance and e-Learning Post-Covid-19: New factors determine the extension of TAM
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1