Jieying She
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jieying She has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Yongxin Tong
School of Computer Science and Engineering, Beihang University, Beijing, China
3 shared publications - Lei Chen
HKUST, Hong Kong, Hong Kong
2 shared publications Caleb Chen Cao
The Hong Kong University of Science and Technology, Kowloon, Hong Kong SAR, PR China
1 shared publication- Dawei Gao
State Key Laboratory of Software Development Environment, School of Computer Science and Engineering, Beihang University, Beijing, China
1 shared publication - Ke Xu
Tsinghua University, Beijing, China
1 shared publication Lei Chen
The Hong Kong University of Science and Technology, Kowloon, Hong Kong SAR, PR China
1 shared publication
Latest Publications
- Open Access
- 25 March 2017
- Published by Springer Nature in Data Science and Engineering
- Vol. 2 (2) , 136-150
Top-k Team Recommendation and Its Variants in Spatial Crowdsourcing
- 25 March 2017
- Published by Springer Nature in Data Science and Engineering
- Vol. 2 (2) , 136-150
Open AccessTop-k Team Recommendation and Its Variants in Spatial Crowdsourcing
- 8 December 2015
- Published by Springer Nature in World Wide Web
- Vol. 19 (6) , 1151-1177
Bottleneck-aware arrangement over event-based social networks: the max-min approach
- 8 December 2015
- Published by Springer Nature in World Wide Web
- Vol. 19 (6) , 1151-1177
Bottleneck-aware arrangement over event-based social networks: the max-min approach
- 8 July 2015
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 30 (4) , 696-712
Mining Frequent Itemsets in Correlated Uncertain Databases
- 8 July 2015
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 30 (4) , 696-712
Mining Frequent Itemsets in Correlated Uncertain Databases
- Open Access
- 1 July 2012
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 5 (11) , 1495-1506
Whom to ask?
It is universal to see people obtain knowledge on micro-blog services by asking others decision making questions. In this paper, we study the Jury Selection Problem(JSP) by utilizing crowdsourcing for decision making tasks on micro-blog services. Specifically, the problem is to enroll a subset of crowd under a limited budget, whose aggregated wisdom via Majority Voting scheme has the lowest probability of drawing a wrong answer(Jury Error Rate-JER). Due to various individual error-rates of the crowd, the calculation of JER is non-trivial. Firstly, we explicitly state that JER is the probability when the number of wrong jurors is larger than half of the size of a jury. To avoid the exponentially increasing calculation of JER, we propose two efficient algorithms and an effective bounding technique. Furthermore, we study the Jury Selection Problem on two crowdsourcing models, one is for altruistic users(AltrM) and the other is for incentive-requiring users(PayM) who require extra payment when enrolled into a task. For the AltrM model, we prove the monotonicity of JER on individual error rate and propose an efficient exact algorithm for JSP. For the PayM model, we prove the NP-hardness of JSP on PayM and propose an efficient greedy-based heuristic algorithm. Finally, we conduct a series of experiments to investigate the traits of JSP, and validate the efficiency and effectiveness of our proposed algorithms on both synthetic and real micro-blog data.
- 1 July 2012
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 5 (11) , 1495-1506
Open AccessWhom to ask?
It is universal to see people obtain knowledge on micro-blog services by asking others decision making questions. In this paper, we study the Jury Selection Problem(JSP) by utilizing crowdsourcing for decision making tasks on micro-blog services. Specifically, the problem is to enroll a subset of crowd under a limited budget, whose aggregated wisdom via Majority Voting scheme has the lowest probability of drawing a wrong answer(Jury Error Rate-JER). Due to various individual error-rates of the crowd, the calculation of JER is non-trivial. Firstly, we explicitly state that JER is the probability when the number of wrong jurors is larger than half of the size of a jury. To avoid the exponentially increasing calculation of JER, we propose two efficient algorithms and an effective bounding technique. Furthermore, we study the Jury Selection Problem on two crowdsourcing models, one is for altruistic users(AltrM) and the other is for incentive-requiring users(PayM) who require extra payment when enrolled into a task. For the AltrM model, we prove the monotonicity of JER on individual error rate and propose an efficient exact algorithm for JSP. For the PayM model, we prove the NP-hardness of JSP on PayM and propose an efficient greedy-based heuristic algorithm. Finally, we conduct a series of experiments to investigate the traits of JSP, and validate the efficiency and effectiveness of our proposed algorithms on both synthetic and real micro-blog data.