基于贝叶斯网络的刑事诉讼数据库检索问题研究。

Alex Biedermann, Joëlle Vuille, Franco Taroni
{"title":"基于贝叶斯网络的刑事诉讼数据库检索问题研究。","authors":"Alex Biedermann,&nbsp;Joëlle Vuille,&nbsp;Franco Taroni","doi":"10.1186/2041-2223-3-16","DOIUrl":null,"url":null,"abstract":"<p><strong>Unlabelled: </strong></p><p><strong>Background: </strong>The 'database search problem', that is, the strengthening of a case - in terms of probative value - against an individual who is found as a result of a database search, has been approached during the last two decades with substantial mathematical analyses, accompanied by lively debate and centrally opposing conclusions. This represents a challenging obstacle in teaching but also hinders a balanced and coherent discussion of the topic within the wider scientific and legal community. This paper revisits and tracks the associated mathematical analyses in terms of Bayesian networks. Their derivation and discussion for capturing probabilistic arguments that explain the database search problem are outlined in detail. The resulting Bayesian networks offer a distinct view on the main debated issues, along with further clarity.</p><p><strong>Methods: </strong>As a general framework for representing and analyzing formal arguments in probabilistic reasoning about uncertain target propositions (that is, whether or not a given individual is the source of a crime stain), this paper relies on graphical probability models, in particular, Bayesian networks. This graphical probability modeling approach is used to capture, within a single model, a series of key variables, such as the number of individuals in a database, the size of the population of potential crime stain sources, and the rarity of the corresponding analytical characteristics in a relevant population.</p><p><strong>Results: </strong>This paper demonstrates the feasibility of deriving Bayesian network structures for analyzing, representing, and tracking the database search problem. The output of the proposed models can be shown to agree with existing but exclusively formulaic approaches.</p><p><strong>Conclusions: </strong>The proposed Bayesian networks allow one to capture and analyze the currently most well-supported but reputedly counter-intuitive and difficult solution to the database search problem in a way that goes beyond the traditional, purely formulaic expressions. The method's graphical environment, along with its computational and probabilistic architectures, represents a rich package that offers analysts and discussants with additional modes of interaction, concise representation, and coherent communication.</p>","PeriodicalId":89160,"journal":{"name":"Investigative genetics","volume":"3 1","pages":"16"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/2041-2223-3-16","citationCount":"2","resultStr":"{\"title\":\"A Bayesian network approach to the database search problem in criminal proceedings.\",\"authors\":\"Alex Biedermann,&nbsp;Joëlle Vuille,&nbsp;Franco Taroni\",\"doi\":\"10.1186/2041-2223-3-16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Unlabelled: </strong></p><p><strong>Background: </strong>The 'database search problem', that is, the strengthening of a case - in terms of probative value - against an individual who is found as a result of a database search, has been approached during the last two decades with substantial mathematical analyses, accompanied by lively debate and centrally opposing conclusions. This represents a challenging obstacle in teaching but also hinders a balanced and coherent discussion of the topic within the wider scientific and legal community. This paper revisits and tracks the associated mathematical analyses in terms of Bayesian networks. Their derivation and discussion for capturing probabilistic arguments that explain the database search problem are outlined in detail. The resulting Bayesian networks offer a distinct view on the main debated issues, along with further clarity.</p><p><strong>Methods: </strong>As a general framework for representing and analyzing formal arguments in probabilistic reasoning about uncertain target propositions (that is, whether or not a given individual is the source of a crime stain), this paper relies on graphical probability models, in particular, Bayesian networks. This graphical probability modeling approach is used to capture, within a single model, a series of key variables, such as the number of individuals in a database, the size of the population of potential crime stain sources, and the rarity of the corresponding analytical characteristics in a relevant population.</p><p><strong>Results: </strong>This paper demonstrates the feasibility of deriving Bayesian network structures for analyzing, representing, and tracking the database search problem. The output of the proposed models can be shown to agree with existing but exclusively formulaic approaches.</p><p><strong>Conclusions: </strong>The proposed Bayesian networks allow one to capture and analyze the currently most well-supported but reputedly counter-intuitive and difficult solution to the database search problem in a way that goes beyond the traditional, purely formulaic expressions. The method's graphical environment, along with its computational and probabilistic architectures, represents a rich package that offers analysts and discussants with additional modes of interaction, concise representation, and coherent communication.</p>\",\"PeriodicalId\":89160,\"journal\":{\"name\":\"Investigative genetics\",\"volume\":\"3 1\",\"pages\":\"16\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1186/2041-2223-3-16\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Investigative genetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1186/2041-2223-3-16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Investigative genetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/2041-2223-3-16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

背景:“数据库搜索问题”,即在证据价值方面对数据库搜索结果中发现的个人的案件进行强化,在过去二十年中已经通过大量的数学分析进行了处理,伴随着激烈的辩论和集中反对的结论。这在教学中是一个具有挑战性的障碍,但也阻碍了在更广泛的科学和法律界对这一主题进行平衡和连贯的讨论。本文从贝叶斯网络的角度回顾和跟踪了相关的数学分析。详细概述了它们的推导和对捕获解释数据库搜索问题的概率参数的讨论。由此产生的贝叶斯网络为主要争论问题提供了一个独特的观点,并进一步清晰。方法:作为表示和分析不确定目标命题(即给定个体是否为犯罪污点的来源)的概率推理中的形式论点的一般框架,本文依赖于图形概率模型,特别是贝叶斯网络。这种图形概率建模方法用于在单个模型中捕获一系列关键变量,例如数据库中的个人数量,潜在犯罪污点来源的人口规模,以及相关人口中相应分析特征的稀有性。结果:本文论证了推导贝叶斯网络结构用于分析、表示和跟踪数据库搜索问题的可行性。所提出的模型的输出可以证明与现有的但完全公式化的方法一致。结论:提出的贝叶斯网络允许人们以一种超越传统的、纯粹的公式表达式的方式捕获和分析当前最受支持的、但据说是反直觉的、困难的数据库搜索问题的解决方案。该方法的图形环境,连同它的计算和概率架构,代表了一个丰富的包,为分析人员和讨论者提供了额外的交互模式,简洁的表示,和连贯的沟通。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A Bayesian network approach to the database search problem in criminal proceedings.

A Bayesian network approach to the database search problem in criminal proceedings.

A Bayesian network approach to the database search problem in criminal proceedings.

A Bayesian network approach to the database search problem in criminal proceedings.

Unlabelled:

Background: The 'database search problem', that is, the strengthening of a case - in terms of probative value - against an individual who is found as a result of a database search, has been approached during the last two decades with substantial mathematical analyses, accompanied by lively debate and centrally opposing conclusions. This represents a challenging obstacle in teaching but also hinders a balanced and coherent discussion of the topic within the wider scientific and legal community. This paper revisits and tracks the associated mathematical analyses in terms of Bayesian networks. Their derivation and discussion for capturing probabilistic arguments that explain the database search problem are outlined in detail. The resulting Bayesian networks offer a distinct view on the main debated issues, along with further clarity.

Methods: As a general framework for representing and analyzing formal arguments in probabilistic reasoning about uncertain target propositions (that is, whether or not a given individual is the source of a crime stain), this paper relies on graphical probability models, in particular, Bayesian networks. This graphical probability modeling approach is used to capture, within a single model, a series of key variables, such as the number of individuals in a database, the size of the population of potential crime stain sources, and the rarity of the corresponding analytical characteristics in a relevant population.

Results: This paper demonstrates the feasibility of deriving Bayesian network structures for analyzing, representing, and tracking the database search problem. The output of the proposed models can be shown to agree with existing but exclusively formulaic approaches.

Conclusions: The proposed Bayesian networks allow one to capture and analyze the currently most well-supported but reputedly counter-intuitive and difficult solution to the database search problem in a way that goes beyond the traditional, purely formulaic expressions. The method's graphical environment, along with its computational and probabilistic architectures, represents a rich package that offers analysts and discussants with additional modes of interaction, concise representation, and coherent communication.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信
小红书