Rui Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Rui Chen has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Benjamin C. M. Fung
School of Information Studies, McGill University, Montréal, Canada
2 shared publications - Byron Choi
Hong Kong Baptist University
2 shared publications - Haibo Hu
The Hong Kong Polytechnic University, Hong Kong, China
2 shared publications - Jianliang Xu
Hong Kong Baptist University
2 shared publications - Bairong Shen
Department of Respiratory and Critical Care Medicine and Institutes for Systems Genetics, Frontiers Science Center for Disease-related Molecular Network, West China Hospital, Sichuan University, Chengdu, China
1 shared publication - Bipin C. Desai
Concordia University, Montreal, Canada
1 shared publication
Latest Publications
- 3 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 27 (10) , 2729-2742
Geo-Social K-Cover Group Queries for Collaborative Spatial Computing
With the rapid development of location-aware mobile devices, ubiquitous Internet access and social computing technologies, lots of users' personal information, such as location data and social data, has been readily accessible from various mobile platforms and online social networks. The convergence of these two types of data, known as geo-social data, has enabled collaborative spatial computing that explicitly combines both location and social factors to answer useful geo-social queries for either business or social good. In this paper, we study a new type of Geo-Social K-Cover Group (GSKCG) queries that, given a set of query points and a social network, retrieves a minimum user group in which each user is socially related to at least k other users and the users' associated regions (e.g., familiar regions or service regions) can jointly cover all the query points. Albeit its practical usefulness, the GSKCG query problem is NP-complete. We consequently explore a set of effective pruning strategies to derive an efficient algorithm for finding the optimal solution. Moreover, we design a novel index structure tailored to our problem to further accelerate query processing. Extensive experiments demonstrate that our algorithm achieves desirable performance on real-life datasets.
- 3 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 27 (10) , 2729-2742
Geo-Social K-Cover Group Queries for Collaborative Spatial Computing
With the rapid development of location-aware mobile devices, ubiquitous Internet access and social computing technologies, lots of users' personal information, such as location data and social data, has been readily accessible from various mobile platforms and online social networks. The convergence of these two types of data, known as geo-social data, has enabled collaborative spatial computing that explicitly combines both location and social factors to answer useful geo-social queries for either business or social good. In this paper, we study a new type of Geo-Social K-Cover Group (GSKCG) queries that, given a set of query points and a social network, retrieves a minimum user group in which each user is socially related to at least k other users and the users' associated regions (e.g., familiar regions or service regions) can jointly cover all the query points. Albeit its practical usefulness, the GSKCG query problem is NP-complete. We consequently explore a set of effective pruning strategies to derive an efficient algorithm for finding the optimal solution. Moreover, we design a novel index structure tailored to our problem to further accelerate query processing. Extensive experiments demonstrate that our algorithm achieves desirable performance on real-life datasets.
- 1 August 2014
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 50, 107-121
Quantifying the costs and benefits of privacy-preserving health data publishing
- 1 August 2014
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 50, 107-121
Quantifying the costs and benefits of privacy-preserving health data publishing
- 1 August 2014
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 50, 122-132
A private DNA motif finding algorithm
- 1 August 2014
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 50, 122-132
A private DNA motif finding algorithm
- Open Access
- 1 January 2014
- Published by SAGE Publications in Cancer Informatics
- Vol. 13s1, CIN.S19243-8
Computational Advances in Cancer Informatics (A)
Subscription and open access journals from SAGE Publishing, the world's leading independent academic publisher.
- 1 January 2014
- Published by SAGE Publications in Cancer Informatics
- Vol. 13s1, CIN.S19243-8
Open AccessComputational Advances in Cancer Informatics (A)
Subscription and open access journals from SAGE Publishing, the world's leading independent academic publisher.
- 15 November 2013
- Published by Springer Nature in The VLDB Journal
- Vol. 23 (4) , 653-676
Correlated network data publication via differential privacy
- 15 November 2013
- Published by Springer Nature in The VLDB Journal
- Vol. 23 (4) , 653-676
Correlated network data publication via differential privacy