Hongye Tan

Hongye Tan


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
1 January 2023
Verified
Conference Paper
Open access
PDF file
XHXiaoqi Han
Xiaoqi Han
RLRu Li
Ru Li
HTHongye Tan
Hongye Tan
WYWang Yuanlong
Wang Yuanlong
QCQinghua Chai
Qinghua Chai
JPJeff Pan
Jeff Pan
Xiaoqi Han, Ru Li, Hongye Tan, Wang Yuanlong, Qinghua Chai, Jeff Pan. Findings of the Association for Computational Linguistics: EMNLP 2023. 2023.

1 January 2024
Verified
Conference Paper
Open access
PDF file
GZGuangjun Zhang
Guangjun Zhang
HZHu Zhang
Hu Zhang
YWYuJie Wang
YuJie Wang
RLRu Li
Ru Li
HTHongye Tan
Hongye Tan
JLJiye Liang
Jiye Liang
Guangjun Zhang, Hu Zhang, YuJie Wang, Ru Li, Hongye Tan, Jiye Liang. Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2024.

12 August 2022 in Symmetry
Verified
Journal Article
Open access
PDF file
QMQianli Ma
Qianli Ma
ZFZheng Fan
Zheng Fan
CWChenzhi Wang
Chenzhi Wang
HTHongye Tan
Hongye Tan
In recent years, graph neural network algorithm (GNN) for graph semi-supervised classification has made great progress. However, in the task of node classification, the neighborhood size is often difficult to expand. The propagation of nodes always only considers the nearest neighbor nodes. Some algorithms usually approximately classify by message passing between direct (single-hop) neighbors. This paper proposes a simple and effective method, named Graph Mixed Random Network Based on PageRank (PMRGNN) to solve the above problems. In PMRGNN, we design a PageRank-based random propagation strategy for data augmentation. Then, two feature extractors are used in combination to supplement the mutual information between features. Finally, a graph regularization term is designed, which can find more useful information for classification results from neighbor nodes to improve the performance of the model. Experimental results on graph benchmark datasets show that the method of this paper outperforms several recently proposed GNN baselines on the semi-supervised node classification. In the research of over-smoothing and generalization, PMRGNN always maintains better performance. In classification visualization, it is more intuitive than other classification methods.

2 October 2020
Verified
Book Chapter
Closed access
PDF file
HTHongye Tan
Hongye Tan
BZBowen Zhang
Bowen Zhang
HZHu Zhang
Hu Zhang
RLRu Li
Ru Li

24 December 2023
Verified
Book Chapter
Closed access
PDF file
HWHongyu Wang
Hongyu Wang
PQPengpeng Qiang
Pengpeng Qiang
HTHongye Tan
Hongye Tan
JHJingchang Hu
Jingchang Hu

2 October 2020
Verified
Book Chapter
Closed access
PDF file
HTHongye Tan
Hongye Tan
PQPengpeng Qiang
Pengpeng Qiang
RLRu Li
Ru Li