Jun Liang

Jun Liang


Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
6 March 2018 in Information
Verified
Journal Article
Open access
PDF file
BYBoxuan YUE
Boxuan YUE
JFJunwei Fu
Junwei Fu
JLJun Liang
Jun Liang
Recurrent neural networks (RNN) are efficient in modeling sequences for generation and classification, but their training is obstructed by the vanishing and exploding gradient issues. In this paper, we reformulate the RNN unit to learn the residual functions with reference to the hidden state instead of conventional gated mechanisms such as long short-term memory (LSTM) and the gated recurrent unit (GRU). The residual structure has two main highlights: firstly, it solves the gradient vanishing and exploding issues for large time-distributed scales; secondly, the residual structure promotes the optimizations for backward updates. In the experiments, we apply language modeling, emotion classification and polyphonic modeling to evaluate our layer compared with LSTM and GRU layers. The results show that our layer gives state-of-the-art performance, outperforms LSTM and GRU layers in terms of speed, and supports an accuracy competitive with that of the other methods.

1 September 2019 in Chemometrics and Intelligent Laboratory Systems
Verified
Journal Article
Closed access
XLXiaoyi Luo
Xiaoyi Luo
XLXianmin Li
Xianmin Li
ZWZiyang Wang
Ziyang Wang
JLJun Liang
Jun Liang

2 November 2021 in IET Intelligent Transport Systems
Verified
Journal Article
Open access
PDF file
XLXiaoyi Luo
Xiaoyi Luo
JPJiaheng Peng
Jiaheng Peng
JLJun Liang
Jun Liang
In traffic systems, traffic forecasting is a critical issue, which has attracted much interest from researchers. It is a challenging task due to the complex spatial‐temporal patterns of traffic data. Previous works focus on designing complex graph‐based neural networks to model spatial‐temporal dependencies from data. By using graphs to represent road networks, these works capture spatial patterns with graph convolutions. However, graphs cannot fully represent spatial relations from road networks. It limits the performance of graph‐based methods. In this paper, we propose a directed hypergraph neural network architecture, Directed Hypergraph Attention Network(DHAT), for traffic forecasting. Unlike previous works, DHAT introduces a directed hypergraph to represent road networks. Compared with graphs, directed hypergraphs could represent spatial information from graphs and outperform them in modeling complex directed relations among multiple nodes. Based on the directed hypergraph, a directed hypergraph convolution is proposed to exploit spatial relations among traffic series. By combining the proposed convolution and attention mechanisms, DHAT can effectively achieve promising predictions for traffic forecasting. To evaluate the performance of DHAT, we have conducted extensive experiments on four real‐world traffic datasets. Compared with other baselines, experimental results show that DHAT reduces Mean Absolute Error by 0.03–0.64 on these datasets.

2 July 2019 in Symmetry
Verified
Journal Article
Open access
PDF file
JLJun Liang
Jun Liang
LHLiang Hou
Liang Hou
ZLZhenhua Luan
Zhenhua Luan
WHWeiping Huang
Weiping Huang
Feature interaction is a newly proposed feature relevance relationship, but the unintentional removal of interactive features can result in poor classification performance for this relationship. However, traditional feature selection algorithms mainly focus on detecting relevant and redundant features while interactive features are usually ignored. To deal with this problem, feature relevance, feature redundancy and feature interaction are redefined based on information theory. Then a new feature selection algorithm named CMIFSI (Conditional Mutual Information based Feature Selection considering Interaction) is proposed in this paper, which makes use of conditional mutual information to estimate feature redundancy and interaction, respectively. To verify the effectiveness of our algorithm, empirical experiments are conducted to compare it with other several representative feature selection algorithms. The results on both synthetic and benchmark datasets indicate that our algorithm achieves better results than other methods in most cases. Further, it highlights the necessity of dealing with feature interaction.

1 February 2019 in Neurocomputing
Verified
Journal Article
Closed access
RLRuhui Liu
Ruhui Liu
WHWeiping Huang
Weiping Huang
ZFZhengshun Fei
Zhengshun Fei
KWKai Wang
Kai Wang
JLJun Liang
Jun Liang

26 September 2016 in Neural Processing Letters
Verified
Journal Article
Closed access
PDF file
JSJingyi Shen
Jingyi Shen
WHWeiping Huang
Weiping Huang
DZDongyang Zhu
Dongyang Zhu
JLJun Liang
Jun Liang