{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:54Z","timestamp":1750306494693,"version":"3.41.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2016,2,8]],"date-time":"2016-02-08T00:00:00Z","timestamp":1454889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Paris Sorbone Cites for the interdisciplinary projet IDV"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Web"],"published-print":{"date-parts":[[2016,2,17]]},"abstract":"<jats:p>\n            Crowdsourcing is emerging as a powerful paradigm to help perform a wide range of tedious tasks in various enterprise applications. As such applications become more complex, crowdsourcing systems often require the collaboration of several experts connected through professional\/social networks and organized in various teams. For instance, a well-known car manufacturer asked fans to contribute ideas for the kinds of technologies that should be incorporated into one of its cars. For that purpose, fans needed to collaborate and form teams competing with each others to come up with the best ideas. However, once teams are formed, each one would like to provide the best solution and treat that solution as a \u201ctrade secret,\u201d hence preventing any data leak to its competitors (i.e., the other teams). In this article, we propose a data leak--aware crowdsourcing system called\n            <jats:italic>SocialCrowd<\/jats:italic>\n            . We introduce a clustering algorithm that uses social relationships between crowd workers to discover all possible teams while avoiding interteam data leakage. We also define a ranking mechanism to select the \u201cbest\u201d team configurations. Our mechanism is based on the semiring approach defined in the area of soft constraints programming. Finally, we present experiments to assess the efficiency of the proposed approach.\n          <\/jats:p>","DOI":"10.1145\/2814573","type":"journal-article","created":{"date-parts":[[2016,2,8]],"date-time":"2016-02-08T22:37:07Z","timestamp":1454971027000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Discovering Best Teams for Data Leak-Aware Crowdsourcing in Social Networks"],"prefix":"10.1145","volume":"10","author":[{"given":"Iheb Ben","family":"Amor","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris Descartes, Sorbonne Paris Cit\u00e9, Paris, France"}]},{"given":"Salima","family":"Benbernou","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Descartes, Sorbonne Paris Cit\u00e9, Paris, France"}]},{"given":"Mourad","family":"Ouziri","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Descartes, Sorbonne Paris Cit\u00e9, Paris, France"}]},{"given":"Zaki","family":"Malik","sequence":"additional","affiliation":[{"name":"Wayne State University, Woodward Avenue Detroit, MI"}]},{"given":"Brahim","family":"Medjahed","sequence":"additional","affiliation":[{"name":"University of Michigan - Dearborn, MI"}]}],"member":"320","published-online":{"date-parts":[[2016,2,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187950"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-010-0346-z"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Mayank Bawa Roberto J. Bayardo  Jr. and Rakesh Agrawal. 2003. Privacy-preserving indexing of documents on the network. In VLDB (2004-01-06). 922--933.   Mayank Bawa Roberto J. Bayardo Jr. and Rakesh Agrawal. 2003. Privacy-preserving indexing of documents on the network. In VLDB (2004-01-06). 922--933.","DOI":"10.1016\/B978-012722442-8\/50086-0"},{"key":"e_1_2_1_4_1","series-title":"Lecture Notes in Computer Science","volume-title":"Semirings for Soft Constraint Solving and Programming","author":"Bistarelli Stefano","unstructured":"Stefano Bistarelli . 2004. Semirings for Soft Constraint Solving and Programming . Lecture Notes in Computer Science , Vol. 2962 . Springer . Stefano Bistarelli. 2004. Semirings for Soft Constraint Solving and Programming. Lecture Notes in Computer Science, Vol. 2962. Springer."},{"key":"e_1_2_1_5_1","unstructured":"Stefano Bistarelli Ugo Montanari and Francesca Rossi. 1995. Constraint solving over semirings. In IJCAI (1). 624--630.   Stefano Bistarelli Ugo Montanari and Francesca Rossi. 1995. Constraint solving over semirings. In IJCAI (1). 624--630."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/256303.256306"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1177\/1354856507084420"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1609956.1609962"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488417"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767941"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1924421.1924442"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.06.004"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1791834.1791836"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866378"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989331"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187970"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.11"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807104"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2007.11.008"},{"volume-title":"Finite markov chains and algorithmic applications","author":"Hoggstrom Olle","key":"e_1_2_1_21_1","unstructured":"Olle Hoggstrom . 2000. Finite markov chains and algorithmic applications . In London Mathematical Society Student Texts. Cambridge University Press . Olle Hoggstrom. 2000. Finite markov chains and algorithmic applications. In London Mathematical Society Student Texts. Cambridge University Press."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869086.1869094"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536360.2536369"},{"key":"e_1_2_1_24_1","volume-title":"Jain","author":"Law Martin H. C.","year":"2004","unstructured":"Martin H. C. Law , Alexander P. Topchy , and Anil K . Jain . 2004 . Clustering with soft and group constraints. In SSPR\/SPR. 662--670. Martin H. C. Law, Alexander P. Topchy, and Anil K. Jain. 2004. Clustering with soft and group constraints. In SSPR\/SPR. 662--670."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability","volume":"1","author":"MacQueen J.","year":"1967","unstructured":"J. MacQueen . 1967 . Some methods for classification and analysis of multivariate observations . In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability , Vol. 1 . 14. J. MacQueen. 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1. 14."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 29th International Conference on Machine Learning (ICML\u201912)","author":"Palla Konstantina","year":"2012","unstructured":"Konstantina Palla , David A. Knowles , and Zoubin Ghahramani . 2012 . An infinite latent attribute model for network data . In Proceedings of the 29th International Conference on Machine Learning (ICML\u201912) . Konstantina Palla, David A. Knowles, and Zoubin Ghahramani. 2012. An infinite latent attribute model for network data. In Proceedings of the 29th International Conference on Machine Learning (ICML\u201912)."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367555"},{"key":"e_1_2_1_28_1","first-page":"108","article-title":"Towards social crowd environments using service-oriented architectures","volume":"53","author":"Skopik Florian","year":"2011","unstructured":"Florian Skopik , Daniel Schall , Harald Psaier , Martin Treiber , and Schahram Dustdar . 2011 . Towards social crowd environments using service-oriented architectures . IT - Inf. Technol. 53 , 3 (2011), 108 -- 116 . Florian Skopik, Daniel Schall, Harald Psaier, Martin Treiber, and Schahram Dustdar. 2011. Towards social crowd environments using service-oriented architectures. IT - Inf. Technol. 53, 3 (2011), 108--116.","journal-title":"IT - Inf. Technol."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2010.5452715"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063707"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465280"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998441.1998458"},{"key":"e_1_2_1_33_1","unstructured":"Thomas Weise. 2009. Global Optimization Algorithms - Theory and Application.  Thomas Weise. 2009. Global Optimization Algorithms - Theory and Application."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772790"}],"container-title":["ACM Transactions on the Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2814573","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2814573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:42Z","timestamp":1750225722000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2814573"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,8]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2,17]]}},"alternative-id":["10.1145\/2814573"],"URL":"https:\/\/doi.org\/10.1145\/2814573","relation":{},"ISSN":["1559-1131","1559-114X"],"issn-type":[{"type":"print","value":"1559-1131"},{"type":"electronic","value":"1559-114X"}],"subject":[],"published":{"date-parts":[[2016,2,8]]},"assertion":[{"value":"2014-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-02-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}