Europe
Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving
Lopez-Ortiz, A., Angelopoulos, S., Hamel, A. M.
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then complete its execution within the allotted time. An interruptible algorithm, in contrast, can be interrupted at an arbitrary point in time, at which point it must report its currently best solution. It is known that contract algorithms can simulate interruptible algorithms using iterative deepening techniques. This simulation is done at a penalty in the performance of the solution, as measured by the so-called acceleration ratio. In this paper we give matching (i.e., optimal) upper and lower bounds for the acceleration ratio under such a simulation. We assume the most general setting in which n problem instances must be solved by means of scheduling executions of contract algorithms in $m$ identical parallel processors. This resolves an open conjecture of Bernstein, Filkenstein, and Zilberstein who gave an optimal schedule under the restricted setting of round robin and length-increasing schedules, but whose optimality in the general unrestricted case remained open. Lastly, we show how to evaluate the average acceleration ratio of the class of exponential strategies in the setting of n problem instances and m parallel processors. This is a broad class of schedules that tend to be either optimal or near-optimal, for several variants of the basic problem.
Testing Pre-Annotation to Help Non-Experts Identify Drug-Drug Interactions Mentioned in Drug Product Labeling
Hernandez, Andres M. (University of Pittsburgh) | Hochheiser, Harry S. (University of Pittsburgh) | Horn, John R. (University of Washington) | Crowley, Rebecca S. (University of Pittsburgh) | Boyce, Richard D. (University of Pittsburgh)
In this study, a system for allowing combination of textmining and crowdsourcing of annotation approaches for detection of DDIs from drug package inserts is presented. An annotation study was designed to evaluate expert versus non-expert curation performance, and the impact of NLP pre-annotation on precision and recall on both groups. The design and development of the system and annotation study, consisted of three stages. First, our existing NLP pipeline for DDI extraction was improved, and it was used to preannotate 208 drug product labels with drug mentions and DDIs. Secondly, a DDI machine readable representation scheme was created using the Annotation Ontolgy. This model allowed us to load the NLP preannotated drug label sections into our plugin for human curation created using the Annotation tool DOMEO. Finally, the annotation study was performed along with usability questionnaires for collecting qualitative feedback. To our knowledge, this is the first study in comparing experts and non-experts for pharmacokinetic DDI annotation. Results showed lower performance on non-experts compared with expert annotation without the use of NLP,and an improvement of non-expert annotation performance using the NER module of the NLP assistance. Simplification of the workflow for NLP assisted annotation is necessary for scaling ourapproach.
Crowd-Training Machine Learning Systems for Human Rights Abuse Documentation
Aronson, Jay D. (Carnegie Mellon University)
In this talk, I will describe efforts being undertaken in a collaboration between human rights advocates and Social media and mobile phones with good cameras and computer scientists at Carnegie Mellon University to Internet access are dramatically changing the nature of develop tools, methods and algorithms that will make it human rights documentation, reporting and advocacy. Key to this process, and like YouTube, Live Leak, Vimeo, and Facebook every apropos of this session, is the development of mechanisms week. In Syria, more than 650,000 videos have been to enable "the crowd" (i.e., those individuals around the uploaded to social media sites since the conflict started world who care about human rights and have relevant three years ago. This trove of interest dies down or moves on to new issues or places. In presenting this relevant in the long-term, what is irrelevant to the project, I hope to get feedback from other participants in situation or repetitive, and what is patently false or the workshop on how to achieve this goal, particularly by misleading.
Crowdsourcing in Language Classes Can Help Natural Language Processing
Hladká, Barbora (Charles University) | Hana, Jirka (Charles University) | Lukšová, Ivana (Charles University)
One way of teaching grammar, namely morphology and syntax, is to visualize sentences as diagrams capturing relationships between words. Similarly, such relationships are captured in a more complex way in treebanks serving as key building stones in modern natural language processing. However, building them is very time consuming, thus we have been seeking for an alternative cheaper and faster way, like crowdsourcing. The purpose of our work is to explore possibility to get sentence diagrams produced by students and teachers. In our pilot study, the object language is Czech, where sentence diagrams are part of elementary school curriculum.
CrowdUtility: A Recommendation System for Crowdsourcing Platforms
Chander, Deepthi (Xerox Research Center India) | Bhattacharya, Sakyajit (Xerox Research Centre India) | Celis, Elisa (EPFL Lausanne) | Dasgupta, Koustuv (Xerox Research Centre India) | Karanam, Saraschandra (Xerox Research Centre India) | Rajan, Vaibhav (Xerox Research Centre India) | Gupta, Avantika (Xerox Research Centre India)
Crowd workers exhibit varying work patterns, expertise, and quality leading to wide variability in the performance of crowdsourcing platforms. The onus of choosing a suitable platform to post tasks is mostly with the requester, often leading to poor guarantees and unmet requirements due to the dynamism in performance of crowd platforms. Towards this end, we demonstrate CrowdUtility, a statistical modelling based tool for evaluating multiple crowdsourcing platforms and recommending a platform that best suits the requirements of the requester. CrowdUtility uses an online Multi-Armed Bandit framework, to schedule tasks while optimizing platform performance. We demonstrate an end-to end system starting from requirements specification, to platform recommendation, to real-time monitoring.
Groupsourcing: Problem Solving, Social Learning and Knowledge Discovery on Social Networks
Chamberlain, Jon (University of Essex)
Increasingly social networks are being used for citizen science, where members of the public contribute knowledge to scientific endeavours. Tasks can be presented and solved using human computation, termed groupsourcing, with users benefiting from community tuition and experts gaining knowledge from the crowd. This paper gives details of a prototype that utilises groupsourcing to solve image classification tasks, to support social learning and to facilitate knowledge discovery in the domain of marine biology.
Crowdsourcing the Extraction of Data Practices from Privacy Policies
Schaub, Florian (Carnegie Mellon University) | Breaux, Travis D (Carnegie Mellon University) | Sadeh, Norman (Carnegie Mellon University)
Website and mobile application privacy policies are intended to describe the system’s data practices. However, they are often written in non-standard formats and contain ambiguities that make it difficult for users to read and comprehend these documents. We propose a crowdsourcing approach to extract data practices from privacy policies to provide more concise and useable privacy notices to users and support the analysis of stated data practices. To that end, we designed a hierarchical task workflow for crowdsourcing the extraction of data practices from privacy policies. We discuss our workflow design and report preliminary results.
Post It or Not: Viewership Based Posting of Crowdsourced Tasks
Manohar, Pallavi (Xerox Research Centre India) | Chander, Deepthi (Xerox Research Centre India) | Celis, Elisa (Ecole Polytechnique Fédérale de Lausanne (EPFL)) | Dasgupta, Koustuv (Xerox Research Centre India) | Bhattacharya, Sakyajit (Xerox Research Centre India)
We propose an online scheduling algorithm for posting crowdsourcing tasks which maximizes a novel metric called task viewership. This metric is computed using stochastic model based on coverage process and it measures the likelihood that a task is viewed by multiple crowd workers, which is correlated to the likelihood that it will be selected and completed.
Adaptive Performance Optimization over Crowd Labor Channels
Karanam, Saraschandra (Xerox Research Centre-India) | Chander, Deepthi (Xerox Research Centre-India) | Celis, Elisa Laura (Ecole Polytechnique Federale de Lausanne (EPFL)) | Dasgupta, Koustuv (Xerox Research Centre-India) | Rajan, Vaibhav (Xerox Research Centre-India)
Behavior-Based Quality Assurance in Crowdsourcing Markets
Feldman, Michael (University of Zurich) | Bernstein, Abraham (University of Zurich)
Quality assurance in crowdsourcing markets has appeared to be an acute problem over the last years. We propose a quality control method inspired by Statistical Process Control (SPC), commonly used to control output quality in production processes and characterized by relying on time-series data. Behavioral traces of users may play a key role in evaluating the performance of work done on crowdsourcing platforms. Therefore, in our experiment we explore fifteen behavioral traces for their ability to recognize the drop in work quality. Preliminary results indicate that our method has a high potential for real-time detection and signaling a drop in work quality.