Qiang Chen

Qiang Chen

Auto-generated profile, based on publicly available information

Qiang Chen

School of Computer Science, and School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xian, China

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
19 January 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
FNFeiping Nie
Feiping Nie
QCQiang Chen
Qiang Chen
WYWeizhong Yu
Weizhong Yu
XLXuelong Li
Xuelong Li
In this paper, we propose a novel algorithm to solve the row-sparse principal component analysis problem without relying on any data structure assumption. Sparse principal component analysis was proposed to improve the interpretability of principal component analysis by restricting the number of non-zero elements in each loading vector, but the varying sparsity patterns among different leading vectors may result in trouble on some occasions, such as feature selection. Then row-sparse principal component analysis was proposed, which demands the same sparse pattern among different loading vectors. However, the optimization of row-sparse principal component analysis problems is NP-hard. Although some algorithms were proposed to solve this problem, but they are only applicable to the specific data structure. In this paper, we transform the original row-sparse principal component analysis problem into a new equivalent problem that can be solved by coordinate descent method without relying on any data structure assumption. Then by carefully eliminating redundant structures to avoid repeating computation, we propose a more efficient coordinate descent method to solve this problem. Furthermore, no parameter needs to be tuned in our algorithm. Finally, extensive experiments are conducted on the real world data sets to demonstrate the superiority of our algorithm.

6 December 2022 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
QCQiang Chen
Qiang Chen
YZYu Zhao
Yu Zhao
Guanghui WenGuanghui Wen
Guanghui Wen
GSGuoqing Shi
Guoqing Shi
XYXinghuo Yu
Xinghuo Yu
In this article, both the fixed-time distributed consensus tracking and the fixed-time distributed average tracking problems for double-integrator-type multiagent systems with bounded input disturbances are studied. First, a new practical robust fixed-time sliding-mode control method based on the time-based generator is proposed. Second, two fixed-time distributed consensus tracking observers for double-integrator-type multiagent systems are designed to estimate the state disagreement between the leader and the followers under undirected and directed communication, respectively. Third, a fixed-time distributed average tracking observer for double-integrator-type multiagent systems is designed to measure the average value of multiple reference signals under undirected communication. Note that all the proposed observers are constructed with time-based generators and can be trivially extended to that for high-order integrator-type multiagent systems. Furthermore, by combining the proposed fixed-time sliding-mode control method with the information provided by the fixed-time observers, the fixed-time controllers are designed to solve the fixed-time distributed consensus tracking and the distributed average tracking problems. Finally, a few numerical simulations are shown to verify the results.

25 January 2023 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
QCQiang Chen
Qiang Chen
FNFeiping Nie
Feiping Nie
WYWeizhong Yu
Weizhong Yu
XLXuelong Li
Xuelong Li
Fuzzy c-means (FCM) is a kind of classic cluster method, which has been widely used in various fields, such as image segmentation and data mining. Euclidean distance is a frequently used distance metric in FCM, but it is only suitable for data with spherical structure. As an extension of Euclidean distance, Mahalanobis distance has been used in Gustafson-Kessel (GK) FCM and its variants to tackle ellipsoidal data. For the convenience of optimizing, most existing Mahalanobis distance based FCM algorithms only focus on squared Mahalanobis distance. However, squared Mahalanobis distance may be not the best distance metric for FCM, because it is easy to enlarge the influence of outliers. In this paper, we propose a novel $\ell _{2,p}$ -norm and Mahalanobis distance based FCM model, abbreviated as LM-FCM, which can help FCM improve the ability of tackling ellipsoidal clusters and outliers. Then, in order to reduce computational complexity we propose a more simplified model, abbreviated as SLM-FCM. Furthermore, we develop an iteratively re-weighted optimization algorithm to optimize the proposed models and provide a rigorous monotonous convergence proof. Finally, compared with existing state-of-the-art FCM algorithms, we conduct extensive experiments on both synthetic and real-world data sets to manifest the superior clustering performance and robustness of the proposed algorithms.

10 January 2020 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
QCQiang Chen
Qiang Chen
GSGuoqing Shi
Guoqing Shi
YZYu Zhao
Yu Zhao
Guanghui WenGuanghui Wen
Guanghui Wen
In the brief, the fixed-time practical distributed average tracking (DAT) problem for multiple nonlinear signals is studied, where the nonlinear signals are with bounded-and Lipschitz-type derivatives respectively. Two fixed-time practical DAT algorithms are proposed for agents with local interactions to track the average of the multiple nonlinear signals within a fixed convergence time by using time-base generator techniques. Different from existing results, the proposed DAT algorithms in this brief are applicable to DAT problems for nonlinear signals with both bounded-and Lipschitz-type derivatives, which keeps more reality. Also, the proposed fixed-time practical DAT algorithms are able to provide an explicit estimation of the upper-bounded convergence time without dependence on initial conditions. The fixed convergence time in the proposed algorithms can be adjusted more flexibly. Finally, some illustrative examples are shown to manifest the validity of the fixed-time practical DAT algorithms.

25 July 2022 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
QCQiang Chen
Qiang Chen
XZXiaowei Zhao
Xiaowei Zhao
FNFeiping Nie
Feiping Nie
RWRong Wang
Rong Wang
XLXuelong Li
Xuelong Li
Linear Discriminant Analysis (LDA) has been widely used in supervised dimensionality reduction fields. However, LDA is usually weak in tackling data with Non-Gaussian distribution due to its incapability of extracting the intrinsic structure of data. In order to learn the intrinsic information more effectively, some dimensionality reduction methods incorporate the adaptive full-connected graph into the algorithm frame, but the defect is that the calculation of each pairwise distance is very time-consuming. In this letter, we propose a novel fast adaptive local subspace learning with regressive regularization model to solve the supervised dimensional reduction problem. Firstly, the adaptive anchor point graph is used to capture local structure information, which can greatly reduce computation complexity. Secondly, by using regressive regularization, the samples from different classes can be better separated in the projected space and the workload of selecting the optimal reduced dimension is easier. Moreover, entropy regularization is used to derive more appropriate weights. Finally, extensive experiments are conducted on real world data sets to verify the superiority of our model.