Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3144457.3144458acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmobiquitousConference Proceedingsconference-collections
research-article

PIN: Potential Wise Crowd From Million Grassroots

Published: 07 November 2017 Publication History

Abstract

Crowdsourcing proves a viable approach to solve certain large-scale problems by posting tasks distributively to humans and harnessing their knowledge to get results effectively and efficiently. Unfortunately, crowdsourcing suffers from lack of available participants with domain knowledge or skills. In this paper, we propose potential wise crowd (i.e., a crowd with similarity and diversity in domain knowledge) find from million grassroots in social networks. We design and implement a distant-supervision framework to find potential crowdsourcers from existing social networks. A knowledge graph is used to assess the domain knowledge in terms of similarity and diversity. The wise crowd formation is a NP-hard problem and we propose greedy algorithms to approach it. Experimental results show the performance of our framework and algorithms in aspects of effectiveness and efficiency.

References

[1]
M. Vukovic, S. Kumara, and O. Greenshpan, "Ubiquitous crowdsourcing," in Ubicomp 2010. ACM, 2010, pp. 523--526.
[2]
J. Ren, Y. Zhang, K. Zhang, and X. Shen, "Exploiting mobile crowdsourcing for pervasive cloud services: challenges and solutions," Communications Magazine, IEEE, vol. 53, no. 3, pp. 98--105, 2015.
[3]
S. Reddy, D. Estrin, and M. Srivastava, "Recruitment framework for participatory sensing data collections," in Pervasive Computing. Springer, 2010, pp. 138--155.
[4]
H.-L. Yang and C.-Y. Lai, "Motivations of wikipedia content contributors," Computers in Human Behavior, vol. 26, no. 6, pp. 1377--1383, 2010.
[5]
A. Burnap, Y. Ren, R. Gerth, G. Papazoglou, R. Gonzalez, and P. Y. Papalambros, "When crowdsourcing fails: A study of expertise on crowdsourced design evaluation," Journal of Mechanical Design, vol. 137, no. 3, p. 031101, 2015.
[6]
P. G. Ipeirotis and P. K. Paritosh, "Managing crowdsourced human computation: a tutorial," in WWW 2011. ACM, 2011, pp. 287--288.
[7]
H. Yin, B. Cui, and Y. Huang, "Finding a wise group of experts in social networks," in ADMA 2011, 2011, pp. 381--394.
[8]
V. Plachouras, "Diversity in expert search," in Workshop on Diversity in Document Retrieval, 2011, pp. 63--67.
[9]
H. Gao, C. H. Liu, W. Wang, J. Zhao, Z. Song, X. Su, J. Crowcroft, and K. K. Leung, "A survey of incentive mechanisms for participatory sensing," IEEE Communications Surveys and Tutorials, vol. 17, no. 2, pp. 918--943, 2015.
[10]
K. Balog, L. Azzopardi, and M. de Rijke, "Formal models for expert finding in enterprise corpora," in SIGIR 2006, 2006, pp. 43--50.
[11]
J. Tang, L. Yao, D. Zhang, and J. Zhang, "A combination approach to web user profiling," TKDD, vol. 5, no. 1, p. 2, 2010.
[12]
A. Daud, J. Li, L. Zhou, and F. Muhammad, "Temporal expert finding through generalized time topic modeling," Knowledge-Based Systems, vol. 23, no. 6, pp. 615--625, 2010.
[13]
H. Deng, I. King, and M. R. Lyu, "Enhanced models for expertise retrieval using community-aware strategies," IEEE Trans. Systems, Man, and Cybernetics, Part B, vol. 42, no. 1, pp. 93--106, 2012.
[14]
I. Guy, U. Avraham, D. Carmel, S. Ur, M. Jacovi, and I. Ronen, "Mining expertise and interests from social media," in WWW 2013, 2013, pp. 515--526.
[15]
X. Quan, C. Kit, Y. Ge, and S. J. Pan, "Short and sparse text topic modeling via self-aggregation," in IJCAI 2015, 2015, pp. 2270--2276.
[16]
E. Smirnova, "A model for expert finding in social networks," in SIGIR 2011, 2011, pp. 1191--1192.
[17]
J. Zhang, J. Tang, and J. Li, "Expert finding in a social network," in DASFAA 2007, 2007, pp. 1066--1069.
[18]
P. Serdyukov, H. Rode, and D. Hiemstra, "Modeling multi-step relevance propagation for expert finding," in CIKM 2008, 2008, pp. 1133--1142.
[19]
A. Bozzon, M. Brambilla, S. Ceri, M. Silvestri, and G. Vesci, "Choosing the right crowd: expert finding in social networks," in EDBT 2013, 2013, pp. 637--648.
[20]
P. G. Ipeirotis and E. Gabrilovich, "Quizz: targeted crowdsourcing with a billion (potential) users," in WWW 2014, 2014, pp. 143--154.
[21]
S. Ghosh, N. K. Sharma, F. Benevenuto, N. Ganguly, and P. K. Gummadi, "Cognos: crowdsourcing search for topic experts in microblogs," in SIGIR 2012, 2012, pp. 575--590.
[22]
J. Kang and K. Lerman, "Leveraging user diversity to harvest knowledge on the social web," in PASSAT/SocialCom 2011, 2011, pp. 215--222.
[23]
H. Su, J. Tang, and W. Hong, "Learning to diversify expert finding with subtopics," in PAKDD 2012, 2012, pp. 330--341.
[24]
L. Robert and D. M. Romero, "Crowd size, diversity and performance," in CHI 2015, 2015, pp. 1379--1382.
[25]
C.-J. Ho and J. W. Vaughan, "Online task assignment in crowdsourcing markets." in AAAI 2012, vol. 12, 2012, pp. 45--51.
[26]
W. X. Zhao, J. Jiang, J. Weng, J. He, E. Lim, H. Yan, and X. Li, "Comparing twitter and traditional media using topic models," in ECIR 2011, 2011, pp. 338--349.
[27]
S. Alsubaiee, Y. Altowim, H. Altwaijry, A. Behm, V. Borkar, Y. Bu, M. Carey, I. Cetindil, M. Cheelangi, K. Faraaz et al., "Asterixdb: A scalable, open source bdms," Proceedings of the VLDB Endowment, vol. 7, no. 14, pp. 1905--1916, 2014.
[28]
A. El-Kishky, Y. Song, C. Wang, C. R. Voss, and J. Han, "Scalable topical phrase mining from text corpora," PVLDB, vol. 8, no. 3, pp. 305--316, 2014.
[29]
X. Dong, E. Gabrilovich, G. Heitz, W. Horn, N. Lao, K. Murphy, T. Strohmann, S. Sun, and W. Zhang, "Knowledge vault: A web-scale approach to probabilistic knowledge fusion," in SIGKDD 2014. ACM, 2014, pp. 601--610.
[30]
J. Edmonds, "Submodular functions, matroids, and certain polyhedra," Combinatorial structures and their applications, pp. 69--87, 1970.
[31]
G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, "An analysis of approximations for maximizing submodular set functions - I," Math. Program., vol. 14, no. 1, pp. 265--294, 1978.

Cited By

View all
  • (2019)Multi-Attribute Crowdsourcing Task Assignment With Stability and SatisfactoryIEEE Access10.1109/ACCESS.2019.29410457(133351-133361)Online publication date: 2019

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
MobiQuitous 2017: Proceedings of the 14th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services
November 2017
555 pages
ISBN:9781450353687
DOI:10.1145/3144457
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 November 2017

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. crowd formation
  2. distant supervision
  3. mobile crowdsourcing
  4. mobile recruitment framework

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Funding Sources

Conference

MobiQuitous 2017
MobiQuitous 2017: Computing, Networking and Services
November 7 - 10, 2017
VIC, Melbourne, Australia

Acceptance Rates

Overall Acceptance Rate 26 of 87 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 09 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2019)Multi-Attribute Crowdsourcing Task Assignment With Stability and SatisfactoryIEEE Access10.1109/ACCESS.2019.29410457(133351-133361)Online publication date: 2019

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media