{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/fast-dawid-skene-a-fast-vote-aggregation","title":"Fast Dawid-Skene: A Fast Vote Aggregation Scheme for Sentiment Classification","arxiv_id":"1803.02781","date":"2018-03-07","proceeding":null,"authors":["Vaibhav B Sinha","Sukrut Rao","Vineeth N. Balasubramanian"],"abstract":"Many real world problems can now be effectively solved using supervised\nmachine learning. A major roadblock is often the lack of an adequate quantity\nof labeled data for training. A possible solution is to assign the task of\nlabeling data to a crowd, and then infer the true label using aggregation\nmethods. A well-known approach for aggregation is the Dawid-Skene (DS)\nalgorithm, which is based on the principle of Expectation-Maximization (EM). We\npropose a new simple, yet effective, EM-based algorithm, which can be\ninterpreted as a `hard' version of DS, that allows much faster convergence\nwhile maintaining similar accuracy in aggregation. We show the use of this\nalgorithm as a quick and effective technique for online, real-time sentiment\nannotation. We also prove that our algorithm converges to the estimated labels\nat a linear rate. Our experiments on standard datasets show a significant\nspeedup in time taken for aggregation - upto $\\sim$8x over Dawid-Skene and\n$\\sim$6x over other fast EM methods, at competitive accuracy performance. The\ncode for the implementation of the algorithms can be found at\nhttps://github.com/GoodDeeds/Fast-Dawid-Skene","url_abs":"http://arxiv.org/abs/1803.02781v3","url_pdf":"http://arxiv.org/pdf/1803.02781v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"fast-dawid-skene-a-fast-vote-aggregation","repo_url":"https://github.com/sukrutrao/Fast-Dawid-Skene","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"fast-dawid-skene-a-fast-vote-aggregation","repo_url":"https://github.com/theonlyandreas/end-to-end-crowdsourcing","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"sentiment-analysis","task_name":"Sentiment Analysis"},{"task_slug":"sentiment-classification","task_name":"Sentiment Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1803.02781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.02781"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/sukrutrao/Fast-Dawid-Skene","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/theonlyandreas/end-to-end-crowdsourcing","reach":{"status":"ok"}}],"summary":{"ran_draft_wrong":1,"unverified":2},"by_repo_kind":{"official":{"samples":3,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"46ab6d3cb2317431","entry":"responses_to_counts","repo":"sukrutrao/Fast-Dawid-Skene","repo_kind":"official","path":"fast_dawid_skene/algorithms.py","file_url":"https://github.com/sukrutrao/Fast-Dawid-Skene/blob/HEAD/fast_dawid_skene/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"46ab6d3cb2317431"}},{"code_sha256_prefix":"c38f4d99943e145e","entry":"main","repo":"sukrutrao/Fast-Dawid-Skene","repo_kind":"official","path":"fast_dawid_skene/algorithms.py","file_url":"https://github.com/sukrutrao/Fast-Dawid-Skene/blob/HEAD/fast_dawid_skene/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c38f4d99943e145e"}},{"code_sha256_prefix":"c45f1641fbcac6ad","entry":"run","repo":"sukrutrao/Fast-Dawid-Skene","repo_kind":"official","path":"fast_dawid_skene/algorithms.py","file_url":"https://github.com/sukrutrao/Fast-Dawid-Skene/blob/HEAD/fast_dawid_skene/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c45f1641fbcac6ad"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}