{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:20:13Z","timestamp":1740169213896,"version":"3.37.3"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62006093"],"award-info":[{"award-number":["62006093"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Huai\u2019an Natural Science Research Plan Project","award":["HAB202058"],"award-info":[{"award-number":["HAB202058"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3072212","type":"journal-article","created":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T19:42:26Z","timestamp":1617997346000},"page":"57841-57850","source":"Crossref","is-referenced-by-count":2,"title":["<i>K<\/i>-Submodlar Function Based Incentive Mechanisms for Crowd Multi-Labeling"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6287-3021","authenticated-orcid":false,"given":"Jiajun","family":"Sun","sequence":"first","affiliation":[]},{"given":"Shuning","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Qingying","family":"Sun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3694-2246","authenticated-orcid":false,"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"Statistical decision making for optimal budget allocation in crowd labeling","volume":"16","author":"chen","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref11","first-page":"1055","article-title":"On bisubmodular maximization","author":"singh","year":"2012","journal-title":"Proc Artif Intell Statist"},{"key":"ref12","first-page":"47","article-title":"Maximizing K-submodular functions and beyond","volume":"12","author":"ward","year":"2014","journal-title":"ACM Trans Algorithms"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2017.01.003"},{"key":"ref14","first-page":"1205","article-title":"No-regret algorithms for online k-submodular maximization","author":"soma","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Statist"},{"key":"ref15","first-page":"1","article-title":"Streaming K-submodular maximization under noise subject to size constraint","author":"lan","year":"2020","journal-title":"Proc 37th Int Conf Mach Learn (ICML)"},{"key":"ref16","first-page":"2554","article-title":"Accurate integration of crowdsourced labels using workers&#x2019; self-reported confidence scores","author":"oyama","year":"2013","journal-title":"Proc 23rd Int Joint Conf Artif Intell"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.11.011"},{"key":"ref18","first-page":"1","article-title":"Crowdsourcing multi-label classification for taxonomy creation","author":"bragg","year":"2013","journal-title":"Proc 1st AAAI Conf Hum Comput Crowdsourcing (HCOMP)"},{"key":"ref19","article-title":"Regularized minimax conditional entropy for crowdsourcing","author":"zhou","year":"2015","journal-title":"arXiv 1503 07240"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3050755"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/ett.3997"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.seta.2020.100973"},{"key":"ref5","article-title":"Multi-agent actor-critic network-based incentive mechanism for mobile crowdsensing in industrial systems","author":"gu","year":"2020","journal-title":"IEEE Trans Ind Informat"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2680838"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218674"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3390\/s20092559"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.03.048"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2011.6069707"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2857766"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2749263"},{"key":"ref21","first-page":"694","article-title":"Monotone K-submodular function maximization with size constraints","author":"ohsaka","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.78"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.160"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218676"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09399431.pdf?arnumber=9399431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T11:31:49Z","timestamp":1643196709000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9399431\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3072212","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}