JWJun Wang

Jun Wang

*This is an algorithmically generated author record based on publicly available information.

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


Jun Wang has a total of 41 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Disagreement-Aware Multi-View Clustering With Permutation-Aligned Anchor Graphs

    by Xiao Zheng, Miaomiao Li, Chuan Tang, Jun Wang, Renxiang Guan, Chang Tang, En Zhu, Xinwang Liu

  • Threefold Consensus-Driven Anchor Alignment for Efficient Multi-View Clustering

    by Chuan Tang, Miaomiao Li, Jun Wang, Renxiang Guan, Siwei Wang, Chang Tang, En Zhu, Xinwang Liu

  • Rényi Entropy Induced Efficient and Balanced One-Step Multi-View Clustering

    by Chuan Tang, Miaomiao Li, Jun Wang, Chang Tang, En Zhu, Xinwang Liu

    Anchor-based multi-view clustering has attracted increasing interest due to its high clustering efficiency. Nevertheless, most existing methods construct a consensus anchor graph by considering only view-level contributions, neglecting the diverse significance of individual samples across different views. Additionally, these methods do not account for prior knowledge regarding the balance of sample distributions among clusters. To overcome these challenges, we propose a novel and efficient approach, named Rényi Entropy Induced Efficient and Balanced One-Step Multi-View Clustering (REIEBO). Our method introduces a sample-specific weighting strategy based on anchor self-representation learning, allowing the consensus anchor graph to better capture the sample importance disparities across views. To further enhance clustering performance, we introduce Rényi entropy as a regularization mechanism to dynamically adjust the clustering distribution by prior knowledge about sample balance. This adjustment is particularly beneficial for correctly assigning samples located near cluster boundaries. Moreover, an orthogonality constraint is imposed to directly yield final cluster assignments in a one-step fashion, effectively avoiding the information loss in conventional two-stage frameworks. Extensive experiments demonstrate that our method consistently outperforms state-of-the-art multi-view clustering methods. The code of REIEBO is publicly available at https://github.com/tangchuan2000/REIEBO.


  • Balanced Multi-view Clustering

    by Zhenglai Li, Jun Wang, Chang Tang, Xinzhong Zhu, Wei Zhang, Xinwang Liu

    Multi-view clustering (MvC) aims to integrate information from different views to enhance the capability of the model in capturing the underlying data structures. The widely used joint training paradigm in MvC potentially does not fully leverage the multi-view information, due to the imbalanced and under-optimized view-specific features caused by the uniform learning objective for all views. For instance, particular views with more discriminative information could dominate the learning process in the joint training paradigm, leading to other views being under-optimized. To alleviate this issue, we first analyze the imbalanced phenomenon in the joint-training paradigm of multi-view clustering from the perspective of gradient descent for each view-specific feature extractor. Then, we propose a novel balanced multi-view clustering (BMvC) method, which introduces a view-specific contrastive regularization (VCR) to modulate the optimization of each view. Concretely, VCR preserves the sample similarities captured from the joint features and view-specific ones into the clustering distributions corresponding to view-specific features to enhance the learning process of view-specific feature extractors. Additionally, an analysis is provided to illustrate that VCR adaptively modulates the magnitudes of gradients for updating the parameters of view-specific feature extractors to achieve a balanced multi-view learning procedure. In such a manner, BMvC achieves a better trade-off between the exploitation of view-specific patterns and the exploration of view-invariance patterns to fully learn the multi-view information for the clustering task. Finally, a set of experiments are conducted to verify the superiority of the proposed method compared with state-of-the-art approaches both on eight benchmark MvC datasets and two spatially resolved transcriptomics datasets. The demo code of this work is publicly available at https://github.com/guanyuezhen/BMvC.


  • Tensor Multi-Rank Constraint Guided Anchor-Wise Adaptive Alignment for Multi-View Clustering

    by Jun Wang, Miaomiao Li, Zhenglai Li, Hao Yu, Suyuan Liu, Dayu Hu, Chang Tang, Xinwang Liu

    Anchor graph learning has become a widely used technique for significantly reducing the computational complexity in existing multi-view clustering methods. However, most existing approaches select anchors independently for each view and then generate the consensus graph by directly fusing all anchor graphs. This process overlooks the correspondence between anchor sets across different views, i.e., the column order correspondence of the anchor graphs. To address this limitation, we propose a novel anchor-based tensor multi-rank constraint multi-view clustering method (TMC). Specifically, TMC captures the high-order structural information of the original data by constructing an anchor graph tensor and enforcing a multi-rank constraint to induce a block-diagonal structure. Additionally, to enhance anchor consistency across all view, we construct the anchor graph of each view into an anchor tensor and impose a low-rank constraint on it. In this way, the block-diagonal structure of each anchor graph maintains an approximate alignment between anchors. Furthermore, we provide theoretical proof that the generated anchor graphs inherently exhibit a block-diagonal structure. Extensive experimental results on six multi-view datasets demonstrate that TMC outperforms existing state-of-the-art methods, highlighting its effectiveness in multi-view clustering task.


  • Sample-Level Weighted and Structure-Enhanced Anchor Graph Learning for Scalable Multi-View Clustering

    by Chuan Tang, Miaomiao Li, Jun Wang, Chang Tang, En Zhu, Xinwang Liu

    The anchor-based multi-view clustering method has recently attracted considerable attention due to its superior efficiency. However, most existing methods construct a consensus anchor graph based solely on view-level contributions, overlooking the varying importance of individual samples across different views. Moreover, these methods fail to ensure that anchors are evenly distributed across clusters. Thus, we propose a novel and scalable multi-view clustering method, called Sample-Level Weighted and Structure-Enhanced Anchor Graph Learning for Scalable Multi-View Clustering (SLWSE-AGL). Specifically, we introduce a sample-level weighting mechanism based on anchor self-representation learning, enabling the constructed consensus anchor graph to capture the varying importance of samples in different views. Additionally, we incorporate a structure-enhancement constraint to encourage the learned anchors to be more evenly distributed among clusters, leading to more balanced and meaningful cluster partitions. Furthermore, we employ an anchor-to-sample label propagation mechanism that directly yields the final clustering results, thereby avoiding the information loss associated with the two-stage clustering processes. Extensive experiments demonstrate the superior performance of our method compared to state-of-the-art multi-view clustering approaches. The code of SLWSE-AGL is publicly available at https://github.com/tangchuan2000/SLWSE-AGL.


  • Align Then Tensorize: Multi-Level Consistent Anchor Graph Learning for Scalable Multi-View Clustering

    by Chuan Tang, Miaomiao Li, Jun Wang, Renxiang Guan, Siwei Wang, Chang Tang, En Zhu, Xinwang Liu

    Tensor-based multi-view clustering has been widely studied to capture high-order correlations among multiple views. Nevertheless, existing tensorial methods still exhibit several limitations. First, many approaches rely on full similarity graphs, leading to quadratic or cubic complexity in the number of samples and poor scalability. Second, view-specific anchor graphs are often tensorized without cross-view anchor alignment, yielding structurally inconsistent tensor representations and reduced cross-view comparability. Third, low-rank regularization is typically imposed via the tensor nuclear norm (TNN), which uniformly shrinks singular values and may bias the estimation of the intrinsic tensor rank. To this end, we propose a novel framework, named Align then Tensorize: Multi-level Consistent Anchor Graph Learning for Scalable Multi-View Clustering (ATTMVC). It adopts an anchor-based graph learning framework in which each view is reconstructed from a small set of anchors with sample-wise sparse noise, substantially reducing computational complexity. Unlike existing tensor-based methods that directly tensorize unaligned view-wise anchor graphs, ATTMVC first aligns view-specific anchor graphs into a shared latent space, thereby enforcing structural consistency across views and enabling more reliable modeling of cross-view higher-order correlations. Furthermore, we introduce a Threshold Tensor Rank (TTR) surrogate on the aligned anchor graph tensor, which effectively promotes low-rank structure while mitigating the over-shrinking effect commonly caused by TNN-based regularization. Finally, extensive experiments demonstrate that ATTMVC outperforms state-of-the-art multi-view clustering methods. The code is publicly available at https://github.com/tangchuan2000/ATTMVC.


  • Two Decades of Multi-View Clustering: Taxonomy, Application, and Challenge

    by Xinwang Liu, Ke Liang, Jun Wang, Suyuan Liu, Xiangke Wang, Huaimin Wang

    Multi-view clustering (MVC), as an important machine learning task, aims to group data into distinct groups by leveraging complementary and consistent information across multiple views. During the last two decades, it has been widely studied, and many methods have been proposed, which has brought incredible development to this field. However, few works comprehensively summarize existing methods and point out the potential challenges in this field for the next decades. To this end, our survey thoroughly reviews existing MVC methods according to three taxonomies, i.e., techniques, fusion strategies, and scenarios. Specifically, seven typical techniques, four fusion strategies, and five typical scenarios are included. Besides, we also collect the commonly used datasets and analyze the performance of typical MVC methods. Moreover, we summarize six application scenarios of existing MVC methods ranging from computer vision, and information retrieval tasks to medical diagnosis and bio-informatics. In particular, we point out seven interesting future directions in this field, which will definitely enlighten the readers.


  • Single-Cell Multi-View Clustering via Community Detection With Unknown Number of Clusters

    by Dayu Hu, Renxiang Guan, Zhibin Dong, Ke Liang, Jun Wang, Siwei Wang, Xinwang Liu

    Single-cell multi-view clustering enables the exploration of cellular heterogeneity within the same cell from different views. Despite the development of several multi-view clustering methods, two primary challenges persist. Firstly, most existing methods treat the information from both single-cell RNA (scRNA) and single-cell Assay of Transposase Accessible Chromatin (scATAC) views as equally significant, overlooking the substantial disparity in data richness between the two views. This oversight frequently leads to a degradation in overall performance. Additionally, the majority of clustering methods necessitate manual specification of the number of clusters by users. However, for biologists dealing with cell data, precisely determining the number of distinct cell types poses a formidable challenge. To this end, we introduce scUNC, an innovative multi-view clustering approach tailored for single-cell data, which seamlessly integrates information from different views without the need for a predefined number of clusters. The scUNC method comprises several steps: initially, it employs a cross-view fusion network to create an effective embedding, which is then utilized to generate initial clusters via community detection. Subsequently, the clusters are automatically merged and optimized until no further clusters can be merged. We conducted a comprehensive evaluation of scUNC using six distinct single-cell datasets. The results underscored that scUNC outperforms the other baseline methods. The code can be publicly accessed in the repository at https://github.com/DayuHuu/scUNC.


  • Multi-View Clustering via High-Order Bipartite Graph Learning and Tensor Low-Rank Representation

    by Chuan Tang, Miaomiao Li, Jun Wang, Chang Tang, Jiahe Jiang, Tianyi Wang, En Zhu, Xinwang Liu

    Graph-based multi-view clustering methods have demonstrated satisfying performance by effectively capturing relationships among data samples. However, most existing methods primarily emphasize direct pairwise relationships, neglecting the exploration of high-order correlations present within each view. To this end, a novel approach, called multiview clustering via high-order bipartite graph learning and tensor low-rank representation (HBGTLRR), is proposed. Specifically, we first construct high-order bipartite graphs to capture latent relationships and concatenate them into a tensor. By applying tensor nuclear norm (TNN) minimization, we obtain a low-rank representation that reduces noise and preserves high-order consistency. Subsequently, a consensus graph is constructed by adaptively fusing the high-order bipartite graphs with corresponding weights, and then a Laplacian low-rank constraint is imposed on it to effectively capture the intrinsic data structure. Finally, extensive experimental results show that HBGTLRR significantly outperforms existing methods, thereby validating the effectiveness of our proposed method.