首页> 外文会议>IEEE International Conference on Data Engineering >Using Markov Chain Monte Carlo to play Trivia
【24h】

Using Markov Chain Monte Carlo to play Trivia

机译:使用马尔可夫链蒙特卡洛戏剧琐事

获取原文

摘要

We introduce in this Demonstration a system called Trivia Masster that generates a very large Database of facts in a variety of topics, and uses it for question answering. The facts are collected from human users (the “crowd”); the system motivates users to contribute to the Database by using a Trivia Game, where users gain points based on their contribution. A key challenge here is to provide a suitable Data Cleaning mechanism that allows to identify which of the facts (answers to Trivia questions) submitted by users are indeed correct / reliable, and consequently how many points to grant users, how to answer questions based on the collected data, and which questions to present to the Trivia players, in order to improve the data quality. As no existing single Data Cleaning technique provides a satisfactory solution to this challenge, we propose here a novel approach, based on a declarative framework for defining recursive and probabilistic Data Cleaning rules. Our solution employs an algorithm that is based on Markov Chain Monte Carlo Algorithms.
机译:我们在这次演示中介绍了一个名为Trivia粉碎机构的系统,它在各种主题中生成了一个非常大的事实数据库,并使用它进行问题应答。事实是从人类用户收集的(“人群”);系统激励用户通过使用琐事游戏来贡献数据库,用户基于其贡献获得点数。这里的一个关键挑战是提供一种合适的数据清理机制,允许用户提交的哪些事实(琐事问题的答案)确实是正确的/可靠的,因此授予用户的点数有多少点,如何基于的问题来回答问题收集的数据,以及哪些问题到琐事播放器,以提高数据质量。由于没有现有的单数据清洁技术为这一挑战提供了令人满意的解决方案,我们在此提出了一种基于用于定义递归和概率数据清洁规则的声明性框架的新方法。我们的解决方案采用了一种基于Markov Chain Monte Carlo算法的算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号