Hanchao Li

Hanchao Li

Auto-generated profile, based on publicly available information

Hanchao Li

Department of Computing, Coventry University, Coventry, U.K.

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
5 October 2021 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
Chaobo HeChaobo He
Chaobo He
XFXiang Fei
Xiang Fei
QCQiwei Cheng
Qiwei Cheng
HLHanchao Li
Hanchao Li
Zeng HuZeng Hu
Zeng Hu
YTYong Tang
Yong Tang
Community detection is one of the popular research topics in the field of complex networks analysis. It aims to identify communities, represented as cohesive subgroups or clusters, where nodes in the same community link to each other more densely than others outside. Due to the interpretability, simplicity, flexibility, and generality, nonnegative matrix factorization (NMF) has become a very ideal model for community detection and lots of related methods have been presented. To facilitate research on NMF-based community detection, in this article, we make a comprehensive review on NMF-based methods for community detection, especially the state-of-the-art methods presented in high prestige journals or conferences. First, we introduce the basic principles of NMF and explain why NMF can detect communities and design a general framework of NMF-based community detection. Second, according to the applicable network types, we propose a taxonomy to divide the existing NMF-based methods for community detection into six categories, namely, topology networks, signed networks, attributed networks, multilayer networks, dynamic networks, and large-scale networks. We deeply analyze representative methods in every category. Finally, we summarize the common problems faced by all methods and potential solutions and propose four promising research directions. We believe that this survey can fully demonstrate the versatility of NMF-based community detection and serve as a useful guideline for researchers in related fields.

12 August 2021 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
Chaobo HeChaobo He
Chaobo He
YZYulong Zheng
Yulong Zheng
XFXiang Fei
Xiang Fei
HLHanchao Li
Hanchao Li
Zeng HuZeng Hu
Zeng Hu
Yong TangYong Tang
Yong Tang
Community detection is of great help to understand the structures and functions of complex networks. It has become one of popular research topics in the field of complex networks analysis. Due to the simplicity, flexibility, effectiveness and better interpretability, Nonnegative Matrix Factorization (NMF)-based methods have been widely employed for community detection. However, most existing NMF-based community detection methods are linear and their performance is limited when facing networks with diversified structure information. In view of this, we propose a nonlinear NMF-based method named NMFGAAE, which is composed of two main modules: NMF and Graph Attention Auto-Encoder (GAAE). This approach can boost the performance of NMF-based community detection methods by the aid of graph neural networks and deep clustering. More specifically, GAAE introduces an attention mechanism directed by NMF-based community detection to learn the node representations, while NMF can simultaneously factor these representations to uncover the community structure. We design a unified framework to jointly optimize GAAE and NMF modules, which is very beneficial to obtain better community detection results. We conduct extensive experiments on synthetic and real-world networks. The results show that our NMFGAAE not only performs better than state-of-the-art NMF-based community detection methods, but also outperforms some network representation based baselines. More importantly, NMFGAAE indeed can boost the performance of NMF-based community detection methods.

1 November 2017
Verified
Conference Paper
Closed access
AFAli Haider Fakhrulddin
Ali Haider Fakhrulddin
XFXiang Fei
Xiang Fei
HLHanchao Li
Hanchao Li
According to the World Health Organization, around 28-35% of people aged 65 and older fall each year. This number increases to around 32-42% for people over 70 years old. For this reason, this research targets the exploration of the role of Convolutional Neural Networks(CNN) in human fall detection. There are a number of current solutions related to fall detection; however, remain low detection accuracy. Although CNN has proven a powerful technique for image recognition problems, and the CNN library in Matlab was designed to work with either images or matrices, this research explored how to apply CNN to streaming sensor data, collected from Body Sensor Networks (BSN), in order to improve the fall detection accuracy. The idea of this research is that given the stream data sets as input, we converted them into images before applying CNN. The final accuracy result achieved is, to the best of our knowledge, the highest compared to other proposed methods: 92.3%.

1 January 2019 in Physica A: Statistical Mechanics and its Applications
Verified
Journal Article
Closed access
CHChaobo He
Chaobo He
YTYong Tang
Yong Tang
HLHai Liu
Hai Liu
XFXiang Fei
Xiang Fei
HLHanchao Li
Hanchao Li
SLShuangyin Liu
Shuangyin Liu

1 March 2021 in Future Generation Computer Systems
Verified
Journal Article
Closed access
CHChaobo He
Chaobo He
HLHai Liu
Hai Liu
Yong TangYong Tang
Yong Tang
SLShuangYin Liu
ShuangYin Liu
XFXiang Fei
Xiang Fei
HLHanchao Li
Hanchao Li

4 May 2020 in IEEE Access
Verified
Journal Article
Open access
Chaobo HeChaobo He
Chaobo He
HLHai Liu
Hai Liu
YTYong Tang
Yong Tang
XFXiang Fei
Xiang Fei
HLHanchao Li
Hanchao Li
QZQiong Zhang
Qiong Zhang
As an effective technique to learn low-dimensional node features in complicated network environment, network embedding has become a promising research direction in the field of network analysis. Due to the virtues of better interpretability and flexibility, matrix factorization based methods for network embedding have received increasing attentions. However, most of them are inadequate to learn more complicated hierarchical features hidden in complex networks because of their mechanisms of single-layer factorization structure. Besides, their original feature matrices used for factorization and their robustness against noises also need to be further improved. To solve these problems, we propose a novel network embedding method named DRNMF (deep robust nonnegative matrix factorization), which is formed by multi-layer NMF learning structure. Meanwhile, DRNMF employs the combination of high-order proximity matrices of the network as the original feature matrix for the factorization. To improve the robustness against noises, we use ℓ 2,1 norm to devise the objective function for the DRNMF network embedding model. Effective iterative update rules are derived to resolve the model, and the convergence of these rules are strictly proved. Moreover, we introduce a pre-training strategy to improve the efficiency of convergence. Extensive experiments on several benchmarks of complex networks demonstrate that our proposed method DRNMF is effective and has better performance than the state-of-the-art matrix factorization based methods for network embedding.