Kaiyu Feng
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
Kaiyu Feng has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Gao Cong
Nanyang Technological University
4 shared publications - Dahee Kim
Ulsan National Institute of Science and Technology, Ulsan, Republic of Korea
3 shared publications - Jungeun Kim
Ulsan National Institute of Science and Technology, Ulsan, Republic of Korea
3 shared publications - Cheng Long
Nanyang technological university, Singapore, Singapore
2 shared publications - Lanting Fang
Beijing Institute of Technology, Beijing, China
2 shared publications - Tu Gu
Nanyang technological university, Singapore, Singapore
2 shared publications
Latest Publications
- Open Access
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (1) , 1-26
LMSC: Local Sketch Modularity Optimisation for Size-Constrained Community Search in Networks
With the proliferation of social networks, identifying meaningful community structures efficiently is essential for analysing complex interactions. This paper introduces Local Sketch Modularity (LSM), a novel modularity that measures community quality without relying on the entire structural information of the network, enabling a more targeted and practical approach to find the query-centric community. We validate the efficacy of the proposed modularity LSM through theoretical analyses, showing robustness against the free-rider effect. We further formulate the Local Modularity Optimisation for Size-Constrained Community Search (LMSC) problem, which leverages LSM to identify the query-centric community without requiring knowledge of the entire graph. We prove that LMSC is NP-hard and propose two efficient and effective algorithms. Extensive experiments on real-world networks demonstrate both the effectiveness and efficiency of the proposed method, confirming its applicability for large-scale network analysis.
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (1) , 1-26
Open AccessLMSC: Local Sketch Modularity Optimisation for Size-Constrained Community Search in Networks
With the proliferation of social networks, identifying meaningful community structures efficiently is essential for analysing complex interactions. This paper introduces Local Sketch Modularity (LSM), a novel modularity that measures community quality without relying on the entire structural information of the network, enabling a more targeted and practical approach to find the query-centric community. We validate the efficacy of the proposed modularity LSM through theoretical analyses, showing robustness against the free-rider effect. We further formulate the Local Modularity Optimisation for Size-Constrained Community Search (LMSC) problem, which leverages LSM to identify the query-centric community without requiring knowledge of the entire graph. We prove that LMSC is NP-hard and propose two efficient and effective algorithms. Extensive experiments on real-world networks demonstrate both the effectiveness and efficiency of the proposed method, confirming its applicability for large-scale network analysis.
- Open Access
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (6) , 1-27
Budgeted Strong Community Search in Heterogeneous Graphs
Community search in heterogeneous graphs is fundamental to applications such as expert team formation and scholarly collaboration. Many existing studies leverage meta-paths, which are sequences of node and edge types, to capture semantic relationships in heterogeneous graphs. However, most of them only consider the existence of meta-path instances, overlooking their frequency and thus failing to capture relationship strength. This limitation can result in communities that include nodes with numerous but weak relations. To capture the strength of relationships in heterogeneous graphs, we define the Strong Community (StrCom) model, which evaluates the strength between users based on the number of connecting meta-path instances. Building upon this model, we further propose the Budgeted Strong Community (BSC) problem by incorporating a size constraint. We provide theoretical analyses showing that the BSC problem is NP-hard and not in APX. To address this problem, we design three strategies-Shrink, Expand, and Hybrid-along with several optimization techniques to improve efficiency. Extensive experiments on large real-world datasets (e.g., DBLP, YAGO, DBpedia) demonstrate the effectiveness and efficiency of our approach. Specifically, our method achieves 3.49-107.09× higher PathSim scores for StrCom and two to five orders of magnitude higher scores for BSC compared to state-of-the-art baselines, demonstrating that the identified communities are both semantically coherent and structurally compact.
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (6) , 1-27
Open AccessBudgeted Strong Community Search in Heterogeneous Graphs
Community search in heterogeneous graphs is fundamental to applications such as expert team formation and scholarly collaboration. Many existing studies leverage meta-paths, which are sequences of node and edge types, to capture semantic relationships in heterogeneous graphs. However, most of them only consider the existence of meta-path instances, overlooking their frequency and thus failing to capture relationship strength. This limitation can result in communities that include nodes with numerous but weak relations. To capture the strength of relationships in heterogeneous graphs, we define the Strong Community (StrCom) model, which evaluates the strength between users based on the number of connecting meta-path instances. Building upon this model, we further propose the Budgeted Strong Community (BSC) problem by incorporating a size constraint. We provide theoretical analyses showing that the BSC problem is NP-hard and not in APX. To address this problem, we design three strategies-Shrink, Expand, and Hybrid-along with several optimization techniques to improve efficiency. Extensive experiments on large real-world datasets (e.g., DBLP, YAGO, DBpedia) demonstrate the effectiveness and efficiency of our approach. Specifically, our method achieves 3.49-107.09× higher PathSim scores for StrCom and two to five orders of magnitude higher scores for BSC compared to state-of-the-art baselines, demonstrating that the identified communities are both semantically coherent and structurally compact.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 5011-5015
From Post To Personality: Harnessing LLMs for MBTI Prediction in Social Media
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 5011-5015
Open AccessFrom Post To Personality: Harnessing LLMs for MBTI Prediction in Social Media
- Open Access
- 30 September 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 2 (4) , 1-27
BT-Tree: A Reinforcement Learning Based Index for Big Trajectory Data
With the increasing availability of trajectory data, it is important to have good indexes to facilitate query processing. In this work, we propose BT-Tree, which is built through a recursive bi-partitioning approach, for the processing of range and KNN queries for past trajectory data. We first propose a cost function based method (CFBM) to build the BT-Tree. Specifically, we design a novel cost function, which incorporates the characteristics of both the data and historical query workload, to decide how to partition a BT-Tree node. Then we propose a reinforcement learning (RL) based method to address CFBM's limitations, such as making locally optimal decisions that may lead to global suboptimality. Experiments on three real datasets with up to 800 million data points show that the CFBM generally outperforms the baselines in terms of query processing time and the RL based method consistently outperforms the baselines and has more significant advantages on larger datasets.
- 30 September 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 2 (4) , 1-27
Open AccessBT-Tree: A Reinforcement Learning Based Index for Big Trajectory Data
With the increasing availability of trajectory data, it is important to have good indexes to facilitate query processing. In this work, we propose BT-Tree, which is built through a recursive bi-partitioning approach, for the processing of range and KNN queries for past trajectory data. We first propose a cost function based method (CFBM) to build the BT-Tree. Specifically, we design a novel cost function, which incorporates the characteristics of both the data and historical query workload, to decide how to partition a BT-Tree node. Then we propose a reinforcement learning (RL) based method to address CFBM's limitations, such as making locally optimal decisions that may lead to global suboptimality. Experiments on three real datasets with up to 800 million data points show that the CFBM generally outperforms the baselines in terms of query processing time and the RL based method consistently outperforms the baselines and has more significant advantages on larger datasets.
- 30 April 2024
- Published by Elsevier in Information Sciences
- Vol. 672
Experimental analysis and evaluation of cohesive subgraph discovery
- 30 April 2024
- Published by Elsevier in Information Sciences
- Vol. 672
Experimental analysis and evaluation of cohesive subgraph discovery
- Open Access
- 26 May 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (1) , 1-25
Effectiveness Perspectives and a Deep Relevance Model for Spatial Keyword Queries
Geo-textual objects with both geographical location and textual description are gaining in prevalence. Over the past decades, substantial research has been conducted on spatial keyword queries, which integrate location into keyword-based querying of geo-textual content. However, existing proposals mostly focus on efficiency for processing spatial keyword queries, and little effort was made to address the effectiveness perspectives. In this work, using two datasets with ground truth query results, we evaluate the effectiveness of standard spatial keyword queries. Our evaluation results show that the TkQ query that ranks objects by a weighted combination of spatial proximity and text relevance is the most effective. Motivated by the finding, we propose a Deep relevance with Weight learning (DrW) model to further improve the effectiveness of the retrieval ranking. DrW is featured with two novel ideas: First, we propose a neural network architecture to learn the text relevance matching over the local interaction between the query and geo-textual objects. Second, we find that a query-dependent weight to balance text relevance and spatial proximity in ranking can improve effectiveness, and we develop a learning-based method to learn the query-dependent weight. Experimental results reveal that our model outperforms state-of-the-art methods on effectiveness, with improvements up to 32.15%, 32.34%, and 33.00% in terms of NDCG@3, NDCG@5, and MRR.
- 26 May 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (1) , 1-25
Open AccessEffectiveness Perspectives and a Deep Relevance Model for Spatial Keyword Queries
Geo-textual objects with both geographical location and textual description are gaining in prevalence. Over the past decades, substantial research has been conducted on spatial keyword queries, which integrate location into keyword-based querying of geo-textual content. However, existing proposals mostly focus on efficiency for processing spatial keyword queries, and little effort was made to address the effectiveness perspectives. In this work, using two datasets with ground truth query results, we evaluate the effectiveness of standard spatial keyword queries. Our evaluation results show that the TkQ query that ranks objects by a weighted combination of spatial proximity and text relevance is the most effective. Motivated by the finding, we propose a Deep relevance with Weight learning (DrW) model to further improve the effectiveness of the retrieval ranking. DrW is featured with two novel ideas: First, we propose a neural network architecture to learn the text relevance matching over the local interaction between the query and geo-textual objects. Second, we find that a query-dependent weight to balance text relevance and spatial proximity in ranking can improve effectiveness, and we develop a learning-based method to learn the query-dependent weight. Experimental results reveal that our model outperforms state-of-the-art methods on effectiveness, with improvements up to 32.15%, 32.34%, and 33.00% in terms of NDCG@3, NDCG@5, and MRR.
- Open Access
- 26 May 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (1) , 1-26
The RLR-Tree: A Reinforcement Learning Based R-Tree for Spatial Data
Learned indexes have been proposed to replace classic index structures like B-Tree with machine learning (ML) models. They require to replace both the indexes and query processing algorithms currently deployed by the databases, and such a radical departure is likely to encounter challenges and obstacles. In contrast, we propose a fundamentally different way of using ML techniques to build a better R-Tree without the need to change the structure or query processing algorithms of traditional R-Tree. Specifically, we develop reinforcement learning (RL) based models to decide how to choose a subtree for insertion and how to split a node when building and updating an R-Tree, instead of relying on hand-crafted heuristic rules currently used by the R-Tree and its variants. Experiments on real and synthetic datasets with up to more than 100 million spatial objects show that our RL based index outperforms the R-Tree and its variants in terms of query processing time.
- 26 May 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (1) , 1-26
Open AccessThe RLR-Tree: A Reinforcement Learning Based R-Tree for Spatial Data
Learned indexes have been proposed to replace classic index structures like B-Tree with machine learning (ML) models. They require to replace both the indexes and query processing algorithms currently deployed by the databases, and such a radical departure is likely to encounter challenges and obstacles. In contrast, we propose a fundamentally different way of using ML techniques to build a better R-Tree without the need to change the structure or query processing algorithms of traditional R-Tree. Specifically, we develop reinforcement learning (RL) based models to decide how to choose a subtree for insertion and how to split a node when building and updating an R-Tree, instead of relying on hand-crafted heuristic rules currently used by the R-Tree and its variants. Experiments on real and synthetic datasets with up to more than 100 million spatial objects show that our RL based index outperforms the R-Tree and its variants in terms of query processing time.
- 17 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (10) , 10309-10323
Unsupervised Rumor Detection Based on Propagation Tree VAE
The wide spread of rumors inflicts damages on social media platforms. Detecting rumors has become an emerging problem concerning the public and government. A crucial problem for rumors detection on social media is the lack of reliably pre-annotated dataset to train classification models. To solve this problem, we propose an unsupervised model that detects rumors by measuring how well the tweets follow the normal patterns. However, the problem is challenging in how to automatically discover the normal patterns of tweets. To tackle the challenge, we first propose a novel tree variational autoencoder model that reconstructs the sentiment labels along the propagation tree of a factual tweet. Then we propose a cross-alignment method to align the multiple modalities, i.e. tree structure and propagation features, and output the final prediction results. We conduct extensive experiments on a real-world dataset collected from Weibo. The experiments show that the proposed method significantly outperforms the state-of-the-art unsupervised methods and adapts better to the concept drift than state-of-the-art supervised methods.
- 17 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (10) , 10309-10323
Unsupervised Rumor Detection Based on Propagation Tree VAE
The wide spread of rumors inflicts damages on social media platforms. Detecting rumors has become an emerging problem concerning the public and government. A crucial problem for rumors detection on social media is the lack of reliably pre-annotated dataset to train classification models. To solve this problem, we propose an unsupervised model that detects rumors by measuring how well the tweets follow the normal patterns. However, the problem is challenging in how to automatically discover the normal patterns of tweets. To tackle the challenge, we first propose a novel tree variational autoencoder model that reconstructs the sentiment labels along the propagation tree of a factual tweet. Then we propose a cross-alignment method to align the multiple modalities, i.e. tree structure and propagation features, and output the final prediction results. We conduct extensive experiments on a real-world dataset collected from Weibo. The experiments show that the proposed method significantly outperforms the state-of-the-art unsupervised methods and adapts better to the concept drift than state-of-the-art supervised methods.
- 8 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 32 (11) , 2254-2268
SURGE: Continuous Detection of Bursty Regions Over a Stream of Spatial Objects
With the proliferation of mobile devices and location-based services, continuous generation of massive volume of streaming spatial objects (i.e., geo-tagged data) opens up new opportunities to address real-world problems by analyzing them. In this paper, we present a novel continuous bursty region detection (SURGE) problem that aims to continuously detect a bursty region of a given size in a specified geographical area from a stream of spatial objects. Specifically, a bursty region shows maximum spike in the number of spatial objects in a given time window. The SURGE problem is useful in addressing several real-world challenges such as surge pricing problem in online transportation and disease outbreak detection. To solve the problem, we propose an exact solution and two approximate solutions, and the approximation ratio is $\frac{1-\alpha}{4}$ in terms of the burst score, where $\alpha$ is a parameter to control the burst score. We further extend these solutions to support detection of top-k bursty regions. Extensive experiments with real-world data are conducted to demonstrate the efficiency and effectiveness of our solutions.- 8 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 32 (11) , 2254-2268
SURGE: Continuous Detection of Bursty Regions Over a Stream of Spatial Objects
With the proliferation of mobile devices and location-based services, continuous generation of massive volume of streaming spatial objects (i.e., geo-tagged data) opens up new opportunities to address real-world problems by analyzing them. In this paper, we present a novel continuous bursty region detection (SURGE) problem that aims to continuously detect a bursty region of a given size in a specified geographical area from a stream of spatial objects. Specifically, a bursty region shows maximum spike in the number of spatial objects in a given time window. The SURGE problem is useful in addressing several real-world challenges such as surge pricing problem in online transportation and disease outbreak detection. To solve the problem, we propose an exact solution and two approximate solutions, and the approximation ratio is $\frac{1-\alpha}{4}$ in terms of the burst score, where $\alpha$ is a parameter to control the burst score. We further extend these solutions to support detection of top-k bursty regions. Extensive experiments with real-world data are conducted to demonstrate the efficiency and effectiveness of our solutions.