Tao Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Tao Yang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Hongsen He
School of Information and Control Engineering, Southwest University of Science and Technology, Mianyang, China
3 shared publications - Yi Yu
School of Information and Control Engineering, Southwest University of Science and Technology, Mianyang, China
3 shared publications - Bin Wu
School of Information Engineering, Southwest University of Science and Technology, Mianyang, China
2 shared publications - Ke Li
Southwest University of Science and Technology
2 shared publications - Rodrigo C. de Lamare
Centre for Telecommunications Studies, Pontifical Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil
2 shared publications - Xueyuan Wang
School of Information Engineering, Southwest University of Science and Technology, Mianyang, China
2 shared publications
Latest Publications
- 12 March 2026
- Published by Springer Nature in Applied Intelligence
- Vol. 56 (5)
Anchor-based tensor clustering of multi-view data through high order relational fusion
- 12 March 2026
- Published by Springer Nature in Applied Intelligence
- Vol. 56 (5)
Anchor-based tensor clustering of multi-view data through high order relational fusion
- 3 September 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (12) , 8074-8090
Affine Projection Algorithms with Novel Schemes of Variable Projection Order
- 3 September 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (12) , 8074-8090
Affine Projection Algorithms with Novel Schemes of Variable Projection Order
- 29 July 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (11) , 7401-7421
Switching Step-Size Based Widely Linear Adaptive Filtering Algorithms
- 29 July 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (11) , 7401-7421
Switching Step-Size Based Widely Linear Adaptive Filtering Algorithms
- 10 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 70 (1) , 3279-3288
Multi-View Comprehensive Graph Clustering
Multi-view clustering algorithms have been successfully used in different consumer electronic products, such as common digital cameras and unmanned vehicles. Currently, existing multi-view graph clustering (MVGC) methods learn the similarity of directly connected samples for clustering. However, these MVGC methods can not fully consider the indirect relation among samples and high-order relation across multi-view data. In this paper, a new multi-view comprehensive graph clustering (MCGC) method is devised, which can fully learn the similarity based on (1) first-order proximity (FOP) (i.e. the direct relation of pairwise samples); (2) second-order proximity (SOP) (i.e. the indirect relation of pairwise samples); and (3) third-order proximity (TOP) (i.e. the three-order relation of multiple views). Since the operations of these three components are iteratively carried out, the interaction between similarity learning can be encouraged and the comprehensive graph can be generated effectively for clustering. In-depth experiments on six commonly benchmark datasets show the superiority of the MCGC method.
- 10 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 70 (1) , 3279-3288
Multi-View Comprehensive Graph Clustering
Multi-view clustering algorithms have been successfully used in different consumer electronic products, such as common digital cameras and unmanned vehicles. Currently, existing multi-view graph clustering (MVGC) methods learn the similarity of directly connected samples for clustering. However, these MVGC methods can not fully consider the indirect relation among samples and high-order relation across multi-view data. In this paper, a new multi-view comprehensive graph clustering (MCGC) method is devised, which can fully learn the similarity based on (1) first-order proximity (FOP) (i.e. the direct relation of pairwise samples); (2) second-order proximity (SOP) (i.e. the indirect relation of pairwise samples); and (3) third-order proximity (TOP) (i.e. the three-order relation of multiple views). Since the operations of these three components are iteratively carried out, the interaction between similarity learning can be encouraged and the comprehensive graph can be generated effectively for clustering. In-depth experiments on six commonly benchmark datasets show the superiority of the MCGC method.
- Open Access
- 18 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 54221-54234
Robust Kernelized Multiview Clustering Based on High-Order Similarity Learning
This paper explores the robust kernelized multi-view clustering (MVC) for nonlinear data. The existing MVC methods aim to excavate the complementary and consensus information from multi-view data lies in the linear space for clustering. However, in real-world scenarios, data points usually lie in multiple nonlinear spaces, leading to undesirable clustering results. To this end, we propose a robust kernelized MVC method based on high-order similarity learning (RKHSL), to jointly learn the local structure affinities in original space, the nonlinear affinities in mapping kernel space, and the high-order correlations in tensor space. Specifically, the first-order similarity (FOS) is learned to excavate the local structure affinities and the second-order similarity (SOS) is learned in the high-dimensional kernel space to excavate the nonlinear affinities of data points. Afterwards, the third-order similarity (TOS) based on low-rank tensor is learned to excavate the global consistency from multiple views. Extensive experiments on five commonly benchmark datasets show that the proposed method outperforms state-of-the-art methods in most scenarios and is capable of revealing a reliable affinity graph structure concealed in different data points.
- 18 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 54221-54234
Open AccessRobust Kernelized Multiview Clustering Based on High-Order Similarity Learning
This paper explores the robust kernelized multi-view clustering (MVC) for nonlinear data. The existing MVC methods aim to excavate the complementary and consensus information from multi-view data lies in the linear space for clustering. However, in real-world scenarios, data points usually lie in multiple nonlinear spaces, leading to undesirable clustering results. To this end, we propose a robust kernelized MVC method based on high-order similarity learning (RKHSL), to jointly learn the local structure affinities in original space, the nonlinear affinities in mapping kernel space, and the high-order correlations in tensor space. Specifically, the first-order similarity (FOS) is learned to excavate the local structure affinities and the second-order similarity (SOS) is learned in the high-dimensional kernel space to excavate the nonlinear affinities of data points. Afterwards, the third-order similarity (TOS) based on low-rank tensor is learned to excavate the global consistency from multiple views. Extensive experiments on five commonly benchmark datasets show that the proposed method outperforms state-of-the-art methods in most scenarios and is capable of revealing a reliable affinity graph structure concealed in different data points.
- 1 January 2021
- Published by Elsevier in Signal Processing
- Vol. 178
Sparsity-aware SSAF algorithm with individual weighting factors: Performance analysis and improvements in acoustic echo cancellation
- 1 January 2021
- Published by Elsevier in Signal Processing
- Vol. 178
Sparsity-aware SSAF algorithm with individual weighting factors: Performance analysis and improvements in acoustic echo cancellation
- Open Access
Study of Diffusion Normalized Least Mean M-estimate Algorithms
This work proposes diffusion normalized least mean M-estimate algorithm based on the modified Huber function, which can equip distributed networks with robust learning capability in the presence of impulsive interference. In order to exploit the system's underlying sparsity to further improve the learning performance, a sparse-aware variant is also developed by incorporating the $l_0$-norm of the estimates into the update process. We then analyze the transient, steady-state and stability behaviors of the algorithms in a unified framework. In particular, we present an analytical method that is simpler than conventional approaches to deal with the score function since it removes the requirements of integrals and Price's theorem. Simulations in various impulsive noise scenarios show that the proposed algorithms are superior to some existing diffusion algorithms and the theoretical results are verifiable.
Open AccessStudy of Diffusion Normalized Least Mean M-estimate Algorithms
This work proposes diffusion normalized least mean M-estimate algorithm based on the modified Huber function, which can equip distributed networks with robust learning capability in the presence of impulsive interference. In order to exploit the system's underlying sparsity to further improve the learning performance, a sparse-aware variant is also developed by incorporating the $l_0$-norm of the estimates into the update process. We then analyze the transient, steady-state and stability behaviors of the algorithms in a unified framework. In particular, we present an analytical method that is simpler than conventional approaches to deal with the score function since it removes the requirements of integrals and Price's theorem. Simulations in various impulsive noise scenarios show that the proposed algorithms are superior to some existing diffusion algorithms and the theoretical results are verifiable.
- 30 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 2199-2214
Diffusion Normalized Least Mean M-estimate Algorithms: Design and Performance Analysis
This work proposes diffusion normalized least mean M-estimate algorithm based on the modified Huber function, which can equip distributed networks with robust learning capability in the presence of impulsive interference. In order to exploit the underlying sparsity of systems and to further improve the learning performance, a sparse variant is also developed by combining the $l_{0}$ -norm of the estimates into the update process. We then carry out an analysis of the transient, steady-state and stability behaviors of the algorithms in a unified framework. In particular, we employ an analytical method that is simpler than conventional approaches to deal with the score function since it removes the requirements of integrals and Price's theorem. Simulations in impulsive noise environments show that the proposed algorithms are superior to some existing diffusion algorithms and the theoretical results are verifiable.- 30 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 2199-2214
Diffusion Normalized Least Mean M-estimate Algorithms: Design and Performance Analysis
This work proposes diffusion normalized least mean M-estimate algorithm based on the modified Huber function, which can equip distributed networks with robust learning capability in the presence of impulsive interference. In order to exploit the underlying sparsity of systems and to further improve the learning performance, a sparse variant is also developed by combining the $l_{0}$ -norm of the estimates into the update process. We then carry out an analysis of the transient, steady-state and stability behaviors of the algorithms in a unified framework. In particular, we employ an analytical method that is simpler than conventional approaches to deal with the score function since it removes the requirements of integrals and Price's theorem. Simulations in impulsive noise environments show that the proposed algorithms are superior to some existing diffusion algorithms and the theoretical results are verifiable.- 1 July 1998
- Published by World Scientific Pub Co Pte Ltd in International Journal of Bifurcation and Chaos
- Vol. 08 (07) , 1557-1564
Impulsive Control of Nonautonomous Chaotic Systems using Practical Stabilization
In this paper, we use the concept of practical stabilization of impulsive differential equations for controlling nonautonomous chaotic systems. Instead of controlling a chaotic system to a point as in the case of asymptotic stabilization, the aim of practical control is to stabilize a chaotic system into a small region of phase space. This method is useful to control a chaotic system into a prescribed region. We present the theory of controlling a nonautonomous chaotic system into a small region around the origin and illustrate the method on Duffing's oscillator.
- 1 July 1998
- Published by World Scientific Pub Co Pte Ltd in International Journal of Bifurcation and Chaos
- Vol. 08 (07) , 1557-1564
Impulsive Control of Nonautonomous Chaotic Systems using Practical Stabilization
In this paper, we use the concept of practical stabilization of impulsive differential equations for controlling nonautonomous chaotic systems. Instead of controlling a chaotic system to a point as in the case of asymptotic stabilization, the aim of practical control is to stabilize a chaotic system into a small region of phase space. This method is useful to control a chaotic system into a prescribed region. We present the theory of controlling a nonautonomous chaotic system into a small region around the origin and illustrate the method on Duffing's oscillator.