Feng Hu

Prof. Feng Hu

Qinghai Nornal University, Xining, Qinghai, China
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
6 November 2024 in Entropy
Verified
Journal Article
Open access
PDF file
海肖海冰 肖
海冰 肖
Feng HuFeng Hu
Feng Hu
PLPengyue Li
Pengyue Li
YSYurong Song
Yurong Song
ZZZike Zhang
Zike Zhang
Social networks, functioning as core platforms for modern information dissemination, manifest distinctive user clustering behaviors and state transition mechanisms, thereby presenting new challenges to traditional information propagation models. Based on hypergraph theory, this paper augments the traditional SEIR model by introducing a novel hypernetwork information dissemination SSEIR model specifically designed for online social networks. This model accurately represents complex, multi-user, high-order interactions. It transforms the traditional single susceptible state (S) into active (Sa) and inactive (Si) states. Additionally, it enhances traditional information dissemination mechanisms through reaction process strategies (RP strategies) and formulates refined differential dynamical equations, effectively simulating the dissemination and diffusion processes in online social networks. Employing mean field theory, this paper conducts a comprehensive theoretical derivation of the dissemination mechanisms within the SSEIR model. The effectiveness of the model in various network structures was verified through simulation experiments, and its practicality was further validated by its application on real network datasets. The results show that the SSEIR model excels in data fitting and illustrating the internal mechanisms of information dissemination within hypernetwork structures, further clarifying the dynamic evolutionary patterns of information dissemination in online social hypernetworks. This study not only enriches the theoretical framework of information dissemination but also provides a scientific theoretical foundation for practical applications such as news dissemination, public opinion management, and rumor monitoring in online social networks.

25 August 2023 in Entropy
Verified
Journal Article
Open access
PDF file
Feng HuFeng Hu
Feng Hu
KTKuo Tian
Kuo Tian
ZZZike Zhang
Zike Zhang
Hypergraphs have become an accurate and natural expression of high-order coupling relationships in complex systems. However, applying high-order information from networks to vital node identification tasks still poses significant challenges. This paper proposes a von Neumann entropy-based hypergraph vital node identification method (HVC) that integrates high-order information as well as its optimized version (semi-SAVC). HVC is based on the high-order line graph structure of hypergraphs and measures changes in network complexity using von Neumann entropy. It integrates s-line graph information to quantify node importance in the hypergraph by mapping hyperedges to nodes. In contrast, semi-SAVC uses a quadratic approximation of von Neumann entropy to measure network complexity and considers only half of the maximum order of the hypergraph’s s-line graph to balance accuracy and efficiency. Compared to the baseline methods of hyperdegree centrality, closeness centrality, vector centrality, and sub-hypergraph centrality, the new methods demonstrated superior identification of vital nodes that promote the maximum influence and maintain network connectivity in empirical hypergraph data, considering the influence and robustness factors. The correlation and monotonicity of the identification results were quantitatively analyzed and comprehensive experimental results demonstrate the superiority of the new methods. At the same time, a key non-trivial phenomenon was discovered: influence does not increase linearly as the s-line graph orders increase. We call this the saturation effect of high-order line graph information in hypergraph node identification. When the order reaches its saturation value, the addition of high-order information often acts as noise and affects propagation.

4 April 2025 in Frontiers in Genetics
Verified
Journal Article
Open access
PDF file
LBLibing Bai
Libing Bai
ZLZongjin Li
Zongjin Li
CTChunyang Tang
Chunyang Tang
CSChangxin Song
Changxin Song
Feng HuFeng Hu
Feng Hu
Background: With the rapid advancement of gene sequencing technologies, Traditional weighted gene co-expression network analysis (WGCNA), which relies on pairwise gene relationships, struggles to capture higher-order interactions and exhibits low computational efficiency when handling large, complex datasets.Methods: To overcome these challenges, we propose a novel Weighted Gene Co-expression Hypernetwork Analysis (WGCHNA) based on weighted hypergraph, where genes are modeled as nodes and samples as hyperedges. By calculating the hypergraph Laplacian matrix, WGCHNA generates a topological overlap matrix for module identification through hierarchical clustering.Results: Results on four gene expression datasets show that WGCHNA outperforms WGCNA in module identification and functional enrichment. WGCHNA identifies biologically relevant modules with greater complexity, particularly in processes like neuronal energy metabolism linked to Alzheimer’s disease. Additionally, functional enrichment analysis uncovers more comprehensive pathway hierarchies, revealing potential regulatory relationships and novel targets.Conclusion: WGCHNA effectively addresses WGCNA’s limitations, providing superior accuracy in detecting gene modules and deeper insights for disease research, making it a powerful tool for analyzing complex biological systems.

