Playing GWAP with strategies - using ESP as an example Wen-Yuan Zhu CSIE, NTNU.

Slides:



Advertisements
Similar presentations
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
Advertisements

HUMAN COMPUTATION IN VISUALIZATION: USING PURPOSE DRIVEN GAMES FOR ROBUST EVALUATION OF VISUALIZATION ALGORITHMS VISUAL ANALYTICS AND IMAGING LAB DEPT.
SE 450 Software Processes & Product Metrics 1 Introduction to Quality Engineering.
Game Theoretic Aspect in Human Computation Presenter: Chien-Ju Ho
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Modeling and Analysis of Random Walk Search Algorithms in P2P Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE, Rensselaer Polytechnic Institute.
Learning on Probabilistic Labels Peng Peng, Raymond Chi-wing Wong, Philip S. Yu CSE, HKUST 1.
Crowdsourcing 04/11/2013 Neelima Chavali ECE 6504.
DIMENSIONALITY REDUCTION BY RANDOM PROJECTION AND LATENT SEMANTIC INDEXING Jessica Lin and Dimitrios Gunopulos Ângelo Cardoso IST/UTL December
Tumolo’s Toolbox 7 Step Improvement Process.
Introduction to Quality Engineering
Semantic text features from small world graphs Jure Leskovec, IJS + CMU John Shawe-Taylor, Southampton.
Predicting the Semantic Orientation of Adjective Vasileios Hatzivassiloglou and Kathleen R. McKeown Presented By Yash Satsangi.
1 Optimization of ALINEA Ramp-metering Control Using Genetic Algorithm with Micro-simulation Lianyu Chu and Xu Yang California PATH ATMS Center University.
An Adaptive Multi-Objective Scheduling Selection Framework For Continuous Query Processing Timothy M. Sutherland Bradford Pielech Yali Zhu Luping Ding.
Lecture 10 Comparison and Evaluation of Alternative System Designs.
+ Doing More with Less : Student Modeling and Performance Prediction with Reduced Content Models Yun Huang, University of Pittsburgh Yanbo Xu, Carnegie.
Human Computation CSC4170 Web Intelligence and Social Computing Tutorial 7 Tutor: Tom Chao Zhou
Chapter 12: Simulation and Modeling Invitation to Computer Science, Java Version, Third Edition.
D ESIGNING G AMES WITH A P URPOSE By Luis von Ahn and Laura Dabbish.
1 Efficient Management of Data Center Resources for Massively Multiplayer Online Games V. Nae, A. Iosup, S. Podlipnig, R. Prodan, D. Epema, T. Fahringer,
The Context of Forest Management & Economics, Modeling Fundamentals Lecture 1 (03/30/2015)
Selective Sampling on Probabilistic Labels Peng Peng, Raymond Chi-Wing Wong CSE, HKUST 1.
Chapter 12: Simulation and Modeling
Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields Yong-Joong Kim Dept. of Computer Science Yonsei.
Crowdsourcing Game Development for Collecting Benchmark Data of Facial Expression Recognition Systems Department of Information and Learning Technology.
1 Hybrid methods for solving large-scale parameter estimation problems Carlos A. Quintero 1 Miguel Argáez 1 Hector Klie 2 Leticia Velázquez 1 Mary Wheeler.
I can remember basic ideas about a topic. Questions I can Answer -Who? -What? -When? -Where? -Why? -How? -What happened? -Which is True or False? Questions.
A Comparative Study of Search Result Diversification Methods Wei Zheng and Hui Fang University of Delaware, Newark DE 19716, USA
Human Computation & ESP Game 2008/12/19 Presenter: Lin, Sin-Yan 1.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
1 Near-Optimal Play in a Social Learning Game Ryan Carr, Eric Raboin, Austin Parker, and Dana Nau Department of Computer Science, University of Maryland.
1 The Games Economists Play: Interactive Public Policy Pennsylvania Capital Campus March 19, 2008 copies of this presentation can be found at
An Analytical Study of Puzzle Selection Strategies for the ESP Game Ling-Jyh Chen, Bo-Chun Wang, Kuan-Ta Chen Academia Sinica Irwin King, and Jimmy Lee.
Autonomic scheduling of tasks from data parallel patterns to CPU/GPU core mixes Published in: High Performance Computing and Simulation (HPCS), 2013 International.
LOGO Summarizing Conversations with Clue Words Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou (WWW ’07) Advisor : Dr. Koh Jia-Ling Speaker : Tu.
MINING COLOSSAL FREQUENT PATTERNS BY CORE PATTERN FUSION FEIDA ZHU, XIFENG YAN, JIAWEI HAN, PHILIP S. YU, HONG CHENG ICDE07 Advisor: Koh JiaLing Speaker:
An Analytical Approach to Optimizing The Utility of ESP Games Chien-Wei Lin, Kuan-Ta Chen, Ling-Jyh Chen Academia Sinica Irwin King, and Jimmy Lee The.
Evaluation of Recommender Systems Joonseok Lee Georgia Institute of Technology 2011/04/12 1.
Institute of Computing Technology, Chinese Academy of Sciences 1 A Unified Framework of Recommending Diverse and Relevant Queries Speaker: Xiaofei Zhu.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Evolving Reactive NPCs for the Real-Time Simulation Game.
Answering Top-k Queries Using Views Gautam Das (Univ. of Texas), Dimitrios Gunopulos (Univ. of California Riverside), Nick Koudas (Univ. of Toronto), Dimitris.
VIP: Finding Important People in Images Clint Solomon Mathialagan Andrew C. Gallagher Dhruv Batra CVPR
Node Reclamation and Replacement for Long-lived Sensor Networks Bin Tong, Wensheng Zhang, and Chuang Wang Department of Computer Science, Iowa State University.
Game AI Matthew Hsieh Meng Tran. Computer Games Many different genres  Action  Role Playing  Adventure  Strategy  Simulation  Sports  Racing Each.
Virtual Examples for Text Classification with Support Vector Machines Manabu Sassano Proceedings of the 2003 Conference on Emprical Methods in Natural.
Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.
Identifying “Best Bet” Web Search Results by Mining Past User Behavior Author: Eugene Agichtein, Zijian Zheng (Microsoft Research) Source: KDD2006 Reporter:
Doc.: IEEE /223r0 Submission July 2000 Taylor Salman, Opnet TechnologiesSlide 1 Project: IEEE P Working Group for Wireless Personal Area.
Optimization Techniques for Natural Resources SEFS 540 / ESRM 490 B Lecture 1 (3/30/2016)
Designing a framework For Recommender system Based on Interactive Evolutionary Computation Date : Mar 20 Sat, 2011 Project Number :
Modelling & Simulation of Semiconductor Devices Lecture 1 & 2 Introduction to Modelling & Simulation.
A Collaborative Quality Ranking Framework for Cloud Components
Chapter 12: Simulation and Modeling
Queensland University of Technology
PostGraduate Research Excellence Symposium (PGReS) 2015
Issues in Spoken Dialogue Systems
Class project by Piyush Ranjan Satapathy & Van Lepham
TT-Join: Efficient Set Containment Join
Optimization Techniques for Natural Resources SEFS 540 / ESRM 490 B
Martin Rajman, EPFL Switzerland & Martin Vesely, CERN Switzerland
Smart Learning concepts to enhance SMART Universities in Africa
Project collaborators’ names
Comparative Evaluation of SOM-Ward Clustering and Decision Tree for Conducting Customer-Portfolio Analysis By 1Oloyede Ayodele, 2Ogunlana Deborah, 1Adeyemi.
Motion-Aware Routing in Vehicular Ad-hoc Networks
Graph-based Security and Privacy Analytics via Collective Classification with Joint Weight Learning and Propagation Binghui Wang, Jinyuan Jia, and Neil.
Presentation transcript:

