楼主: 何人来此
280 0

[计算机科学] 因果结构的时序逻辑 [推广有奖]

  • 0关注
  • 3粉丝

会员

学术权威

79%

还不是VIP/贵宾

-

威望
10
论坛币
10 个
通用积分
61.9534
学术水平
1 点
热心指数
6 点
信用等级
0 点
经验
24791 点
帖子
4194
精华
0
在线时间
0 小时
注册时间
2022-2-24
最后登录
2022-4-15

楼主
何人来此 在职认证  发表于 2022-4-15 11:45:00 来自手机 |只看作者 |坛友微信交流群|倒序 |AI写论文

+2 论坛币
k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群
赵安豆老师微信:zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

感谢您参与论坛问题回答

经管之家送您两个论坛币!

+2 论坛币
摘要翻译:
具有潜在因果结构的时程数据的计算分析在许多领域都是需要的,包括神经尖峰列车、股票价格运动和基因表达水平。然而,仅从数值时间过程数据来确定是什么协调了可见的过程,将潜在的表面原因分为真正的和虚假的原因,并以可行的计算复杂度来这样做是具有挑战性的。为此,我们一直在开发一种新的算法,该算法基于一个框架,该框架将哲学中的因果关系概念与基于模型检验和统计技术的算法方法相结合,用于多假设测试。因果关系用时态逻辑公式描述,用模型检验的方法重构推理问题。所使用的逻辑,PCTL,允许描述因果之间的时间和这种关系被观察到的概率。通过多重假设检验(将每个因果关系视为假设)和错误发现控制的概念,我们可以计算一个原因对其结果的平均影响,从而发现统计上显著的原因。通过探索一个精心选择的具有合理最小描述长度的潜在所有重要假设族,在探索所有表面原因的几乎完全搜索空间的同时,有可能驯服算法的计算复杂性。我们已经在许多领域测试了这些想法,并在这里用两个例子来说明它们。
---
英文标题:
《The Temporal Logic of Causal Structures》
---
作者:
Samantha Kleinberg, Bud Mishra
---
最新提交年份:
2012
---
分类信息:

一级分类:Computer Science        计算机科学
二级分类:Artificial Intelligence        人工智能
分类描述:Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域,除了视觉、机器人、机器学习、多智能体系统以及计算和语言(自然语言处理),这些领域有独立的学科领域。特别地,包括专家系统,定理证明(尽管这可能与计算机科学中的逻辑重叠),知识表示,规划,和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要:
  Computational analysis of time-course data with an underlying causal structure is needed in a variety of domains, including neural spike trains, stock price movements, and gene expression levels. However, it can be challenging to determine from just the numerical time course data alone what is coordinating the visible processes, to separate the underlying prima facie causes into genuine and spurious causes and to do so with a feasible computational complexity. For this purpose, we have been developing a novel algorithm based on a framework that combines notions of causality in philosophy with algorithmic approaches built on model checking and statistical techniques for multiple hypotheses testing. The causal relationships are described in terms of temporal logic formulae, reframing the inference problem in terms of model checking. The logic used, PCTL, allows description of both the time between cause and effect and the probability of this relationship being observed. We show that equipped with these causal formulae with their associated probabilities we may compute the average impact a cause makes to its effect and then discover statistically significant causes through the concepts of multiple hypothesis testing (treating each causal relationship as a hypothesis), and false discovery control. By exploring a well-chosen family of potentially all significant hypotheses with reasonably minimal description length, it is possible to tame the algorithm's computational complexity while exploring the nearly complete search-space of all prima facie causes. We have tested these ideas in a number of domains and illustrate them here with two examples.
---
PDF链接:
https://arxiv.org/pdf/1205.2634
二维码

扫码加我 拉你入群

请注明:姓名-公司-职位

以便审核进群资格,未注明则拒绝

关键词:relationship Intelligence Coordinating Presentation Computation algorithm 因果关系 prima facie underlying

您需要登录后才可以回帖 登录 | 我要注册

本版微信群
加JingGuanBbs
拉您进交流群

京ICP备16021002-2号 京B2-20170662号 京公网安备 11010802022788号 论坛法律顾问:王进律师 知识产权保护声明   免责及隐私声明

GMT+8, 2024-6-25 16:14