Name
Affiliation
Papers
REYNOLD CHENG
University of Hong Kong Hong Kong
183
Collaborators
Citations 
PageRank 
288
3069
154.13
Referers 
Referees 
References 
3676
3396
2746
Search Limit
1001000
Title
Citations
PageRank
Year
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection.00.342022
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery00.342022
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection.00.342022
Effective and Efficient Discovery of Top-k Meta Paths in Heterogeneous Information Networks00.342022
Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks00.342022
Finding Locally Densest Subgraphs: A Convex Programming Approach.00.342022
Fast augmentation algorithms for network kernel density visualization00.342021
On Analyzing Graphs with Motif-Paths.00.342021
Editorial Of Special Issue Of Wise 201900.342020
Integrating Domain Knowledge in AI-Assisted Criminal Sentencing of Drug Trafficking Cases.00.342020
M-Cypher: A GQL Framework Supporting Motifs00.342020
Traffic Incident Detection: A Trajectory-Based Approach10.392020
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs20.362020
SCODED: Statistical Constraint Oriented Data Error Detection10.352020
A Toolkit for Managing Multiple Crowdsourced Top-K Queries00.342020
Discovering Maximal Motif Cliques in Large Heterogeneous Information Networks20.392019
Efficient Algorithms for Densest Subgraph Discovery.00.342019
Efficient Algorithms for Densest Subgraph Discovery.90.472019
Exploring Communities in Large Profiled Graphs.10.352019
Detecting Data Errors with Statistical Constraints.00.342019
A Survey of Community Search Over Big Graphs.180.592019
On Spatial-Aware Community Search30.372019
Exploring Communities in Large Profiled Graphs (Extended Abstract)00.342019
Evaluating pattern matching queries for spatial databases.00.342019
An Efficient Framework for Correctness-Aware kNN Queries on Road Networks00.342019
Scalable Evaluation of k-NN Queries on Large Uncertain Graphs.00.342018
Entity-Based Query Recommendation for Long-Tail Queries.20.372018
STEM: a suffix tree-based method for web data records extraction00.342018
Entropy-Based Scheduling Policy for Cross Aggregate Ranking Workloads.00.342018
Efficient processing of shortest path queries in evolving graph sequences.10.372017
Efficient Pattern-Based Aggregation on Sequence Data00.342017
DOCS: Domain-Aware Crowdsourcing System.00.342017
Crowdsourced Data Management: Overview and Challenges.160.582017
Truth Inference in Crowdsourcing: Is the Problem Solved?751.672017
Truth Inference in Crowdsourcing: Is the Problem Solved?00.342017
Effective and efficient attributed community search.110.472017
Effective Community Search over Large Spatial Graphs.441.002017
C-Explorer: Browsing Communities in Large Graphs.00.342017
Effective Community Search for Large Attributed Graphs.541.172016
Fast and Semantic Measurements on Collaborative Tagging Quality.00.342016
Managing uncertainty of large spatial databases.00.342016
Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs60.462016
Meta Structure: Computing Relevance in Large Heterogeneous Information Networks421.072016
KB-Enabled Query Recommendation for Long-Tail Queries70.462016
Crowdsourced POI labelling: Location-aware result inference and Task Assignment290.742016
DOCS: Domain-Aware Crowdsourcing System.00.342016
Efficient Top-k Subscription Matching for Location-Aware Publish/Subscribe60.412015
Online Influence Maximization140.702015
Walking in the Cloud: Parallel SimRank at Scale.160.582015
On using broadcast index for efficient execution of shortest path continuous queries50.402015
  • 1
  • 2