什么是弱关系?分析共曝光网络的过滤技术比较

Subhayan Mukerjee, Tian Yang, G. Stadler, Sandra González-Bailón
{"title":"什么是弱关系?分析共曝光网络的过滤技术比较","authors":"Subhayan Mukerjee, Tian Yang, G. Stadler, Sandra González-Bailón","doi":"10.2139/ssrn.3368603","DOIUrl":null,"url":null,"abstract":"Co-exposure networks are a useful tool to analyze patterns of news consumption. In these networks, nodes are news sources and ties measure the strength of their audience overlap. In observational data, some overlap might result from random exposure or random browsing behavior. Filtering techniques can help eliminate the weakest connections and, with them, random noise. There are different approaches to filtering weighted networks; however, it is not always clear which approach is the most appropriate. Here, we describe three different techniques and we compare their performance using two observed networks. First, we assess the impact that each technique has on the global topology. We then study the trade-off that exists between removing ties and preserving the connectedness of the network, and we offer a mathematical approach to systematically analyze that trade-off. We propose a method to identify an optimal threshold to maximize the number of edges removed while minimizing the number of nodes that become isolates.","PeriodicalId":448402,"journal":{"name":"Corporate Governance & Sociology or Psychology eJournal","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"What Counts as a Weak Tie? A Comparison of Filtering Techniques to Analyze Co-Exposure Networks\",\"authors\":\"Subhayan Mukerjee, Tian Yang, G. Stadler, Sandra González-Bailón\",\"doi\":\"10.2139/ssrn.3368603\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Co-exposure networks are a useful tool to analyze patterns of news consumption. In these networks, nodes are news sources and ties measure the strength of their audience overlap. In observational data, some overlap might result from random exposure or random browsing behavior. Filtering techniques can help eliminate the weakest connections and, with them, random noise. There are different approaches to filtering weighted networks; however, it is not always clear which approach is the most appropriate. Here, we describe three different techniques and we compare their performance using two observed networks. First, we assess the impact that each technique has on the global topology. We then study the trade-off that exists between removing ties and preserving the connectedness of the network, and we offer a mathematical approach to systematically analyze that trade-off. We propose a method to identify an optimal threshold to maximize the number of edges removed while minimizing the number of nodes that become isolates.\",\"PeriodicalId\":448402,\"journal\":{\"name\":\"Corporate Governance & Sociology or Psychology eJournal\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Corporate Governance & Sociology or Psychology eJournal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.3368603\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Corporate Governance & Sociology or Psychology eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3368603","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

共同曝光网络是分析新闻消费模式的有用工具。在这些网络中,节点是新闻来源,关系衡量受众重叠的强度。在观测数据中,一些重叠可能是由于随机暴露或随机浏览行为造成的。过滤技术可以帮助消除最弱的连接,以及随机噪声。有不同的方法来过滤加权网络;然而,并不总是清楚哪种方法是最合适的。在这里,我们描述了三种不同的技术,并使用两个观察到的网络比较了它们的性能。首先,我们评估每种技术对全局拓扑结构的影响。然后,我们研究了在消除联系和保持网络连通性之间存在的权衡,并提供了一种数学方法来系统地分析这种权衡。我们提出了一种方法来确定一个最优阈值,以最大限度地增加边缘的数量,同时最小化成为孤立的节点的数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
What Counts as a Weak Tie? A Comparison of Filtering Techniques to Analyze Co-Exposure Networks
Co-exposure networks are a useful tool to analyze patterns of news consumption. In these networks, nodes are news sources and ties measure the strength of their audience overlap. In observational data, some overlap might result from random exposure or random browsing behavior. Filtering techniques can help eliminate the weakest connections and, with them, random noise. There are different approaches to filtering weighted networks; however, it is not always clear which approach is the most appropriate. Here, we describe three different techniques and we compare their performance using two observed networks. First, we assess the impact that each technique has on the global topology. We then study the trade-off that exists between removing ties and preserving the connectedness of the network, and we offer a mathematical approach to systematically analyze that trade-off. We propose a method to identify an optimal threshold to maximize the number of edges removed while minimizing the number of nodes that become isolates.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信