MLMiaomiao Li

Miaomiao Li

*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


Miaomiao Li has a total of 102 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Dynamic Late Fusion Multiple Kernel k -means Clustering based on Adaptive Sample Selection and Alignment

    by Zhirong Tian, Yi Zhang, Weixuan Liang, Miaomiao Li, Xinwang Liu

  • 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

  • Top Cited Papers

    Toward Scalable Multi-View Clustering Without Predefined Clusters via Inter-Anchor Graph Learning

    by Suyuan Liu, Lijun Zhang, Siwei Wang, Miaomiao Li, Xueling Zhu, Xinwang Liu

    Multi-view clustering aims to leverage complementary information from multiple data sources to improve clustering quality. Traditional graph-based Non-k multi-view clustering methods enable automatic cluster number determination but suffer from severe scalability issues due to their reliance on constructing large sample-level affinity graphs with quadratic complexity. To address this limitation, we propose a novel scalable Non-k Multi-View Clustering framework via Inter-Anchor Graph learning (MVC-IAG). Our method first extracts a small set of representative anchors via k-means on concatenated multi-view features, then learns a unified inter-anchor graph by integrating multi-view structural information and feature similarity priors. Our framework performs Non-k cluster discovery directly on this compact, learned inter-anchor graph, thereby enabling automatic cluster number determination, and subsequently propagates the results to all samples. Extensive experiments on multiple large scale datasets demonstrate that MVC-IAG significantly reduces computational cost while achieving competitive or superior clustering performance compared to state-of-the-art Non-k multi view clustering approaches.


  • 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.


  • Dictionary Multi-Modal Temporal Graph Learning

    by Meng Liu, Ke Liang, Miaomiao Li, Xueling Zhu, Xinwang Liu

    Temporal graph learning focuses on graph deep learning in real-world dynamic scenarios, which uses interaction sequence instead of adjacency matrix to observe the graph dynamic changes more microscopically from the perspective of time evolution. However, current temporal graph methods only focus on extra dynamic information, ignoring the large amount of multi-modal information contained in the real world. These information can reflect the rich changes in the real world from different perspectives. Ignoring them means that temporal graph learning still lacks the ability to restore and mine more complex real-world data. We argue that the main challenges causing the above phenomenon in temporal graph learning are the lack of multi-modal architecture and public multi-modal datasets. To solve the above challenges, we propose ModalTGL, which enhances the computational efficiency of the model in complex dynamic scenarios by introducing the dictionary graph network, and achieves multi-modal fusion by embedding tuning. In addition, we also discuss the effects of different time encoding functions on dynamic information preservation. At the data level, we build several multi-modal temporal graph datasets from different areas, and compare with multiple SOTA methods on these datasets. The experimental results verify the effectiveness of the ModalTGL method, achieving the performance improvement of up to 18.48%. Code and data can be obtained from https://github.com/MGitHubL/ModalTGL.


  • Enhancing Anchor Representativeness and Stability in Scalable Multi-View Clustering with Prior Guidance

    by Miaomiao Li, Suyuan Liu, Hengfu Yang, Xueling Zhu, Xinwang Liu

    Anchor-based multi-view clustering has emerged as an effective paradigm for handling large-scale multi-view data, owing to its ability to reduce computational complexity by representing data samples via a small set of anchors. Existing methods typically fall into two categories: those using fixed anchors determined heuristically, and those that jointly learn anchors and anchor graphs. However, fixed-anchor methods lack adaptability and are sensitive to initialization, while learned-anchor methods risk overfitting to local data structures, resulting in poor generalization. In addition, most approaches rely on regularization terms to avoid trivial anchor graph solutions, which introduces additional hyperparameters and impairs stability. To overcome these limitations, we propose a Prior-Guided Anchor Learning method (PGAL) for scalable multi-view clustering. Specifically, we leverage pre-generated anchor priors to constrain the anchor updates, enhancing representativeness and mitigating overfitting. Meanwhile, the revised anchor graph module adopts a regularization-free quadratic formulation, enabling stable and unified consensus graph construction across views. We jointly optimize the anchors, anchor graph, view weights in a unified objective, and develop an efficient algorithm with theoretical guarantees. Experimental results on multiple benchmark datasets demonstrate that our method consistently achieves superior clustering performance compared to state-of-the-art alternatives. Our code is publicly available at https://github.com/Tracesource/PGAL.

  • 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.


  • Top Cited Papers

    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.