Zhiyong Ding
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhiyong Ding has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Haibin Xie
National University of Defense Technology
2 shared publications - Xin Xu
National University of Defense Technology
2 shared publications Haibin Xie
College of Intelligence Science and Technology National University of Defense Technology Changsha China
1 shared publication- Jiabao Cui
College of Computer Science and Technology, Zhejiang University, Hangzhou, China
1 shared publication Peng Li
College of Intelligence Science and Technology National University of Defense Technology Changsha China
1 shared publication- Peng Li
School of Computer Science and Technology, Dalian University of Technology, Dalian, China and Key Laboratory of Social Computing and Cognitive Intelligence (Dalian University of Technology), Dalian, China
1 shared publication
Latest Publications
- Open Access
- 21 September 2026
- Published by Elsevier in SSRN Electronic Journal
A Local-Density Structural Developmental Neural Network for Online Incremental Clustering
Discovering the evolving class structure of a data stream is a prerequisite for autonomous systems in open environments, where samples arrive one at a time, cannot be revisited, lack annotations, and belong to an unknown, time-varying number of classes. Clustering such streams demands both accurate local distribution modeling and reliable global cluster structure identification within single-pass processing, yet reconciling both objectives remains challenging for existing methods. This paper proposes the local-density structural developmental neural network (LDSDNN), which unifies the two aspects within the developmental process of neurons. Each neuron models its region as an anisotropic Gaussian whose ellipsoidal coverage, defined through the Mahalanobis distance and χ² confidence regions, fits clusters of arbitrary orientation and eccentricity. Inspired by lateral inhibition in biological nervous systems, global structure identification is recast as an online frequency competition in which only neurons at genuine density peaks mature into confirmed clusters, while a volume-based merging mechanism consolidates redundant neurons arising from incremental covariance estimation. Experiments on two synthetic and three real-world datasets show that LDSDNN improves test-set accuracy by up to 26.1 percentage points over the best competing single-phase method, runs one to two orders of magnitude faster than two-phase methods at comparable accuracy, and maintains a compact network whose size tracks the intrinsic complexity of the data.
- 21 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Local-Density Structural Developmental Neural Network for Online Incremental Clustering
Discovering the evolving class structure of a data stream is a prerequisite for autonomous systems in open environments, where samples arrive one at a time, cannot be revisited, lack annotations, and belong to an unknown, time-varying number of classes. Clustering such streams demands both accurate local distribution modeling and reliable global cluster structure identification within single-pass processing, yet reconciling both objectives remains challenging for existing methods. This paper proposes the local-density structural developmental neural network (LDSDNN), which unifies the two aspects within the developmental process of neurons. Each neuron models its region as an anisotropic Gaussian whose ellipsoidal coverage, defined through the Mahalanobis distance and χ² confidence regions, fits clusters of arbitrary orientation and eccentricity. Inspired by lateral inhibition in biological nervous systems, global structure identification is recast as an online frequency competition in which only neurons at genuine density peaks mature into confirmed clusters, while a volume-based merging mechanism consolidates redundant neurons arising from incremental covariance estimation. Experiments on two synthetic and three real-world datasets show that LDSDNN improves test-set accuracy by up to 26.1 percentage points over the best competing single-phase method, runs one to two orders of magnitude faster than two-phase methods at comparable accuracy, and maintains a compact network whose size tracks the intrinsic complexity of the data.
- 11 April 2024
- Published by Elsevier in Neurocomputing
- Vol. 587
An enhanced structural developmental neural network with information saturation for continual unsupervised learning
- 11 April 2024
- Published by Elsevier in Neurocomputing
- Vol. 587
An enhanced structural developmental neural network with information saturation for continual unsupervised learning
- Open Access
- 1 February 2023
- Published by Institution of Engineering and Technology (IET) in CAAI Transactions on Intelligence Technology
- Vol. 8 (3) , 780-795
A structural developmental neural network with information saturation for continual unsupervised learning
In this paper, we propose a structural developmental neural network to address the plasticity‐stability dilemma, computational inefficiency, and lack of prior knowledge in continual unsupervised learning. This model uses competitive learning rules and dynamic neurons with information saturation to achieve parameter adjustment and adaptive structure development. Dynamic neurons adjust the information saturation after winning the competition and use this parameter to modulate the neuron parameter adjustment and the division timing. By dividing to generate new neurons, the network not only keeps sensitive to novel features but also can subdivide classes learnt repeatedly. The dynamic neurons with information saturation and division mechanism can simulate the long short‐term memory of the human brain, which enables the network to continually learn new samples while maintaining the previous learning results. The parent‐child relationship between neurons arising from neuronal division enables the network to simulate the human cognitive process that gradually refines the perception of objects. By setting the clustering layer parameter, users can choose the desired degree of class subdivision. Experimental results on artificial and real‐world datasets demonstrate that the proposed model is feasible for unsupervised learning tasks in instance increment and class increment scenarios and outperforms prior structural developmental neural networks.
- 1 February 2023
- Published by Institution of Engineering and Technology (IET) in CAAI Transactions on Intelligence Technology
- Vol. 8 (3) , 780-795
Open AccessA structural developmental neural network with information saturation for continual unsupervised learning
In this paper, we propose a structural developmental neural network to address the plasticity‐stability dilemma, computational inefficiency, and lack of prior knowledge in continual unsupervised learning. This model uses competitive learning rules and dynamic neurons with information saturation to achieve parameter adjustment and adaptive structure development. Dynamic neurons adjust the information saturation after winning the competition and use this parameter to modulate the neuron parameter adjustment and the division timing. By dividing to generate new neurons, the network not only keeps sensitive to novel features but also can subdivide classes learnt repeatedly. The dynamic neurons with information saturation and division mechanism can simulate the long short‐term memory of the human brain, which enables the network to continually learn new samples while maintaining the previous learning results. The parent‐child relationship between neurons arising from neuronal division enables the network to simulate the human cognitive process that gradually refines the perception of objects. By setting the clustering layer parameter, users can choose the desired degree of class subdivision. Experimental results on artificial and real‐world datasets demonstrate that the proposed model is feasible for unsupervised learning tasks in instance increment and class increment scenarios and outperforms prior structural developmental neural networks.
- 16 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 33-38
Evolutionary Parameter-Free Clustering Algorithm
The performance of the clustering algorithms depends mainly on the setting of artificial parameter values which is usually difficult in practical application. In addition, the dataset is usually incremental, and the clustering algorithm applied to the static dataset cannot develop with the change of the dataset. If new sample points are added, algorithm parameters need to be readjusted to cluster again, leading to a great time cost. This paper proposed an evolutionary parameter-free clustering algorithm (EPFC) for the above problems, which imitates the human clustering mechanism of objective things. EPFC algorithm takes the average distance between each sample and its nearest neighbour sample as the threshold value to judge whether the sample can be grouped into one cluster. The threshold value is adaptively updated without setting an artificially parameter value as the samples increase. A large number of experiments on benchmark datasets show that EPFC is effective on datasets with different characteristics, and the algorithm has strong robustness.
- 16 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 33-38
Evolutionary Parameter-Free Clustering Algorithm
The performance of the clustering algorithms depends mainly on the setting of artificial parameter values which is usually difficult in practical application. In addition, the dataset is usually incremental, and the clustering algorithm applied to the static dataset cannot develop with the change of the dataset. If new sample points are added, algorithm parameters need to be readjusted to cluster again, leading to a great time cost. This paper proposed an evolutionary parameter-free clustering algorithm (EPFC) for the above problems, which imitates the human clustering mechanism of objective things. EPFC algorithm takes the average distance between each sample and its nearest neighbour sample as the threshold value to judge whether the sample can be grouped into one cluster. The threshold value is adaptively updated without setting an artificially parameter value as the samples increase. A large number of experiments on benchmark datasets show that EPFC is effective on datasets with different characteristics, and the algorithm has strong robustness.