Playing GWAP with strategies - using ESP as an example Wen-Yuan Zhu CSIE, NTNU

Motivation “Games with a purpose” (GWAP) is an innovative concept in computer science There are a lot of GWAP systems has been created Research on enhancing GWAP systems is scarce

State of the art “Human Computation” represents a new paradigm of applications – Some problems solved by human, not computer “Games with a purpose” (GWAP) – created by Dr. Luis von Ahn (CMU) – the most popular application

Our Contribution We propose an evaluation metric for GWAP systems We study the inner properties of the ESP game using analysis We propose an “Optimal Puzzle Selection Algorithm” (OPSA)

Our Contribution (2) We implement a quasi ESP game, ESP Lite, to demonstrate our proposed algorithms We confirm GWAP systems are more efficient if they are designed and played with strategies

Outline Introduction Analysis Propose our algorithm Evaluation & Simulation Implementation Result Conclusion & Future work

Human Computation There is a lot of things that human can easy do that computers can not yet do – Speech recognition – Natural language understanding – Computer graphics

Games with a Purpose It combine computation with game People spend a lot of time playing games It makes Human Computation more efficient There are a lot of GWAP systems has been created (e.g. ESP game and Google Image Labeler)

What is the ESP game? AliceBob shoeflower rocks agreement on “flower”

