审计算法:从外到内理解算法系统

D. Metaxa, J. Park, Ronald E. Robertson, Karrie Karahalios, Christo Wilson, J. Hancock, Christian Sandvig
{"title":"审计算法:从外到内理解算法系统","authors":"D. Metaxa, J. Park, Ronald E. Robertson, Karrie Karahalios, Christo Wilson, J. Hancock, Christian Sandvig","doi":"10.1561/1100000083","DOIUrl":null,"url":null,"abstract":"Algorithms are ubiquitous and critical sources of information online, increasingly acting as gatekeepers for users accessing or sharing information about virtually any topic, including their personal lives and those of friends and family, news and politics, entertainment, and even information about health and well-being. As a result, algorithmically-curated content is drawing increased attention and scrutiny from users, the media, and lawmakers alike. However, studying such content poses considerable challenges, as it is both dynamic and ephemeral: these algorithms are constantly changing, and frequently changing silently, with no record of the content to which users have been exposed over time. One strategy that has proven effective is the algorithm audit: a method of repeatedly querying an algorithm and observing its output in order to draw conclusions about the algorithm’s opaque Danaë Metaxa, Joon Sung Park, Ronald E. Robertson, Karrie Karahalios, Christo Wilson, Jeff Hancock and Christian Sandvig (2021), “Auditing Algorithms”, Foundations and Trends® in Human-Computer Interaction: Vol. 14, No. 4, pp 272–344. DOI: 10.1561/1100000083. ©2021 D. Metaxa et al.","PeriodicalId":126315,"journal":{"name":"Found. Trends Hum. Comput. Interact.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"49","resultStr":"{\"title\":\"Auditing Algorithms: Understanding Algorithmic Systems from the Outside In\",\"authors\":\"D. Metaxa, J. Park, Ronald E. Robertson, Karrie Karahalios, Christo Wilson, J. Hancock, Christian Sandvig\",\"doi\":\"10.1561/1100000083\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Algorithms are ubiquitous and critical sources of information online, increasingly acting as gatekeepers for users accessing or sharing information about virtually any topic, including their personal lives and those of friends and family, news and politics, entertainment, and even information about health and well-being. As a result, algorithmically-curated content is drawing increased attention and scrutiny from users, the media, and lawmakers alike. However, studying such content poses considerable challenges, as it is both dynamic and ephemeral: these algorithms are constantly changing, and frequently changing silently, with no record of the content to which users have been exposed over time. One strategy that has proven effective is the algorithm audit: a method of repeatedly querying an algorithm and observing its output in order to draw conclusions about the algorithm’s opaque Danaë Metaxa, Joon Sung Park, Ronald E. Robertson, Karrie Karahalios, Christo Wilson, Jeff Hancock and Christian Sandvig (2021), “Auditing Algorithms”, Foundations and Trends® in Human-Computer Interaction: Vol. 14, No. 4, pp 272–344. DOI: 10.1561/1100000083. ©2021 D. Metaxa et al.\",\"PeriodicalId\":126315,\"journal\":{\"name\":\"Found. Trends Hum. Comput. Interact.\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"49\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Found. Trends Hum. Comput. Interact.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1561/1100000083\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Found. Trends Hum. Comput. Interact.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1561/1100000083","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 49

摘要

算法无处不在,是在线信息的关键来源,越来越多地充当用户访问或分享几乎任何话题的信息的看门人,包括他们的个人生活、朋友和家人的生活、新闻和政治、娱乐,甚至有关健康和福祉的信息。因此,算法策划的内容正在引起用户、媒体和立法者越来越多的关注和审查。然而,研究这样的内容带来了相当大的挑战,因为它既是动态的,又是短暂的:这些算法不断变化,而且经常无声地变化,随着时间的推移,用户接触到的内容没有记录。一种被证明有效的策略是算法审计:一种反复查询算法并观察其输出的方法,以便得出关于算法不透明Danaë mettaxa的结论,Joon Sung Park, Ronald E. Robertson, Karrie Karahalios, Christo Wilson, Jeff Hancock和Christian Sandvig(2021),“审计算法”,人机交互的基础和趋势®:第14卷,第4期,第272-344页。DOI: 10.1561 / 1100000083。©2021 D. Metaxa等。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Auditing Algorithms: Understanding Algorithmic Systems from the Outside In
Algorithms are ubiquitous and critical sources of information online, increasingly acting as gatekeepers for users accessing or sharing information about virtually any topic, including their personal lives and those of friends and family, news and politics, entertainment, and even information about health and well-being. As a result, algorithmically-curated content is drawing increased attention and scrutiny from users, the media, and lawmakers alike. However, studying such content poses considerable challenges, as it is both dynamic and ephemeral: these algorithms are constantly changing, and frequently changing silently, with no record of the content to which users have been exposed over time. One strategy that has proven effective is the algorithm audit: a method of repeatedly querying an algorithm and observing its output in order to draw conclusions about the algorithm’s opaque Danaë Metaxa, Joon Sung Park, Ronald E. Robertson, Karrie Karahalios, Christo Wilson, Jeff Hancock and Christian Sandvig (2021), “Auditing Algorithms”, Foundations and Trends® in Human-Computer Interaction: Vol. 14, No. 4, pp 272–344. DOI: 10.1561/1100000083. ©2021 D. Metaxa et al.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信