Chengfei Liu

Chengfei Liu

Auto-generated profile, based on publicly available information

Chengfei Liu

Swinburne University of Technology, Melbourne, Australia

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 October 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
XSXiangyu Song
Xiangyu Song
Jianxin LiJianxin Li
Jianxin Li
TCTaotao Cai
Taotao Cai
SYShuiqiao Yang
Shuiqiao Yang
TYTingting Yang
Tingting Yang
CLChengfei Liu
Chengfei Liu

5 August 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JXJiajie Xu
Jiajie Xu
JZJing Zhao
Jing Zhao
RZRui Zhou
Rui Zhou
CLChengfei Liu
Chengfei Liu
PZPengpeng Zhao
Pengpeng Zhao
LZLei Zhao
Lei Zhao
Destination prediction is known as an important problem for many location based services (LBSs). Existing solutions generally apply probabilistic models or neural network models to predict destinations over a subtrajectory, and adopt the standard attention mechanism to improve the prediction accuracy. However, the standard attention mechanism uses fixed feature representations, and has a limited ability to represent distinct features of locations. Besides, existing methods rarely take the impact of spatial and temporal characteristics of the trajectory into account. Their accuracies in fine-granularity prediction are always not satisfactory due to the data sparsity problem. Thus, in this paper, a carefully designed deep learning model called LATL model is presented. It not only adopts an adaptive attention network to model the distinct features of locations, but also implements time gates and distance gates into the Long Short-Term Memory (LSTM) network to capture the spatial-temporal relation between consecutive locations. Furthermore, to better understand the mobility patterns in different spatial granularities, and explore the fusion of multi-granularity learning capability, a hierarchical model that utilizes tailored combination of different neural networks under multiple spatial granularities is further proposed. Extensive empirical studies verify that the newly proposed models perform effectively and settle the problem nicely.

1 September 2021 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
FXFeng Xia
Feng Xia
SYShuo Yu
Shuo Yu
CLChengfei Liu
Chengfei Liu
Jianxin LiJianxin Li
Jianxin Li
ILIvan Lee
Ivan Lee
Clustering network vertices is an enabler of various applications such as social computing and Internet of Things. However, challenges arise for clustering when networks increase in scale. This paper proposes CHIEF (Clustering with HIgher-ordEr motiFs), a solution which consists of two motif clustering techniques: standard acceleration CHIEF-ST and approximate acceleration CHIEF-AP. Both algorithms firstly find the maximal $k$ -edge-connected subgraphs within the target networks to lower the network scale by optimizing the network structure with maximal $k$ -edge-connected subgraphs, and then use heterogeneous four-node motifs clustering in higher-order dense networks. For CHIEF-ST, we illustrate that all target motifs will be kept after this procedure when the minimum node degree of the target motif is equal or greater than $k$ . For CHIEF-AP, we prove that the eigenvalues of the adjacency matrix and the Laplacian matrix are relatively stable after this step. CHIEF offers an improved efficiency of motif clustering for big networks, and it verifies higher-order motif significance. Experiments on real and synthetic networks demonstrate that the proposed solutions outperform baseline approaches in large network analysis, and higher-order motifs outperform traditional triangle motifs in clustering.

1 June 2011 in World Wide Web
Verified
Journal Article
Closed access
PDF file
HHHai Huang
Hai Huang
CLChengfei Liu
Chengfei Liu
XZXiaofang Zhou
Xiaofang Zhou

18 January 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
TATarique Anwar
Tarique Anwar
CLChengfei Liu
Chengfei Liu
Hai Le VuHai Le Vu
Hai Le Vu
Md. Saiful IslamMd. Saiful Islam
Md. Saiful Islam
TSTimos Sellis
Timos Sellis
The urban road networks undergo frequent traffic congestions during the peak hours and around the city centre. Capturing the spatiotemporal evolution of the congestion scenario in real-time in an urban-scale can aid in developing smart traffic management systems, and guiding commuters in making informed decision about route choice. The congestion scenario is often represented by a set of distinguishable network partitions that have homogeneous level of congestion inside them but are heterogeneous to others. Due to the dynamic nature of traffic, these partitions evolve with time in terms of their structure and location. In this paper, we propose a comprehensive framework to capture the evolution by incrementally updating the partitions in an efficient manner using a two-layer approach. The physical layer maintains a set of small-sized road network building blocks in a fine granularity, and performs low-level computations to incrementally update them, whereas the logical layer performs high-level computations in order to serve as an interface to query the physical layer about the congested partitions in a coarse granularity. We also propose an in-memory index called Bin that compactly stores the historical sets of building blocks in the main memory with no information loss, and facilitates their efficient retrieval. Our experimental results show that the proposed method is much efficient than the existing re-partitioning methods without significant sacrifice in accuracy. The proposed Bin consume a minimum space with least redundancy at different time stamps.

6 April 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
BLBing Li
Bing Li
XYXiaochun Yang
Xiaochun Yang
RZRui Zhou
Rui Zhou
NUNORTHEASTERN UNIVERSITY
NORTHEASTERN UNIVERSITY
CLChengfei Liu
Chengfei Liu
YZYanchun Zhang
Yanchun Zhang
A phrase is a natural, meaningful, and essential semantic unit. In topic modeling, visualizing phrases for individual topics is an effective way to explore and understand unstructured text corpora. However, from phrase quality and topical cohesion perspectives, the outcomes of existing approaches remain to be improved. Usually, the process of topical phrase mining is twofold: phrase mining and topic modeling. For phrase mining, existing approaches often suffer from order sensitive and inappropriate segmentation problems, which make them often extract inferior quality phrases. For topic modeling, traditional topic models do not fully consider the constraints induced by phrases, which may weaken the cohesion. Moreover, existing approaches often suffer from losing domain terminologies since they neglect the impact of domain-level topical distribution. In this paper, we propose an efficient method for high quality and cohesive topical phrase mining. In our framework, we integrate quality guaranteed phrase mining method, a novel topic model incorporating the constraint of phrases, and a novel document clustering method into an iterative framework to improve both phrase quality and topical cohesion. We also describe efficient algorithmic designs to execute these methods efficiently. The empirical verification demonstrates that our method outperforms the state-of-the-art methods from the aspects of both interpretability and efficiency.