Qian Qu

Qian Qu

Auto-generated profile, based on publicly available information

Qian Qu

College of Computer Science and Technology, National University of Defense Technology, Changsha, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
4 December 2024 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
XWXinhang Wan
Xinhang Wan
JLJiyuan Liu
Jiyuan Liu
HYHao Yu
Hao Yu
QQQian Qu
Qian Qu
ALAo Li
Ao Li
EZEn Zhu
En Zhu
Multiview clustering thrives in applications where views are collected in advance by extracting consistent and complementary information among views. However, it overlooks scenarios where data views are collected sequentially, i.e., real-time data. Due to privacy issues or memory burden, previous views are not available with time in these situations. Some methods are proposed to handle it but are trapped in a stability-plasticity dilemma. In specific, these methods undergo a catastrophic forgetting of prior knowledge when a new view is attained. Such a catastrophic forgetting problem (CFP) would cause the consistent and complementary information hard to get and affect the clustering performance. To tackle this, we propose a novel method termed contrastive continual multiview clustering with filtered structural fusion (CCMVC-FSF). Precisely, considering that data correlations play a vital role in clustering and prior knowledge ought to guide the clustering process of a new view, we develop a data buffer to store filtered structural information and utilize it to guide the generation of a robust partition matrix via contrastive learning. Additionally, to address the high complexity involved in acquiring and storing structural information, we propose a sampling strategy called clustering then sample. Furthermore, we theoretically connect CCMVC-FSF with semisupervised learning and knowledge distillation. Extensive experiments exhibit the excellence of the proposed method. Our code is publicly available at https://github.com/wanxinhang/CCMVC-FSF/.

28 October 2024
Verified
Conference Paper
Open access
QQQian Qu
Qian Qu
XWXinhang Wan
Xinhang Wan
WLWeixuan Liang
Weixuan Liang
JLJiyuan Liu
Jiyuan Liu
YFYu Feng
Yu Feng
EZEn Zhu
En Zhu
The rapid development of multi-media techniques boosts the emergence of multi-view data, and how to uncover its intrinsic structure and utilize it to conduct the subsequent downstream tasks is crucial in data analysis. Multi-view clustering is representative of handling multi-view data. The anchor-based method has received widespread attention for excellent performance and low time complexity. However, existing methods encounter two drawbacks, cutting down their performance, i.e., the assumption of the availability of all views and limited interaction of anchor generation among views. In some scenes, views arrive sequentially, and storing them is challenging owing to the limited space/privacy considerations, and the existing anchor-based MVC is unsuitable for this. Additionally, recent works fail to generate anchors with the guidance of other views, and it is tough to align the anchor graphs. To this end, we propose A Lightweight Anchor-Based Incremental Framework for Multi-view Clustering. Specifically, we first initialize an anchor graph with the assistance of k-means when a new view arrives. Then, the consensus one of the anchor graph is updated by the newly collected view with a permutation matrix. Our proposed method is more capable of anchor alignment because, in incremental MVC, the anchor graphs of previous views could be listed as a reference to guide the generation of anchor graphs of the coming view. Furthermore, we design a three-step iterative and convergent algorithm to address the resultant problem. Notably, the proposed algorithm shows outstanding effectiveness and time/space efficiency in extensive experiments.

25 September 2025 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
QQQian Qu
Qian Qu
XWXinhang Wan
Xinhang Wan
JLJiyuan Liu
Jiyuan Liu
XLXinwang Liu
Xinwang Liu
EZEn Zhu
En Zhu
Multi-view clustering (MVC) has emerged as a powerful tool for analyzing complex datasets by leveraging consistent and complementary information from multiple sources. However, MVC faces three critical challenges in real-world scenarios: (1) Sample-level misalignment due to unknown cross-view correspondence, which introduces noisy correlations, (2) Feature-level heterogeneity from divergent dimensional spaces across views obscuring shared discriminative patterns, and (3) Dynamic-view inefficiency when integrating sequentially arriving data under privacy or sensor constraints. These challenges collectively hinder the clustering performance of existing studies, thus giving rise to a unified framework. To bridge this gap, we propose ASIA-MVC, an anchor-guided sample-and-feature incremental alignment framework for MVC, which is the first attempt in incremental learning on sample-unpaired multi-view data. First, the sample alignment module dynamically maps unpaired samples across views via anchor-based bipartite graphs. Second, the feature-aligned module employs an orthogonal decomposition strategy to unify heterogeneous feature spaces while preserving discriminative structures. Third, the novel incremental fusion framework integrates the dual-aligned modules under the guidance of shared anchors, enabling efficient cross-view representation learning. Furthermore, to solve the resulting problem, we develop a novel three-step alternate optimization algorithm with guaranteed convergence. Finally, the proposed method is validated in extensive experiments and achieves leading cluster efficiency and an outstanding sample-aligned effect.