Chaoqian Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Chaoqian Li has a total of 79 co-authors. Here are the top co-authors by number of shared publications:
- Yaotang Li
School of Mathematics and Statistics, Yunnan University, Kunming, China
23 shared publications Yaotang Li
School of Mathematics and Statistics, Yunnan University, Kunming, People's Republic of China
12 shared publications- Lei Gao
College of Mathematics and Computer Science, Yan’an University, Yan’an, People’s Republic of China
7 shared publications - Yimin Wei
School of Mathematical Sciences and Shanghai Key Laboratory of Contemporary Applied Mathematics, Fudan University, Shanghai, P. R. of China
6 shared publications - Fengsheng Wu
School of Mathematics and Statistics, Yunnan University, Kunming, People’s Republic of China
4 shared publications Lei Gao
School of Mathematics and Information Science, Baoji University of Arts and Sciences, Baoji, People's Republic of China
4 shared publications
Latest Publications
- Open Access
- 18 May 2026
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 19 (1)
Complex Fractional Fuzzy Tensors: A Unified Framework for Multidimensional Uncertainty Modeling and Decision-Making
- 18 May 2026
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 19 (1)
Open AccessComplex Fractional Fuzzy Tensors: A Unified Framework for Multidimensional Uncertainty Modeling and Decision-Making
- 23 February 2026
- Published by Springer Nature in Statistics and Computing
- Vol. 36 (2) , 92
An efficient iterative method for direct INDSCAL with missing values in metric multidimensional scaling
- 23 February 2026
- Published by Springer Nature in Statistics and Computing
- Vol. 36 (2) , 92
An efficient iterative method for direct INDSCAL with missing values in metric multidimensional scaling
- 10 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (6) , 8342-8355
Multi-View Clustering via Graph Regularized and One-Hot-Constrained Symmetric Nonnegative Matrix Factorization
The semi-supervised multiview clustering (MVC) methods based on non-negative matrix factorization (NMF) have attracted considerable attention due to their ability to utilize partial supervision information and significantly enhance clustering performance. Still, they often face challenges such as high computational costs and difficulties in parameter tuning. We propose a semi-supervised MVC method called Graph-Regularized and One-Hot-Constrained Symmetric NMF (MGOCS) to avoid these issues relatively. The key advantage of MGOCS includes the introduction of a parameter-free semi-supervised strategy that encodes partial label information as one-hot vectors during decomposition, the use of a shared consistency indicator matrix directly as the clustering assignment matrix for all views, and the incorporation of graph regularization terms for each view. These features effectively balance model complexity with information utilization. An iterative optimization algorithm is developed to solve MGOCS, accompanied by complexity and convergence analysis. Clustering experiments conducted on six multi-view datasets demonstrate that MGOCS outperforms various state-of-the-art methods in terms of clustering performance. The code is available at https://github.com/ljisxz/MGOCS.
- 10 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (6) , 8342-8355
Multi-View Clustering via Graph Regularized and One-Hot-Constrained Symmetric Nonnegative Matrix Factorization
The semi-supervised multiview clustering (MVC) methods based on non-negative matrix factorization (NMF) have attracted considerable attention due to their ability to utilize partial supervision information and significantly enhance clustering performance. Still, they often face challenges such as high computational costs and difficulties in parameter tuning. We propose a semi-supervised MVC method called Graph-Regularized and One-Hot-Constrained Symmetric NMF (MGOCS) to avoid these issues relatively. The key advantage of MGOCS includes the introduction of a parameter-free semi-supervised strategy that encodes partial label information as one-hot vectors during decomposition, the use of a shared consistency indicator matrix directly as the clustering assignment matrix for all views, and the incorporation of graph regularization terms for each view. These features effectively balance model complexity with information utilization. An iterative optimization algorithm is developed to solve MGOCS, accompanied by complexity and convergence analysis. Clustering experiments conducted on six multi-view datasets demonstrate that MGOCS outperforms various state-of-the-art methods in terms of clustering performance. The code is available at https://github.com/ljisxz/MGOCS.
- Open Access
- 13 January 2026
- Published by MDPI AG in Fractal and Fractional
- Vol. 10 (1) , 52
A Fractional q-Rung Orthopair Fuzzy Tensor Framework for Dynamic Group Decision-Making: Application to Smart City Renewable Energy Planning
In complex decision-making scenarios, such as smart city renewable energy project selection, decision-makers must contend with multi-dimensional uncertainty, conflicting expert opinions, and evolving temporal dynamics. This study introduces a novel Fractional q-Rung Orthopair Fuzzy Tensor (Fq-ROFT)-based group decision-making methodology that integrates the flexibility of q-rung orthopair fuzzy sets with tensorial representation and fractional-order dynamics. The proposed framework allows for the modeling of positive and negative membership degrees in a multi-dimensional, time-dependent structure while capturing memory effects inherent in expert evaluations. A detailed case study involving six renewable energy alternatives and six criteria demonstrates the method’s ability to aggregate expert opinions, compute fractional dynamic scores, and provide robust, reliable rankings. Comparative analysis with existing approaches, including classical q-ROFSs, intuitionistic fuzzy sets, and weighted sum methods, highlights the superior discriminative power, consistency, and dynamic sensitivity of the Fq-ROFT approach. Sensitivity analysis confirms the robustness of the top-ranked alternatives under variations in expert weights and fractional orders and membership perturbations. The study concludes by discussing the advantages, limitations, and future research directions of the proposed methodology, establishing Fq-ROFT as a powerful tool for dynamic, high-dimensional, and uncertain group decision-making applications.
- 13 January 2026
- Published by MDPI AG in Fractal and Fractional
- Vol. 10 (1) , 52
Open AccessA Fractional q-Rung Orthopair Fuzzy Tensor Framework for Dynamic Group Decision-Making: Application to Smart City Renewable Energy Planning
In complex decision-making scenarios, such as smart city renewable energy project selection, decision-makers must contend with multi-dimensional uncertainty, conflicting expert opinions, and evolving temporal dynamics. This study introduces a novel Fractional q-Rung Orthopair Fuzzy Tensor (Fq-ROFT)-based group decision-making methodology that integrates the flexibility of q-rung orthopair fuzzy sets with tensorial representation and fractional-order dynamics. The proposed framework allows for the modeling of positive and negative membership degrees in a multi-dimensional, time-dependent structure while capturing memory effects inherent in expert evaluations. A detailed case study involving six renewable energy alternatives and six criteria demonstrates the method’s ability to aggregate expert opinions, compute fractional dynamic scores, and provide robust, reliable rankings. Comparative analysis with existing approaches, including classical q-ROFSs, intuitionistic fuzzy sets, and weighted sum methods, highlights the superior discriminative power, consistency, and dynamic sensitivity of the Fq-ROFT approach. Sensitivity analysis confirms the robustness of the top-ranked alternatives under variations in expert weights and fractional orders and membership perturbations. The study concludes by discussing the advantages, limitations, and future research directions of the proposed methodology, establishing Fq-ROFT as a powerful tool for dynamic, high-dimensional, and uncertain group decision-making applications.
- 15 October 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 512
A subspace-orbit randomized algorithm for quaternion tensor singular value decomposition based on Qt-product
- 15 October 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 512
A subspace-orbit randomized algorithm for quaternion tensor singular value decomposition based on Qt-product
- 28 June 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 102 (1) , 425-466
An efficient algorithm for fitting the three-way GIPSCAL problem with missing values from asymmetric multidimensional scaling
- 28 June 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 102 (1) , 425-466
An efficient algorithm for fitting the three-way GIPSCAL problem with missing values from asymmetric multidimensional scaling
- 19 May 2025
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 65 (2) , 1-37
A trust-region approach for iteration solution of the direct fitting metric MDS
- 19 May 2025
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 65 (2) , 1-37
A trust-region approach for iteration solution of the direct fitting metric MDS
- Open Access
- 1 April 2025
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 41, 213-225
New sufficient conditions for subdirect sums of Nekrasov matrices
Some new sufficient conditions ensuring that the $k$-subdirect sum of strictly diagonally dominant matrices and Nekrasov matrices is in the class of Nekrasov matrices are given. These sufficient conditions are different from those in [Electron. J. Linear Algebra, 38:339-346, 2022] and [Linear Multilinear Algebra, 64:208-218, 2016; 72:1044-1055, 2023]. In addition, some examples are given to illustrate the conditions presented.
- 1 April 2025
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 41, 213-225
Open AccessNew sufficient conditions for subdirect sums of Nekrasov matrices
Some new sufficient conditions ensuring that the $k$-subdirect sum of strictly diagonally dominant matrices and Nekrasov matrices is in the class of Nekrasov matrices are given. These sufficient conditions are different from those in [Electron. J. Linear Algebra, 38:339-346, 2022] and [Linear Multilinear Algebra, 64:208-218, 2016; 72:1044-1055, 2023]. In addition, some examples are given to illustrate the conditions presented.
- 25 March 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 205 (2) , 1-33
Complex Representation Matrix of Third-Order Quaternion Tensors with Application to Video Inpainting
- 25 March 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 205 (2) , 1-33
Complex Representation Matrix of Third-Order Quaternion Tensors with Application to Video Inpainting
- Open Access
- 8 March 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (6) , 910
Partial Total Domination in Hypergraphs
This paper establishes fundamental results for partial total domination in hypergraphs. We present tight bounds for the partial total domination number in k-uniform hypergraphs, demonstrate relationships with classical domination parameters, and provide constructive proofs using hypergraph transformation techniques. Applications in sensor networks and biological systems are discussed with supporting examples. Key results include a general upper bound of for k-uniform hypergraphs without isolated vertices, verified through both analytic methods and computational examples.- 8 March 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (6) , 910
Open AccessPartial Total Domination in Hypergraphs
This paper establishes fundamental results for partial total domination in hypergraphs. We present tight bounds for the partial total domination number in k-uniform hypergraphs, demonstrate relationships with classical domination parameters, and provide constructive proofs using hypergraph transformation techniques. Applications in sensor networks and biological systems are discussed with supporting examples. Key results include a general upper bound of for k-uniform hypergraphs without isolated vertices, verified through both analytic methods and computational examples.