MLMengchi Liu
Mengchi Liu
*This is an algorithmically generated author record based on publicly available information.
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
Research Subjects
Mengchi Liu has a total of 66 co-authors. Here are the top co-authors by number of shared publications:
- Ming Zhong
Wuhan University
7 shared publications - Tieyun Qian
Wuhan University
6 shared publications - Yuanyuan Zhu
Wuhan University
6 shared publications - Jeffrey Xu Yu
The Chinese University of Hong Kong, Hong Kong, China
5 shared publications - Jiamei Feng
South China Normal University
2 shared publications Junyong Yang
2 shared publications
Latest Publications
- 26 September 2026
- Published by Springer Nature
- p. 266-281
HBCGNN: An Inductive GNN Framework for Predicting Historical Betweenness Centrality in Temporal Graphs
- 26 September 2026
- Published by Springer Nature
- p. 266-281
HBCGNN: An Inductive GNN Framework for Predicting Historical Betweenness Centrality in Temporal Graphs
- 26 September 2026
- Published by Springer Nature
- p. 511-526
Just a “Hop” to Efficient Query of Optimal Temporal Paths: A Novel Labeling Approach
- 26 September 2026
- Published by Springer Nature
- p. 511-526
Just a “Hop” to Efficient Query of Optimal Temporal Paths: A Novel Labeling Approach
- 1 January 2026
- Published by Springer Nature in World Wide Web
- Vol. 29 (3) , 25
Historical betweenness centrality and its computation
- 1 January 2026
- Published by Springer Nature in World Wide Web
- Vol. 29 (3) , 25
Historical betweenness centrality and its computation
- 13 November 2025
- Published by Springer Nature
- p. 266-273
GeoER: A Challenging Benchmark for Geometric Element Recognition
- 13 November 2025
- Published by Springer Nature
- p. 266-273
GeoER: A Challenging Benchmark for Geometric Element Recognition
- 17 May 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 252
GMSN: An efficient multi-scale feature extraction network for gait recognition
- 17 May 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 252
GMSN: An efficient multi-scale feature extraction network for gait recognition
- 1 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (4) , 1650-1666
Incremental Maximal Clique Enumeration for Hybrid Edge Changes in Large Dynamic Graphs
- 1 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (4) , 1650-1666
Incremental Maximal Clique Enumeration for Hybrid Edge Changes in Large Dynamic Graphs
- 3 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (7) , 2831-2845
A Unified and Scalable Algorithm Framework of User-Defined Temporal (k,X)-Core Query
Querying cohesive subgraphs on temporal graphs (e.g., social network, finance network, etc.) with various conditions has attracted intensive research interests recently. In this paper, we study a novel Temporal$(k,\mathcal {X})$ -Core Query (TXCQ) that extends a fundamental Temporal$k$ -Core Query (TCQ) proposed in our conference paper by optimizing or constraining an arbitrary metric$\mathcal {X}$ of$k$ -core, such as size, engagement, interaction frequency, time span, burstiness, periodicity, etc. Our objective is to address specific TXCQ instances with conditions on different$\mathcal {X}$ in a unified algorithm framework that guarantees scalability. For that, this journal paper proposes a taxonomy of measurement$\mathcal {X}(\cdot )$ and achieve our objective using a two-phase framework while$\mathcal {X}(\cdot )$ is time-insensitive or time-monotonic. Specifically, Phase 1 still leverages the query processing algorithm of TCQ to induce all distinct$k$ -cores during a given time range, and meanwhile locates the “time zones” in which the cores emerge. Then, Phase 2 conducts fast local search and$\mathcal {X}$ evaluation in each time zone with respect to the time insensitivity or monotonicity of$\mathcal {X}(\cdot )$ . By revealing two insightful concepts named tightest time interval and loosest time interval that bound time zones, the redundant core induction and unnecessary$\mathcal {X}$ evaluation in a zone can be reduced dramatically. Our experimental results demonstrate that TXCQ can be addressed as efficiently as TCQ, which achieves the latest state-of-the-art performance, by using a general algorithm framework that leaves$\mathcal {X}(\cdot )$ as a user-defined function.- 3 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (7) , 2831-2845
A Unified and Scalable Algorithm Framework of User-Defined Temporal (k,X)-Core Query
Querying cohesive subgraphs on temporal graphs (e.g., social network, finance network, etc.) with various conditions has attracted intensive research interests recently. In this paper, we study a novel Temporal$(k,\mathcal {X})$ -Core Query (TXCQ) that extends a fundamental Temporal$k$ -Core Query (TCQ) proposed in our conference paper by optimizing or constraining an arbitrary metric$\mathcal {X}$ of$k$ -core, such as size, engagement, interaction frequency, time span, burstiness, periodicity, etc. Our objective is to address specific TXCQ instances with conditions on different$\mathcal {X}$ in a unified algorithm framework that guarantees scalability. For that, this journal paper proposes a taxonomy of measurement$\mathcal {X}(\cdot )$ and achieve our objective using a two-phase framework while$\mathcal {X}(\cdot )$ is time-insensitive or time-monotonic. Specifically, Phase 1 still leverages the query processing algorithm of TCQ to induce all distinct$k$ -cores during a given time range, and meanwhile locates the “time zones” in which the cores emerge. Then, Phase 2 conducts fast local search and$\mathcal {X}$ evaluation in each time zone with respect to the time insensitivity or monotonicity of$\mathcal {X}(\cdot )$ . By revealing two insightful concepts named tightest time interval and loosest time interval that bound time zones, the redundant core induction and unnecessary$\mathcal {X}$ evaluation in a zone can be reduced dramatically. Our experimental results demonstrate that TXCQ can be addressed as efficiently as TCQ, which achieves the latest state-of-the-art performance, by using a general algorithm framework that leaves$\mathcal {X}(\cdot )$ as a user-defined function.- Open Access
A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
Querying cohesive subgraphs on temporal graphs (e.g., social network, finance network, etc.) with various conditions has attracted intensive research interests recently. In this paper, we study a novel Temporal $(k,\mathcal{X})$-Core Query (TXCQ) that extends a fundamental Temporal $k$-Core Query (TCQ) proposed in our conference paper by optimizing or constraining an arbitrary metric $\mathcal{X}$ of $k$-core, such as size, engagement, interaction frequency, time span, burstiness, periodicity, etc. Our objective is to address specific TXCQ instances with conditions on different $\mathcal{X}$ in a unified algorithm framework that guarantees scalability. For that, this journal paper proposes a taxonomy of measurement $\mathcal{X}(\cdot)$ and achieve our objective using a two-phase framework while $\mathcal{X}(\cdot)$ is time-insensitive or time-monotonic. Specifically, Phase 1 still leverages the query processing algorithm of TCQ to induce all distinct $k$-cores during a given time range, and meanwhile locates the ``time zones'' in which the cores emerge. Then, Phase 2 conducts fast local search and $\mathcal{X}$ evaluation in each time zone with respect to the time insensitivity or monotonicity of $\mathcal{X}(\cdot)$. By revealing two insightful concepts named tightest time interval and loosest time interval that bound time zones, the redundant core induction and unnecessary $\mathcal{X}$ evaluation in a zone can be reduced dramatically. Our experimental results demonstrate that TXCQ can be addressed as efficiently as TCQ, which achieves the latest state-of-the-art performance, by using a general algorithm framework that leaves $\mathcal{X}(\cdot)$ as a user-defined function.Open AccessA Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
Querying cohesive subgraphs on temporal graphs (e.g., social network, finance network, etc.) with various conditions has attracted intensive research interests recently. In this paper, we study a novel Temporal $(k,\mathcal{X})$-Core Query (TXCQ) that extends a fundamental Temporal $k$-Core Query (TCQ) proposed in our conference paper by optimizing or constraining an arbitrary metric $\mathcal{X}$ of $k$-core, such as size, engagement, interaction frequency, time span, burstiness, periodicity, etc. Our objective is to address specific TXCQ instances with conditions on different $\mathcal{X}$ in a unified algorithm framework that guarantees scalability. For that, this journal paper proposes a taxonomy of measurement $\mathcal{X}(\cdot)$ and achieve our objective using a two-phase framework while $\mathcal{X}(\cdot)$ is time-insensitive or time-monotonic. Specifically, Phase 1 still leverages the query processing algorithm of TCQ to induce all distinct $k$-cores during a given time range, and meanwhile locates the ``time zones'' in which the cores emerge. Then, Phase 2 conducts fast local search and $\mathcal{X}$ evaluation in each time zone with respect to the time insensitivity or monotonicity of $\mathcal{X}(\cdot)$. By revealing two insightful concepts named tightest time interval and loosest time interval that bound time zones, the redundant core induction and unnecessary $\mathcal{X}$ evaluation in a zone can be reduced dramatically. Our experimental results demonstrate that TXCQ can be addressed as efficiently as TCQ, which achieves the latest state-of-the-art performance, by using a general algorithm framework that leaves $\mathcal{X}(\cdot)$ as a user-defined function. - 5 November 2023
- Published by Springer Nature
- p. 155-167
A Novel Variational Autoencoder with Multi-position Latent Self-attention and Actor-Critic for Recommendation
- 5 November 2023
- Published by Springer Nature
- p. 155-167
A Novel Variational Autoencoder with Multi-position Latent Self-attention and Actor-Critic for Recommendation