Publications | Reynold Cheng

Research

2022

1 Finding Locally Densest Subgraphs: A Convex-Programming Approach

Proc. VLDB Endow. 15(2022). Also in the Very Large Databases Conf. (VLDB 2022), Sydney, Australia, Sep 2022

C. Ma*, R. Cheng, L. Lakshmanan, and X. Han

2022

2 DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection

Proc. VLDB Endow. 15(2022). Also in the Very Large Databases Conf. (VLDB 2022), Sydney, Australia, Sep 2022

X. Han*, R. Cheng, T. Grubenmann, and C. Ma*

2022

3 A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery

ACM SIGMOD Conference 2022, June 2022, Philadelphia, PA, USA

C. Ma*, Y. Fang, R. Cheng, L. Lakshmanan, and X. Han

2022

4 Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks

In SIAM International Conference on Data Mining (SDM 2022), April 2022, Alexandria, Virginia, US

X. Lin*, R. Cheng, T. Grubenmann, S. Maniu, and C. Ma*

2021

5 On Directed Densest Subgraph Discovery

ACM Transactions on Database Systems (TODS), December 2021

C. Ma*, Y. Fang, R. Cheng, L. Lakshmanan, W. Zhang, and X. Lin.

2021

6 On Analyzing Graphs with Motif-Paths

Proc. VLDB Endow. 14(6): 1111-1123 (2021). Also in the Very Large Databases Conf. (VLDB 2021), Copenhagen, Aug 2021.

X. Li*, R. Cheng, K. C.-C. Chang, C. Shan*, C. Ma*, and H. Cao.

2021

7 Fast Augmentation Algorithms for Network Kernel Density Visualization

Proc. VLDB Endow.14(9): 1503-1516 (2021). Also in the Very Large Databases Conf. (VLDB 2021), Copenhagen, Aug 2021.

T. N. Chan*, Z. Li, L. H. U, J. Xu, and R. Cheng.

2020

8 GLAD: A Grid and Labelling Framework with Scheduling for Conflict-Aware kNN Queries

In the Transactions on Knowledge and Data Engineering (IEEE TKDE), 33(4): 1554-1566 (2021).

D. He, S. Wang, X. Zhou, and R. Cheng.

2020

9 Effective and Efficient Discovery of Top-k Meta Paths in Heterogeneous Information Networks

Accepted in the Transactions on Knowledge and Data Engineering (IEEE TKDE) Nov, 2020.

Z. Zhu*, T. N. Chan*, R. Cheng, L. Do*, Z. Huang, and H. Zhang.

2020

10 Efficient Algorithms for Kernel Aggregation Queries

Accepted in the Transactions on Knowledge and Data Engineering (IEEE TKDE), Aug 2020.

T. N. Chan, L. H. U, R. Cheng, M. L. Yiu, and S. Mittal.

2020

11 LINC: A Motif Counting Algorithm for Uncertain Graphs

In the Proceedings of the VLDB Endowment (PVLDB), Sep 2019. Also in the Very Large Databases Conf. (VLDB 2020), Tokyo, Aug 2020.

C. Ma*, R. Cheng, L. Lakshmanan, T. Grubenmann, Y. Fang, and X. Li.

2019

12 A Crowdsourcing Framework for Collecting Tabular Data

IEEE Trans. Knowl. Data Eng. 32(11): 2060-2074 (2020).

C. Shan*, N. Mamoulis, G. Li, R. Cheng, Z. Huang*, and Y. Zheng*.

2020

13 QUAD: Quadratic-Bound-based Kernel Density Visualization

In the ACM SIGMOD Conf. (SIGMOD 2020), Portland, OR, USA, Jun 2020.

T. N. Chan*, R. Cheng, and M. L. Yiu.

2020

14 SCODED: Statistical Constraint Oriented Data Error Detection

In the ACM SIGMOD Conf. (SIGMOD 2020), Portland, OR, USA, Jun 2020.

J. Yan*, O. Schulte, M. Zhang, J. Wang, and R. Cheng.

2020

15 Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs

In the ACM SIGMOD Conf. (SIGMOD 2020), Portland, OR, USA, Jun 2020.

C. Ma*, Y. Fang, R. Cheng, L. Lakshmanan, W. Zhang, and X. Lin.

2020

16 An End-to-End Deep RL Framework for Task Arrangement in Crowdsourcing Platforms

In the 36th IEEE Intl. Conf. on Data Engineering (IEEE ICDE 2020), Dallas, Texas, Apr 2020.

C. Shan*, N. Mamoulis, R. Cheng, G. Li, X. Li, and Y.

2020

17 TSA: A Truthful Mechanism for Social Advertising

In the Web Search and Data Mining Conference (WSDM 2020), Houston, Texas, USA, Feb 2020.

