Fanzhen Liu

Fanzhen Liu

Auto-generated profile, based on publicly available information

Fanzhen Liu

Macquarie University

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
9 March 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
XSXing Su
Xing Su
SXShan Xue
Shan Xue
FLFanzhen Liu
Fanzhen Liu
Jia WUJia WU
Jia WU
JYJian Yang
Jian Yang
PYPhilip S. Yu
Philip S. Yu
Detecting a community in a network is a matter of discerning the distinct features and connections of a group of members that are different from those in other communities. The ability to do this is of great significance in network analysis. However, beyond the classic spectral clustering and statistical inference methods, there have been significant developments with deep learning techniques for community detection in recent years--particularly when it comes to handling high-dimensional network data. Hence, a comprehensive review of the latest progress in community detection through deep learning is timely. To frame the survey, we have devised a new taxonomy covering different state-of-the-art methods, including deep learning models based on deep neural networks (DNNs), deep nonnegative matrix factorization, and deep sparse filtering. The main category, i.e., DNNs, is further divided into convolutional networks, graph attention networks, generative adversarial networks, and autoencoders. The popular benchmark datasets, evaluation metrics, and open-source implementations to address experimentation settings are also summarized. This is followed by a discussion on the practical applications of community detection in various domains. The survey concludes with suggestions of challenging topics that would make for fruitful future research directions in this fast-growing deep learning field.

1 July 2020
Verified
Conference Paper
Closed access
FLFanzhen Liu
Fanzhen Liu
SXShan Xue
Shan Xue
JWJia Wu
Jia Wu
CZChuan Zhou
Chuan Zhou
WHWenbin Hu
Wenbin Hu
PYPhilip S Yu
Philip S Yu
As communities represent similar opinions, similar functions, similar purposes, etc., community detection is an important and extremely useful tool in both scientific inquiry and data analytics. However, the classic methods of community detection, such as spectral clustering and statistical inference, are falling by the wayside as deep learning techniques demonstrate an increasing capacity to handle high-dimensional graph data with impressive performance. Thus, a survey of current progress in community detection through deep learning is timely. Structured into three broad research streams in this domain – deep neural networks, deep graph embedding, and graph neural networks, this article summarizes the contributions of the various frameworks, models, and algorithms in each stream along with the current challenges that remain unsolved and the future research opportunities yet to be explored.

23 October 2019 in World Wide Web
Verified
Journal Article
Closed access
PDF file
FLFanzhen Liu
Fanzhen Liu
Jia WUJia WU
Jia WU
SXShan Xue
Shan Xue
CZChuan Zhou
Chuan Zhou
JYJian Yang
Jian Yang
QSQuanzheng Sheng
Quanzheng Sheng

17 January 2022 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
FLFanzhen Liu
Fanzhen Liu
ZLZhao Li
Zhao Li
BWBaokun Wang
Baokun Wang
Jia WUJia WU
Jia WU
JYJian Yang
Jian Yang
Michael ShengMichael Sheng
Michael Sheng

1 July 2019
Verified
Conference Paper
Closed access
FLFanzhen Liu
Fanzhen Liu
Jia WUJia WU
Jia WU
CZChuan Zhou
Chuan Zhou
JYJian Yang
Jian Yang
Evolutionary clustering is a way of detecting the evolving patterns of communities in dynamic social networks. In principle, the detection process seeks to simultaneously maximize clustering accuracy at the current time step and minimize the clustering drift between two successive time steps. Several evolutionary clustering methods have been developed in an attempt to find the best trade-off between clustering accuracy and temporal smoothness, but the classic genetic operators in these methods do not make the best of the inter- and intra-connected relationships between nodes, which limits their effectiveness. To overcome this problem, we propose a novel migration operator to work in tandem with classic genetic operators to improve the discovery of evolving community structures. The operator is implemented within an existing genetic algorithm which relies on a genome representation under a decomposition framework that formulates evolutionary community detection as a multiobjective optimization problem. Moreover, we present a new method of calculating modularity directly from a genome matrix as the objective for measuring the snapshot quality, which results in a wider search space for finding the optimal solution. Experimental results over several synthetic networks and one real-world dynamic social network suggest that our method is superior to two other state-of-the-art methods in terms of both accuracy and smoothness in discovering evolving community structures in dynamic social networks.

24 August 2024
Verified
Conference Paper
Open access
XMXiaoxiao Ma
Xiaoxiao Ma
RLRuikun Li
Ruikun Li
FLFanzhen Liu
Fanzhen Liu
KDKaize Ding
Kaize Ding
JYJian Yang
Jian Yang
Jia WUJia WU
Jia WU
Anomalous node detection in a static graph faces significant challenges due to the rarity of anomalies and the substantial cost of labeling their deviant structure and attribute patterns. These challenges give rise to data-centric problems, including extremely imbalanced data distributions and intricate graph learning, which significantly impede machine learning and deep learning methods from discerning the patterns of graph anomalies with few labels. While these issues remain crucial, much of the current research focuses on addressing the induced technical challenges, treating the shortage of labeled data as a given. Distinct from previous efforts, this work focuses on tackling the data-centric problems by generating auxiliary training nodes that conform to the original graph topology and attribute distribution. We categorize this approach as data-centric, aiming to enhance existing anomaly detectors by training them on our synthetic data. However, the methods for generating nodes and the effectiveness of utilizing synthetic data for graph anomaly detection remain unexplored in the realm. To answer these questions, we thoroughly investigate the denoising diffusion model. Drawing from our observations on the diffusion process, we illuminate the shifts in graph energy distribution and establish two principles for designing denoising neural networks tailored to graph anomaly generation. From the insights, we propose a diffusion-based graph generation method to synthesize training nodes, which can be promptly integrated to work with existing anomaly detectors. The empirical results on eight widely-used datasets demonstrate our generated data can effectively enhance the nine state-of-the-art graph detectors' performance.