4 November 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
YGyunchao gong
yunchao gong
XLXueqiang LYU
Xueqiang LYU
ZYZhu Yuan
Zhu Yuan
Feng HuFeng Hu
Feng Hu
ZCZangtai Cai
Zangtai Cai
XYXindong You
Xindong You

28 October 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
KWKaijun Wang
Kaijun Wang
YGyunchao gong
yunchao gong
Feng HuFeng Hu
Feng Hu
The hypergraph offers a platform to study structural properties emerging from more complicated and higher-order than pairwise interactions among constituents and dynamical behavior, such as the spread of information or disease. Considering the higher-order interaction between multiple nodes in the system, the mathematical model of infectious diseases spreading on simple scale-free networks is extended to hypernetworks based on hypergraphs. A SIS propagation model based on reaction process strategy in a universal scale-free hypernetwork is constructed, and the theoretical and simulation analysis of the model is carried out. Using mean field theory, the analytical expressions between infection density and hypernetwork structure parameters as well as propagation parameters in steady state are given. Through individual-based simulation, the theoretical results are verified and the infectious disease spread process under the structure of the hypernetwork and simple scale-free network is compared and analyzed. It becomes apparent that infectious diseases are easier to spread on the hypernetworks, showing the clear clustering characteristics of epidemic spread. Furthermore, the influence of the hypernetwork structure and model parameters on the propagation process is studied. The results of this paper are helpful in further studying the propagation dynamics on the hypernetworks. At the same time, it provides a certain theoretical basis for the current COVID-19 prevention and control in China and the prevention of infectious diseases in the future.

22 September 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
RCRumeng Chen
Rumeng Chen
Feng HuFeng Hu
Feng Hu
FWFeng Wang
Feng Wang
LBLibing Bai
Libing Bai
With the complexity and variability of data structures and dimensions, traditional clustering algorithms face various challenges. The integration of network science and clustering has become a popular field of exploration. One of the main challenges is how to handle large-scale and complex high-dimensional data effectively. Hypergraphs can accurately represent multidimensional heterogeneous data, making them important for improving clustering performance. In this paper, we propose a hypergraph-clustering method dubbed the “high-dimensional data clustering method” based on hypergraph partitioning using an improved Apriori algorithm (HDHPA). First, the method constructs a hypergraph based on the improved Apriori association rule algorithm, where frequent itemsets existing in high-dimensional data are treated as hyperedges. Then, different frequent itemsets are mined in parallel to obtain hyperedges with corresponding ranks, avoiding the generation of redundant rules and improving mining efficiency. Next, we use the dense subgraph partition (DSP) algorithm to divide the hypergraph into multiple subclusters. Finally, we merge the subclusters through dense sub-hypergraphs to obtain the clustering results. The advantage of this method lies in its use of the hypergraph model to discretize the association between data in space, which further enhances the effectiveness and accuracy of clustering. We comprehensively compare the proposed HDHPA method with several advanced hypergraph-clustering methods using seven different types of high-dimensional datasets and then compare their running times. The results show that the clustering evaluation index values of the HDHPA method are generally superior to all other methods. The maximum ARI value can reach 0.834, an increase of 42%, and the average running time is lower than other methods. All in all, HDHPA exhibits an excellent comparable performance on multiple real networks. The research results of this paper provide an effective solution for processing and analyzing large-scale network datasets and are also conducive to broadening the application range of clustering techniques.