skip to main content
research-article

Discovering Best Teams for Data Leak-Aware Crowdsourcing in Social Networks

Authors Info & Claims
Published:08 February 2016Publication History
Skip Abstract Section

Abstract

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 “trade secret,” 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 SocialCrowd. 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 “best” 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.

References

  1. Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis, and Stefano Leonardi. 2012. Online team formation in social networks. In WWW. 839--848. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Ankur Bansal, Tingting Chen, and Sheng Zhong. 2011. Privacy preserving Back-propagation neural network learning over arbitrarily partitioned data. Neural Computing and Applications 20, 1 (2011), 143--150. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Stefano Bistarelli. 2004. Semirings for Soft Constraint Solving and Programming. Lecture Notes in Computer Science, Vol. 2962. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Stefano Bistarelli, Ugo Montanari, and Francesca Rossi. 1995. Constraint solving over semirings. In IJCAI (1). 624--630. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Stefano Bistarelli, Ugo Montanari, and Francesca Rossi. 1997. Semiring-based constraint satisfaction and optimization. J. ACM 44, 2 (1997), 201--236. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Daren C. Brabham. 2008. Crowdsourcing as a model for problem solving an introduction and cases. Convergence 14, 1 (2008), 75--90.Google ScholarGoogle ScholarCross RefCross Ref
  8. Barbara Carminati, Elena Ferrari, and Andrea Perego. 2009. Enforcing access control in Web-based social networks. ACM Trans. Inf. Syst. Secur. 13, 1 (2009), 6:1--6:38. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Anirban Dasgupta and Arpita Ghosh. 2013. Crowdsourced judgement elicitation with endogenous proficiency. In WWW. 319--330. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Daniel Deutch, Ohad Greenshpan, Boris Kostenko, and Tova Milo. 2011. Using Markov chain Monte Carlo to play trivia. In ICDE. 1308--1311. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Anhai Doan, Raghu Ramakrishnan, and Alon Y. Halevy. 2011. Crowdsourcing systems on the World-Wide Web. Commun. ACM 54, 4 (April 2011), 86--96. DOI:http://dx.doi.org/10.1145/1924421.1924442 Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Christoph Dorn, Florian Skopik, Daniel Schall, and Schahram Dustdar. 2011. Interaction mining and skill-dependent recommendations for multi-objective team composition. Data Knowl. Eng. 70, 10 (2011), 866--891. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Cynthia Dwork. 2008. Differential privacy: A survey of results. In Proceedings of the 5th International Conference on Theory and Applications of Models of Computation (TAMC’08). Springer-Verlag, Berlin, Heidelberg, 1--19. http://dl.acm.org/citation.cfm?id=1791834.1791836 Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Lujun Fang, Heedo Kim, Kristen LeFevre, and Aaron Tami. 2010. A privacy recommendation wizard for users of social networking sites. In ACM Conference on Computer and Communications Security. 630--632. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Michael J. Franklin, Donald Kossmann, Tim Kraska, Sukriti Ramesh, and Reynold Xin. 2011. CrowdDB: Answering queries with crowdsourcing. In SIGMOD Conference. 61--72. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Arpita Ghosh and R. Preston McAfee. 2012. Crowdsourcing with endogenous entry. In WWW. 999--1008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Amit Goyal, Wei Lu, and Laks V. S. Lakshmanan. 2011. CELF++: Optimizing the greedy algorithm for influence maximization in social networks. In Proceedings of the 20th International Conference on World Wide Web (WWW’11). 47--48. DOI:http://dx.doi.org/10.1145/1963192.1963217 Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Michael Hay, Chao Li, Gerome Miklau, and David Jensen. 2009. Accurate estimation of the degree distribution of private networks. In ICDM. 169--178. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Michael Hay, Chao Li, Vibhor Rastogi, Gerome Miklau, and Andrew McGregor. 2010. Optimizing linear counting queries under differential privacy. In PODS. 123--134. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. James Hendler and Jennifer Golbeck. 2008. Metcalfe’s law, Web 2.0, and the semantic web. Web Semant. 6, 1 (Feb. 2008), 14--20. DOI:http://dx.doi.org/10.1016/j.websem.2007.11.008 Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Olle Hoggstrom. 2000. Finite markov chains and algorithmic applications. In London Mathematical Society Student Texts. Cambridge University Press.Google ScholarGoogle Scholar
  22. Panagiotis G. Ipeirotis. 2010. Analyzing the Amazon Mechanical Turk marketplace. ACM Crossroads 17, 2 (2010), 16--21. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Haim Kaplan, Ilia Lotosh, Tova Milo, and Slava Novgorodov. 2013. Answering planning queries with the crowd. PVLDB 6, 9 (2013), 697--708. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Martin H. C. Law, Alexander P. Topchy, and Anil K. Jain. 2004. Clustering with soft and group constraints. In SSPR/SPR. 662--670.Google ScholarGoogle Scholar
  25. 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.Google ScholarGoogle Scholar
  26. 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’12).Google ScholarGoogle Scholar
  27. Hyunjung Park, Hector Garcia-Molina, Richard Pang, Neoklis Polyzotis, Aditya Parameswaran, and Jennifer Widom. 2012. Deco: A system for declarative crowdsourcing. Proc. VLDB Endow. 5, 12 (Aug. 2012), 1990--1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. 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.Google ScholarGoogle Scholar
  29. Nilothpal Talukder, Mourad Ouzzani, Ahmed K. Elmagarmid, Hazem Elmeleegy, and Mohamed Yakout. 2010. Privometer: Privacy protection in social networks. In ICDE Workshops. 266--269.Google ScholarGoogle ScholarCross RefCross Ref
  30. Yuzhe Tang, Ting Wang, Ling Liu, Shicong Meng, and Balaji Palanisamy. 2011. Privacy preserving indexing for eHealth information networks. In CIKM, Craig Macdonald, Iadh Ounis, and Ian Ruthven (Eds.). ACM, 905--914. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Jiannan Wang, Guoliang Li, Tim Kraska, Michael J. Franklin, and JiaFeng. 2013. Leveraging transitive relations for crowdsourced joins. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’13). 229--240. DOI:http://dx.doi.org/10.1145/2463676.2465280 Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Ting Wang, Mudhakar Srivastsa, Dakshi Agrawal, and Ling Liu. 2011. Modeling data flow in socio-information networks: A risk estimation approach. In SACMAT. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Thomas Weise. 2009. Global Optimization Algorithms - Theory and Application.Google ScholarGoogle Scholar
  34. Rongjing Xiang, Jennifer Neville, and Monica Rogati. 2010. Modeling relationship strength in online social networks. In WWW. 981--990. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Discovering Best Teams for Data Leak-Aware Crowdsourcing in Social Networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on the Web
      ACM Transactions on the Web  Volume 10, Issue 1
      February 2016
      198 pages
      ISSN:1559-1131
      EISSN:1559-114X
      DOI:10.1145/2870642
      Issue’s Table of Contents

      Copyright © 2016 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 8 February 2016
      • Accepted: 1 August 2015
      • Revised: 1 May 2015
      • Received: 1 January 2014
      Published in tweb Volume 10, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!