T. Grubenmann*, R. Cheng, and L. Lakshmanan.

2019

18 Efficient Algorithms for Densest Subgraph Discovery

In Proceedings of the VLDB Endowment (PVLDB), 12(11), pp. 1719-1732, July 2019. Also in the Very Large Databases Conf. (VLDB 2019), Los Angeles, Aug 2019.

Y. Fang, K. Yu*, R. Cheng, L. Lakshmanan, and X. Lin.

2019

19 Exploring Communities in Large Profiled Graphs

In the Transactions on Knowledge and Data Engineering (IEEE TKDE), 31(8), pp. 1624-1629, 1 Aug, 2019.

Y. Chen*, Y. Fang, R. Cheng, Y. Li, X. Chen, and J. Zhang.

2019

19 A survey of community search over big graphs

In the Very Large Data Bases Journal (VLDBJ), Springer, first online: Jul 2019.

Y. Fang, X. Huang, L. Qin, Y. Zhang, W. Zhang, R. Cheng, and X. Lin.

2019

21 Discovering Motif Cliques in Large Heterogeneous Information Networks

In the 35th IEEE Intl. Conf. on Data Engineering (IEEE ICDE 2019), Macau SAR, China, Apr 2019.

J. Hu*, R. Cheng, K. C. C. Chang, A. Sankar, Y. Fang*, and B. Y. H. Lam.

2019

21 MPR – A partitioning-republication framework for multi-processing kNN Search on Road Networks.

In the 35th IEEE Intl. Conf. on Data Engineering (IEEE ICDE 2019), Macau SAR, China, Apr 2019.

S. Luo*, B. Kao, X. Wu, and R. Cheng.

2019

23 An Efficient Framework for Correctness-Aware k

In the 35th IEEE Intl. Conf. on Data Engineering (IEEE ICDE 2019), Macau SAR, China, Apr 2019.

D. He, S. Wang, X. Zhou, and R. Cheng.

2019

24 ROAM: A Fundamental Routing Query on Road Networks with Efficiency

In the Transactions on Knowledge and Data Engineering (IEEE TKDE), vol. 32, no. 8, pp. 1595-1609, 1 Aug. 2020, doi: 10.1109/TKDE.2019.2906188.

S. Luo*, R. Cheng, B. Kao, X. Xiao, S. Zhou, and J. Hu.

2018

25 Evaluating Top-k Meta Path Queries on Large Heterogeneous Information Networks

In the IEEE Intl. Conf. on Data Mining (IEEE ICDM 2018), Singapore, Nov, 2018, pp. 1470-1475. Acceptance rate: 20%.

Z. Zhu*, R. Cheng, L. Do*, Z. Huang*, and H. Zhang.

2018

26 Effective and Efficient Community Search over Large Directed Graphs

In the Transactions on Knowledge and Data Engineering (IEEE TKDE), Early Access, pp. 1-16, ISSN: 1041-4347, 4 Oct 2018.

Y. Fang*, Z. Wang, R. Cheng, H. Wang, and J. Hu*.

2018

27 Entity-Based Query Recommendation for Long-Tail Queries

In ACM Transactions on Knowledge Discovery from Data (TKDD), 12(6), no. 64, pp. 1-24, Aug 2018. Impact factor: 2.538, cited 3 times.

Z. Huang*, B. Cautis, R. Cheng, and Y. Zheng*, N. Mamoulis, and J. Yan.

2018

28 On Spatial-Aware Community Search

In the Transactions on Knowledge and Data Engineering (IEEE TKDE), 31(4), pp. 783-798, 8 Jun, 2018.

Y. Fang*, Z. Wang*, R. Cheng, X. Li*, S. Luo*, J. Hu*, and X. Chen.

2018

29 STEM: a suffix tree-based method for web data records extraction

In Knowledge and Information Systems (KAIS), 55(2), pp. 305-331, 2018.

Y. Fang*, X. Xie, X. Zhang, R. Cheng, and Z. Zhang.

2018

30 On Spatial Pattern Matching

In the 34th IEEE Intl. Conf. on Data Engineering (IEEE ICDE 2018), Paris, France, Apr 2018.

Y. Fang*, R. Cheng, G. Cong, N. Mamoulis, and Y. Li.

2018

31 T-Crowd: Effective Crowdsourcing for Tabula Data

In the 34th IEEE Intl. Conf. on Data Engineering (IEEE ICDE 2018), Paris, France, Apr 2018.

C. Shan*, N. Mamoulis, G. Li, R. Cheng, Z. Huang*, and Y. Zheng*.

2018

32 Scalable Evaluation of k-NN Queries on Large Uncertain Graphs

