Hong Huang

Hong Huang

Auto-generated profile, based on publicly available information

Hong Huang

Huazhong University of Science and Technology, Wuhan, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 December 2020 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
HHHong Huang
Hong Huang
YSYu Song
Yu Song
YWYao Wu
Yao Wu
JSJia Shi
Jia Shi
XXXia Xie
Xia Xie
HJHai Jin
Hai Jin
Link prediction and node classification are two important downstream tasks of network representation learning. Existing methods have achieved acceptable results but they perform these two tasks separately, which requires a lot of duplication of work and ignores the correlations between tasks. Besides, conventional models suffer from the identical treatment of information of multiple views, thus they fail to learn robust representation for downstream tasks. To this end, we tackle link prediction and node classification problems simultaneously via multitask multiview learning in this article. We first explain the feasibility and advantages of multitask multiview learning for these two tasks. Then we propose a novel model named MT-MVGCN to perform link prediction and node classification tasks simultaneously. More specifically, we design a multiview graph convolutional network to extract abundant information of multiple views in a network, which is shared by different tasks. We further apply two attention mechanisms: view the attention mechanism and task attention mechanism to make views and tasks adjust the view fusion process. Moreover, view reconstruction can be introduced as an auxiliary task to boost the performance of the proposed model. Experiments on real-world network data sets demonstrate that our model is efficient yet effective, and outperforms advanced baselines in these two tasks.

23 January 2018 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
PDF file
HHHong Huang
Hong Huang
YDYuxiao Dong
Yuxiao Dong
JTJie Tang
Jie Tang
HYHongxia Yang
Hongxia Yang
NCNitesh V. Chawla
Nitesh V. Chawla
XFXiaoming Fu
Xiaoming Fu
The social triad—a group of three people—is one of the simplest and most fundamental social groups. Extensive network and social theories have been developed to understand its structure, such as triadic closure and social balance. Over the course of a triadic closure—the transition from two ties to three among three users, the strength dynamics of its social ties, however, are much less well understood. Using two dynamic networks from social media and mobile communication, we examine how the formation of the third tie in a triad affects the strength of the existing two ties. Surprisingly, we find that in about 80% social triads, the strength of the first two ties is weakened although averagely the tie strength in the two networks maintains an increasing or stable trend. We discover that (1) the decrease in tie strength among three males is more sharply than that among females, and (2) the tie strength between celebrities is more likely to be weakened as the closure of a triad than those between ordinary people. Furthermore, we formalize a triadic tie strength dynamics prediction problem to infer whether social ties of a triad will become weakened after its closure. We propose a TRIST method—a kernel density estimation (KDE)-based graphical model—to solve the problem by incorporating user demographics, temporal effects, and structural information. Extensive experiments demonstrate that TRIST offers a greater than 82% potential predictability for inferring triadic tie strength dynamics in both networks. The leveraging of the KDE and structural correlations enables TRIST to outperform baselines by up to 30% in terms of F1-score.

30 April 2023
Verified
Conference Paper
Open access
XSXiran Song
Xiran Song
JLJianxun Lian
Jianxun Lian
HHHong Huang
Hong Huang
ZLZihan Luo
Zihan Luo
WZWei Zhou
Wei Zhou
HJHai Jin
Hai Jin
Graph neural networks (GNNs) have seen widespread usage across multiple real-world applications, yet in transductive learning, they still face challenges in accuracy, efficiency, and scalability, due to the extensive number of trainable parameters in the embedding table and the paradigm of stacking neighborhood aggregations. This paper presents a novel model called xGCN for large-scale network embedding, which is a practical solution for link predictions. xGCN addresses these issues by encoding graph-structure data in an extreme convolutional manner, and has the potential to push the performance of network embedding-based link predictions to a new record. Specifically, instead of assigning each node with a directly learnable embedding vector, xGCN regards node embeddings as static features. It uses a propagation operation to smooth node embeddings and relies on a Refinement neural Network (RefNet) to transform the coarse embeddings derived from the unsupervised propagation into new ones that optimize a training objective. The output of RefNet, which are well-refined embeddings, will replace the original node embeddings. This process is repeated iteratively until the model converges to a satisfying status. Experiments on three social network datasets with link prediction tasks show that xGCN not only achieves the best accuracy compared with a series of competitive baselines but also is highly efficient and scalable.

1 May 2021 in Knowledge-Based Systems
Verified
Journal Article
Closed access
YWYao Wu
Yao Wu
YSYu Song
Yu Song
HHHong Huang
Hong Huang
FYFanghua Ye
Fanghua Ye
XXXing Xie
Xing Xie
HJHai Jin
Hai Jin

23 February 2022 in IEEE Transactions on Sustainable Computing
Verified
Journal Article
Open access
HJHai Jin
Hai Jin
YWYao Wu
Yao Wu
HHHong Huang
Hong Huang
YSYu Song
Yu Song
HWHaohui Wei
Haohui Wei
XSXuanhua Shi
Xuanhua Shi
In online social networks, numerous users generate and distribute tremendous content simultaneously, and how information spreads in online society has attracted critical attention. Recent studies introduce deep learning to help mine the complex diffusion pattern and forecast the diffusion trend. However, there are two limitations of the state-of-art methods. On the one hand, existing models only focus on the internal influence within the diffusion flow but ignore the external influence from the dissemination of other contents. On the other hand, the dynamics of user interest are barely considered, while the changes of user preference for contents also have a considerable impact on future diffusion. To address these issues, we introduce the hypergraph structure and a sequential framework to model complex interactions in social networks. Then, we propose dual-channel hypergraph neural networks to tackle the diffusion prediction problem, denoted by HyperINF. Specifically, in the user channel, we build sequential user interactive hypergraphs and learn the dynamic user representation, and in the diffusion channel, we construct a diffusion interactive graph to capture the cross-diffusion relation. At last, we consider the social relation to help make the prediction. Experimental results on three datasets suggest the effectiveness and practicability of the proposed framework.

5 January 2021 in World Wide Web
Verified
Journal Article
Closed access
PDF file
WZWei Zhou
Wei Zhou
HHHong Huang
Hong Huang
QHQiang-Sheng Hua
Qiang-Sheng Hua
Dongxiao YuDongxiao Yu
Dongxiao Yu
HJHai Jin
Hai Jin
XFXiaoming Fu
Xiaoming Fu