• DocumentCode
    3145400
  • Title

    Using Markov Chain Monte Carlo to play Trivia

  • Author

    Deutch, Daniel ; Greenshpan, Ohad ; Kostenko, Boris ; Milo, Tova

  • Author_Institution
    Tel-Aviv Univ., Tel-Aviv, Israel
  • fYear
    2011
  • fDate
    11-16 April 2011
  • Firstpage
    1308
  • Lastpage
    1311
  • Abstract
    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.
  • Keywords
    Markov processes; Monte Carlo methods; computer games; data analysis; probability; question answering (information retrieval); very large databases; Markov chain Monte Carlo; data cleaning mechanism; data quality improvement; probabilistic data cleaning rule; question answering; trivia game; trivia masster; very large database; Cleaning; Databases; Games; Markov processes; Monte Carlo methods; Probabilistic logic; Reliability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Engineering (ICDE), 2011 IEEE 27th International Conference on
  • Conference_Location
    Hannover
  • ISSN
    1063-6382
  • Print_ISBN
    978-1-4244-8959-6
  • Electronic_ISBN
    1063-6382
  • Type

    conf

  • DOI
    10.1109/ICDE.2011.5767941
  • Filename
    5767941