In the 21st Intl. Conf. on Extending Database Technology (EDBT 2018), Vienna, Austria, Mar 2018.

X. Li*, R. Cheng, Y. Fang*, J. Hu*, and S. Maniu.

2017

33 TOAIN: A Throughput Optimizing Adaptive Index for Answering Dynamic kNN Queries on Road Networks

In Proceedings of the VLDB Endowment (PVLDB), 11(5), pp. 594-606, Jan 2018. Also in the Very Large Databases Conf. (VLDB 2018), Rio De Janeiro, Brazil, Aug 27-31, 2018.

S. Luo*, B. Kao, G. Li, J. Hu*, R. Cheng, and Y. Zheng*.

2017

34 DOCS: Domain-Aware Crowdsourcing System

In PVLDB, Munich, Germany, Aug 28-Sep 1, 2017.

Yudian Zheng, Guoliang Li, and Reynold Cheng.

2017

35 An Indexing Framework for Queries on Probabilistic Graph

In ACM Transactions on Database Systems(TODS), 42(2), Jun 2017.

Silviu Maniu, Reynold Cheng, and Pierre Senellart.

2016

36 Effective Community Search for Large Attributed Graphs

In VLDB 2016, 9(12), pp. 1233 - 1244, New Delhi, August 2016.

Yixiang Fang, Reynold Cheng, Siqiang Luo, and Jiafeng Hu.

2016

37 Meta Structure: Computing Relevance in Large Heterogeneous Information Networks

In the 22nd ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining (KDD 2016), San Francisco, US, August 2016.

Zhipeng Huang, Yudian Zheng, Reynold Cheng, Yizhou Sun, Nikos Mamoulis, and Xiang Li.

2015

38 Online Influence Maximization

In the 21th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining (KDD 2015), Sydney, Australia, August 2015.

Siyu Lei, Silviu Maniu, Luyi Mo, Reynold Cheng, and Pierre Senellart.

2015

39 Discovering Meta-Paths in Large Heterogeneous Information Networks

In the 24th Intl. World Wide Web Conf. (WWW 2015), Florence, Italy, May 2015.[ Talk ]

Changping Meng, Reynold Cheng, Silviu Maniu, Pierre Senellart, and Wangda Zhang.

Note: A “*” before the author name means he/she is my postdoc. fellow, graduate student, or research assistant.

Research

Selected Publications

DBLP

Google Scholar

1

Finding Locally Densest Subgraphs: A Convex-Programming Approach

2

DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection

3

A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery

4

Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks

5

On Directed Densest Subgraph Discovery

6

On Analyzing Graphs with Motif-Paths

7

Fast Augmentation Algorithms for Network Kernel Density Visualization

8

GLAD: A Grid and Labelling Framework with Scheduling for Conflict-Aware kNN Queries

9

Effective and Efficient Discovery of Top-k Meta Paths in Heterogeneous Information Networks

10

Efficient Algorithms for Kernel Aggregation Queries

11

LINC: A Motif Counting Algorithm for Uncertain Graphs

12

A Crowdsourcing Framework for Collecting Tabular Data

13

QUAD: Quadratic-Bound-based Kernel Density Visualization

14

SCODED: Statistical Constraint Oriented Data Error Detection

15

Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs

16

An End-to-End Deep RL Framework for Task Arrangement in Crowdsourcing Platforms

17

TSA: A Truthful Mechanism for Social Advertising

18

Efficient Algorithms for Densest Subgraph Discovery

19

Exploring Communities in Large Profiled Graphs

19

A survey of community search over big graphs

21

Discovering Motif Cliques in Large Heterogeneous Information Networks

21

MPR – A partitioning-republication framework for multi-processing kNN Search on Road Networks.

23

An Efficient Framework for Correctness-Aware k

24

ROAM: A Fundamental Routing Query on Road Networks with Efficiency

25

Evaluating Top-k Meta Path Queries on Large Heterogeneous Information Networks

26

Effective and Efficient Community Search over Large Directed Graphs

27

Entity-Based Query Recommendation for Long-Tail Queries

28

On Spatial-Aware Community Search

29

STEM: a suffix tree-based method for web data records extraction

30

On Spatial Pattern Matching

31

T-Crowd: Effective Crowdsourcing for Tabula Data

32

Scalable Evaluation of k-NN Queries on Large Uncertain Graphs

33

TOAIN: A Throughput Optimizing Adaptive Index for Answering Dynamic kNN Queries on Road Networks

34

DOCS: Domain-Aware Crowdsourcing System

35

An Indexing Framework for Queries on Probabilistic Graph

36

Effective Community Search for Large Attributed Graphs

37

Meta Structure: Computing Relevance in Large Heterogeneous Information Networks

38

Online Influence Maximization