XDXia Dong

Xia Dong

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Xia Dong has a total of 28 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Bridge Breaking for Graph Neural Networks

    by Wei Li, Jiaxing Xu, Xia Dong, Yiping Ke

  • Multi-Atlas Brain Network Classification Through Consistency Distillation and Complementary Information Fusion

    by Jiaxing Xu, Mengcheng Lan, Xia Dong, Kai He, Wei Zhang, Qingtian Bian, Yiping Ke

    Brain network analysis plays a crucial role in identifying distinctive patterns associated with neurological disorders. Functional magnetic resonance imaging (fMRI) enables the construction of brain networks by analyzing correlations in blood-oxygen-level-dependent (BOLD) signals across different brain regions, known as regions of interest (ROIs). These networks are typically constructed using atlases that parcellate the brain based on various hypotheses of functional and anatomical divisions. However, there is no standard atlas for brain network classification, leading to limitations in detecting abnormalities in disorders. Recent methods leveraging multiple atlases fail to ensure consistency across atlases and lack effective ROI-level information exchange, limiting their efficacy. To address these challenges, we propose the Atlas-Integrated Distillation and Fusion network (AIDFusion), a novel framework designed to enhance brain network classification using fMRI data. AIDFusion introduces a disentangle Transformer to filter out inconsistent atlas-specific information and distill meaningful cross-atlas connections. Additionally, it enforces subject- and population-level consistency constraints to improve cross-atlas coherence. To further enhance feature integration, AIDFusion incorporates an inter-atlas message-passing mechanism that facilitates the fusion of complementary information across brain regions. We evaluate AIDFusion on four resting-state fMRI datasets encompassing different neurological disorders. Experimental results demonstrate its superior classification performance and computational efficiency compared to state-of-the-art methods. Furthermore, a case study highlights AIDFusion's ability to extract interpretable patterns that align with established neuroscience findings, reinforcing its potential as a robust tool for multi-atlas brain network analysis. The code is publicly available at https://github.com/AngusMonroe/AIDFusion.


  • Multi-View Graph Clustering via Dual View-Cluster-Order Interactivity Mining

    by Junjie Liang, Xia Dong, Penglei Wang, Jin Xu, Danyang Wu, Feiping Nie

    Multi-view Graph Clustering (MGC) is a crucial approach for uncovering complex data structures by leveraging multiple perspectives of data. However, existing MGC methods face two key challenges: (1) limitations in graph structure that neglect long-range dependencies, and (2) overlooking the view-cluster local structure when mining view discrepancies. To address these issues, we propose a Multi-view Graph Clustering approach based on Dual View-Cluster-Order Interactivity (DVCOI-MGC). This approach consists of three modules: (1) Multi-View Multi-Order Graph Construction, where high-order graphs are generated using matrix exponentiation to capture long-range dependencies; (2) Dual View-Cluster-Order Interactivity, which utilizes a discrete graph cut model to separately learn order-specific and view-specific clustering results from the sets of order-specific multi-view graphs and view-specific multi-order graphs, with a separate View-Cluster-Order tensor weight for each learning direction; and (3) Bidirectional Truncation Consistency Learning, which applies a sparse boolean weight vector to locally select and integrate clustering results while preserving both the view-cluster and order-cluster local structures. Additionally, we introduce an efficient iterative optimization method to solve the discrete graph cut problem and provide a theoretical analysis of its convergence and computational complexity. Extensive experiments on 8 real-world datasets demonstrate that our approach significantly improves clustering performance over 11 state-of-the-art methods.


  • Joint Structured Bipartite Graph and Row-Sparse Projection for Large-Scale Feature Selection

    by Xia Dong, Feiping Nie, Danyang Wu, Rong Wang, Xuelong Li

    Feature selection plays an important role in data analysis, yet traditional graph-based methods often produce suboptimal results. These methods typically follow a two-stage process: constructing a graph with data-to-data affinities or a bipartite graph with data-to-anchor affinities and independently selecting features based on their scores. In this article, a large-scale feature selection approach based on structured bipartite graph and row-sparse projection (RS $^2$ BLFS) is proposed to overcome this limitation. RS $^2$ BLFS integrates the construction of a structured bipartite graph consisting of $c$ connected components into row-sparse projection learning with $k$ nonzero rows. This integration allows for the joint selection of an optimal feature subset in an unsupervised manner. Notably, the $c$ connected components of the structured bipartite graph correspond to $c$ clusters, each with multiple subcluster centers. This feature makes RS $^2$ BLFS particularly effective for feature selection and clustering on nonspherical large-scale data. An algorithm with theoretical analysis is developed to solve the optimization problem involved in RS $^2$ BLFS. Experimental results on synthetic and real-world datasets confirm its effectiveness in feature selection tasks.


  • Bidirectional Attentive Multi-View Clustering

    by Jitao Lu, Feiping Nie, Xia Dong, Rong Wang, Xuelong Li

    The key challenge of multi-view graph-based clustering is to mine consistent clustering structures from multiple graphs. Existing works seek clustering decisions from either multiple spectral embeddings or multiple affinity matrices, ignoring the interactions among them. To address this problem, we propose a Bidirectional Attentive Multi-view Clustering (BAMC) model to explore a consensus space w.r.t.spectral embedding and affinity matrix simultaneously, where they can promote each other to mine richer structural information from multiple graphs. BAMC is composed of a Spectral Embedding Learning (SEL) module, an Affinity Matrix Learning (AML) module, and a Bidirectional Attentive Clustering (BAC) module. SEL seeks consensus spectral embeddings by aligning the distributions of elements sampled from subspaces spanned by multiple spectral embeddings. AML learns a consensus affinity matrix from input affinity matrices. BAC guarantees consistency between the learned consensus spectral embeddings and the affinity matrix. To balance their effects, it also assigns adaptive weights to SEL and AML's objective functions. To solve the optimization problem involved in BAMC, we propose an efficient algorithm based on the Majority-Minimization framework with an ingenious surrogate problem. Extensive experiments on several synthetic and real-world datasets demonstrate the superb performance of BAMC.


  • Bidirectional Probabilistic Subspaces Approximation for Multiview Clustering

    by Danyang Wu, Xia Dong, Jianfu Cao, Rong Wang, Feiping Nie, Xuelong Li

    The existing multiview clustering models learn a consistent low-dimensional embedding either from multiple feature matrices or multiple similarity matrices, which ignores the interaction between the two procedures and limits the improvement of clustering performance on multiview data. To address this issue, a bidirectional probabilistic subspaces approximation (BPSA) model is developed in this article to learn a consistently orthogonal embedding from multiple feature matrices and multiple similarity matrices simultaneously via the disturbed probabilistic subspace modeling and approximation. A skillful bidirectional fusion strategy is designed to guarantee the parameter-free property of the BPSA model. Two adaptively weighted learning mechanisms are introduced to ensure the inconsistencies among multiple views and the inconsistencies between bidirectional learning processes. To solve the optimization problem involved in the BPSA model, an iterative solver is derived, and a rigorous convergence guarantee is provided. Extensive experimental results on both toy and real-world datasets demonstrate that our BPSA model achieves state-of-the-art performance even if it is parameter-free.


  • Discriminative Projected Clustering via Unsupervised LDA

    by Feiping Nie, Xia Dong, Zhanxuan Hu, Rong Wang, Xuelong Li

    This work focuses on the projected clustering problem. Specifically, an efficient and parameter-free clustering model, named discriminative projected clustering (DPC), is proposed for simultaneously low-dimensional and discriminative projection learning and clustering, from the perspective of least squares regression. The proposed DPC, a constrained regression model, aims at finding both a transformation matrix and a binary indicator matrix to minimize the sum-of-squares error. Theoretically, a significant conclusion is drawn and used to reveal the connection between DPC and linear discriminant analysis (LDA). Experimentally, experiments are conducted on both toy and real-world data to validate the effectiveness and efficiency of DPC; experiments are also conducted on hyperspectral images to further verify its practicability in real-world applications. Experimental results demonstrate that DPC achieves comparable or superior results to some state-of-the-art clustering methods.