Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Selective sampling of labelers for approximating the crowd
Date
2012-11-05
Author
Ertekin Bolelli, Şeyda
Rudin, Cynthia
Metadata
Show full item record
Item Usage Stats
142
views
0
downloads
Cite This
In this paper, we present CrowdSense, an algorithm for estimating the crowd’s majority opinion by querying only a subset of it. CrowdSense works in an online fashion where examples come one at a time and it dynamically samples subsets of labelers based on an exploration/exploitation criterion. The algorithm produces a weighted combination of a subset of the labelers’ votes that approximates the crowd’s opinion. We also present two probabilistic variants of CrowdSense that are based on different assumptions on the joint probability distribution between the labelers’ votes and the majority vote. Our experiments demonstrate that we can reliably approximate the entire crowd’s vote by collecting opinions from a representative subset of the crowd.
Subject Keywords
Crowdsourcing
,
Wisdom of crowds
,
Labeler quality estimation
,
Approximating the crowd
,
Aggregating the opinions
URI
https://www.aaai.org/ocs/index.php/FSS/FSS12/paper/view/5596
https://hdl.handle.net/11511/87375
https://www.scopus.com/record/display.uri?eid=2-s2.0-84875587840&origin=resultslist&sort=plf-f&src=s&st1=&st2=&sid=3737d5751df2767d801d254a036d826a&sot=b&sdt=b&sl=74&s=TITLE-ABS-KEY+%28Selective+sampling+of+labelers+for+approximating+the+crowd%29&relpos=0&citeCnt=1&searchTerm=
Conference Name
2012 AAAI Fall Symposium
Collections
Department of Computer Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Crowd Multi Prediction: Single Network for Crowd Counting, Localization and Anomaly Detection
Coskun, Muhammet Furkan; Akar, Gözde (2023-01-01)
In this study, we propose a neural network to solve crowd counting, localization and abnormal event detection problems together. Our proposed model combines P2P-Net with a novel crowd anomaly detection module. The final network has a single backbone and multiple head structure. Synthetic datasets are used for training and evaluation. Results show that our model gets high accuracy in crowd anomaly detection task.
Shape similarity measurement for boundary based features
Arica, N; Yarman Vural, Fatoş Tunay (2005-01-01)
In this study, we propose two algorithms for measuring the distance between shape boundaries. In the algorithms, shape boundary is represented by the Beam Angle Statistics (BAS), which maps 2-D shape information into a set of 1-D functions. Firstly, we adopt Dynamic Time Warping method to develop an efficient distance calculation scheme, which is consistent with the human visual system in perceiving shape similarity. Since the starting point of the representations may differ in shapes, the best corresponden...
Statistical characteristics of Harris corner detector
Orguner, Umut (2007-08-29)
In this study, a method is proposed to calculate the bias and mean square error matrix of Harris detector calculated corners. The main result is presented in a theorem and the performance of the algorithm is shown on an example.
Consensus clustering of time series data
Yetere Kurşun, Ayça; Batmaz, İnci; İyigün, Cem; Department of Scientific Computing (2014)
In this study, we aim to develop a methodology that merges Dynamic Time Warping (DTW) and consensus clustering in a single algorithm. Mostly used time series distance measures require data to be of the same length and measure the distance between time series data mostly depends on the similarity of each coinciding data pair in time. DTW is a relatively new measure used to compare two time dependent sequences which may be out of phase or may not have the same lengths or frequencies. DTW aligns two time serie...
Inverse design of compressor cascades
Kaplan, B.; Eyi, Sinan (2001-12-01)
In this paper an inverse design method is presented which couples a Navier-Stokes flow solver and a numerical optimization algorithm. The design method generates a compressor cascade, producing a specified surface pressure distribution at a transonic speed. A least-square optimization technique is used to minimize pressure discrepancies between the target and designed cascades. In order to represent the nonlinear, rotational and viscous physics of transonic flows, Navier-Stokes equations are used to predict...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Ş. Ertekin Bolelli and C. Rudin, “Selective sampling of labelers for approximating the crowd,” Arlington, VA; United States, 2012, p. 7, Accessed: 00, 2021. [Online]. Available: https://www.aaai.org/ocs/index.php/FSS/FSS12/paper/view/5596.