What is the ESP game? (2) it is efficient – 200,000+ players have contributed 50+ million labels – each player plays for a total of 91 minutes – 233 labels/human/hour (i.e. one label every 15 seconds) Google bought a license to create its own version of the game in 2006

Outline Introduction Analysis Propose our algorithm Evaluation & Simulation Implementation Result Conclusion & Future work

Objectives 1.Design a metric to measure the performing of the ESP game 2.Design proper strategies to improve the ESP game 3.Validate the proposed strategies in real world systems

Observations The ESP game has two goals 1.Quantity : the system prefers to maximize the number of images which have been played 2.Quality : the system prefers to take as many labels as possible for each image There is a trade-off between the two goals

System metric average scores per labeled image # of labeled images # of labels per labeled image # of labels

Modeling(2)

Outline Introduction Analysis Propose our algorithm Evaluation & Simulation Implementation Result Conclusion & Future work

Puzzle Selection Algorithms Optimal Puzzle Selection Algorithm (OPSA) – select an image based on our analysis Random Puzzle Selection Algorithm (RPSA) – select a image by random Fresh-first Puzzle Selection Algorithm (FPSA) – select a image that has been played least frequently

OPSA The idea is there are optimal r labels per labeled image in system We group images into 3 sets – contains all the images that have not been played – contains all the images that have been played at least once, but less than r rounds –

OPSA (2)

Outline Introduction Analysis Propose our algorithm Evaluation & Simulation Implementation Result Conclusion & Future work

Simulation Setup – There are 100,000 images – Running 20 times simulation Observation – T vs. r → OPSA – T vs. System gain → 3 strategies Discussion

T vs. r

T vs. System Gain

Discussion OPSA is superior to RPSA & FPSA in the simulation A systematically & thorough study to verify the purposed strategies in real systems is highly desirable To this end, we decide to implement the ESP Lite system

Outline Introduction Analysis Propose our algorithm Evaluation & Simulation Implementation Result Conclusion & Future work

ESP Lite We implement ESP using Flash/Java It is a mimic ESP game It implemented three playing strategies – RPSA, FPSA, OPSA

Flow chart the strategy selection process gives priority to the strategy that has been used least in terms of the # of rounds played previously

Client interface

Client interface (2)

Score System The score system is used to measure the quality of the agreed words The quality of each the agreed word should depends on its popularity – high frequency → low quality → low score – low frequency → high quality → high score

Score System (2) i-th level of the w_i n words in the score table frequency of the word score of w_i reserved for agreed words which are not in score table

Score System (3) Apply the Porter Stemming Algorithm to remove common morphological and inflectional endings of English words – Prevent words with the same root, but receiving different scores (e.g. determinant and determine) – Reduce the plural form to the singular form (e.g. experiments and experiment)

Outline Introduction Analysis Propose our algorithm Evaluation & Simulation Implementation Result Conclusion & Future work

100,000 images from ESP dataset ESP dataset – 100,000 images – Average 15 labels per image collected from the ESP game Score system – – Range of score (10 levels) Experiment Setting

Experiment Setting (2) Score system (cont.) – The 5,000 most frequency words from Brown Corpus (a general corpus in the field of corpus linguistics) – Processed by Porter Stemming Algorithm – 3,476 words in score table

Experiment From 2009/3/9 to 2009/4/9 3,103 games 9,376 labeled pictures 12,312 agreements

Score Statistics

Behavior of OPSA

What happened in each round? Behavior of OPSA (2)

The operation of OPSA depend on r

Observe players’ behavior Behavior of OPSA (3)

Performance

Outline Introduction Analysis Propose our algorithm Evaluation & Simulation Implementation Result Conclusion & Future work

Conclusion In this thesis – We propose a metric to evaluate the performance of GWAP – We play GWAP systems with strategies and make GWAP systems more efficient

Conclusion (2) This is the first GWAP study that implements and evaluates an analytical model on real- world GWAP systems our experiment results confirm that GWAP systems are more efficient if they are designed and played with strategies

Future work Thinking about the time factor in analysis Thinking about adaptive r for each image Constructing the framework of GWAP systems Developing the GWAP portal for fast accessing more GWAP systems Developing the GWAP systems toward mobile environment

Thank You!