{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T23:30:13Z","timestamp":1720999813634},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2017,11]]},"abstract":"<jats:p>&lt;u&gt;W&lt;\/u&gt;orker &lt;u&gt;R&lt;\/u&gt;ecommendation (WR) is one of the most important functions for crowdsourced Q&amp;A services. Specifically, given a set of tasks to be solved, WR recommends each task with a certain group of workers, whom are expected to give timely answers with high qualities. To address the WR problem, recent studies have introduced a number of recommendation approaches, which take advantage of workers' expertises or preferences towards different types of tasks. However, without a thorough consideration of workers' characters, such approaches will lead to either inadequate task fulfillment or inferior answer quality.<\/jats:p>\n          <jats:p>In this work, we propose the Triple-factor Aware Worker Recommendation framework, which collectively considers workers' expertises, preferences and activenesses to maximize the overall production of high quality answers. We construct the Latent Hierarchical Factorization Model, which is able to infer the tasks' underlying categories and workers' latent characters from the historical data; and we propose a novel parameter inference method, which only requires the processing of positive instances, giving rise to significantly higher time efficiency and better inference quality. What's more, the sampling-based recommendation algorithm is developed, such that the near optimal worker recommendation can be generated for a presented batch of tasks with considerably reduced time consumption. Comprehensive experiments have been carried out using both real and synthetic datasets, whose results verify the effectiveness and efficiency of our proposed methods.<\/jats:p>","DOI":"10.14778\/3157794.3157805","type":"journal-article","created":{"date-parts":[[2017,12,12]],"date-time":"2017-12-12T18:33:38Z","timestamp":1513103618000},"page":"380-392","source":"Crossref","is-referenced-by-count":5,"title":["Worker recommendation for crowdsourced Q&amp;A services"],"prefix":"10.14778","volume":"11","author":[{"given":"Zheng","family":"Liu","sequence":"first","affiliation":[{"name":"HKUST"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[{"name":"HKUST"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526717"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139013567"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733047"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794372"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0307752101"},{"key":"e_1_2_1_7_1","first-page":"65","volume-title":"NIPS","author":"Hazan E.","year":"2007","unstructured":"E. Hazan , A. Rakhlin , and P. L. Bartlett . Adaptive online gradient descent . In NIPS 2007 , pages 65 -- 72 . E. Hazan, A. Rakhlin, and P. L. Bartlett. Adaptive online gradient descent. In NIPS 2007, pages 65--72."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963772"},{"key":"e_1_2_1_9_1","first-page":"766","volume-title":"ICML","author":"Houlsby N.","year":"2014","unstructured":"N. Houlsby , J. M. Hern\u00e1ndez-Lobato , and Z. Ghahramani . Cold-start active learning with robust ordinal matrix factorization . In ICML 2014 , pages 766 -- 774 . N. Houlsby, J. M. Hern\u00e1ndez-Lobato, and Z. Ghahramani. Cold-start active learning with robust ordinal matrix factorization. In ICML 2014, pages 766--774."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424346"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883070"},{"key":"e_1_2_1_12_1","first-page":"121","volume-title":"NIPS","author":"Mcauliffe J. D.","year":"2008","unstructured":"J. D. Mcauliffe and D. M. Blei . Supervised topic models . In NIPS 2008 , pages 121 -- 128 . J. D. Mcauliffe and D. M. Blei. Supervised topic models. In NIPS 2008, pages 121--128."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.16"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/31027"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526942"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187980.2188202"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645736"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-85820-3_8"},{"key":"e_1_2_1_19_1","first-page":"1184","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Taddy M.","year":"2012","unstructured":"M. Taddy . On estimation and selection for topic models . In International Conference on Artificial Intelligence and Statistics , pages 1184 -- 1193 , 2012 . M. Taddy. On estimation and selection for topic models. In International Conference on Artificial Intelligence and Statistics, pages 1184--1193, 2012."},{"key":"e_1_2_1_20_1","first-page":"1385","volume-title":"NIPS","author":"Teh Y. W.","year":"2005","unstructured":"Y. W. Teh , M. I. Jordan , M. J. Beal , and D. M. Blei . Sharing clusters among related groups: Hierarchical dirichlet processes . In NIPS 2005 , pages 1385 -- 1392 . Y. W. Teh, M. I. Jordan, M. J. Beal, and D. M. Blei. Sharing clusters among related groups: Hierarchical dirichlet processes. In NIPS 2005, pages 1385--1392."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498228"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.92917"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020480"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783273"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1990.10474930"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454026"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505720"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1996889.1996934"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2356461"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498230"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025118"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749430"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398493"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68880-8_32"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0217-5"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3157794.3157805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:38:30Z","timestamp":1672220310000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3157794.3157805"}},"subtitle":["a triple-factor aware approach"],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["10.14778\/3157794.3157805"],"URL":"https:\/\/doi.org\/10.14778\/3157794.3157805","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}