arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1606.01957cs.DB
收藏

基于分层群体管理的大规模、快速移动和噪声预测交互数据的可靠查询

Reliable Querying of Very Large, Fast Moving and Noisy Predicted Interaction Data using Hierarchical Crowd Curation

Hasan M. Jamil, Fereidoon Sadri

摘要:

大量预测和挖掘但不确定的生物数据表明,对大规模、高效和可扩展的策展工作有着巨大的需求。任何成功的策展企业所保证的人类专业知识通常在经济上是禁止的,特别是对于可能最终不会产生结果的推测性最终用户查询。因此,挑战仍然是设计一个低成本的引擎,能够提供一组数据项的快速但试探性的注释和管理,这些数据项可以由专家进行授权验证,随后需要非常小的投资。因此,目标是在策展继续进行的同时,尽可能早地提供大量预测数据,并对其准确性具有可接受的置信度。在本文中,我们提出了一种新的方法,使用人群计算的生物数据库内容的注释和策展。其技术贡献在于识别和管理机械土耳其人的信任,以及支持ad hoc声明式查询,这两者都被用来支持使用噪声预测交互的可靠分析。

英文摘要:

The abundance of predicted and mined but uncertain biological data show huge needs for massive, efficient and scalable curation efforts. The human expertise warranted by any successful curation enterprize is often economically prohibitive especially for speculative end user queries that may not ultimately bear fruit. So the challenge remains in devising a low cost engine capable of delivering fast but tentative annotation and curation of a set of data items that can be authoritatively validated by experts later demanding significantly small investment. The aim thus is to make a large volume of predicted data available for use as early as possible with an acceptable degree of confidence in their accuracy while the curation continues. In this paper, we present a novel approach to annotation and curation of biological database contents using crowd computing. The technical contribution is in the identification and management of trust of mechanical turks, and support for ad hoc declarative queries, both of which are leveraged to support reliable analytics using noisy predicted interactions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