Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (4)
  • Open Access

    ARTICLE

    Multiscale and Auto-Tuned Semi-Supervised Deep Subspace Clustering and Its Application in Brain Tumor Clustering

    Zhenyu Qian1, Yizhang Jiang1, Zhou Hong1, Lijun Huang2, Fengda Li3, KhinWee Lai6, Kaijian Xia4,5,6,*

    CMC-Computers, Materials & Continua, Vol.79, No.3, pp. 4741-4762, 2024, DOI:10.32604/cmc.2024.050920 - 20 June 2024

    Abstract In this paper, we introduce a novel Multi-scale and Auto-tuned Semi-supervised Deep Subspace Clustering (MAS-DSC) algorithm, aimed at addressing the challenges of deep subspace clustering in high-dimensional real-world data, particularly in the field of medical imaging. Traditional deep subspace clustering algorithms, which are mostly unsupervised, are limited in their ability to effectively utilize the inherent prior knowledge in medical images. Our MAS-DSC algorithm incorporates a semi-supervised learning framework that uses a small amount of labeled data to guide the clustering process, thereby enhancing the discriminative power of the feature representations. Additionally, the multi-scale feature extraction… More > Graphic Abstract

    Multiscale and Auto-Tuned Semi-Supervised Deep Subspace Clustering and Its Application in Brain Tumor Clustering

  • Open Access

    ARTICLE

    Contrastive Consistency and Attentive Complementarity for Deep Multi-View Subspace Clustering

    Jiao Wang, Bin Wu*, Hongying Zhang

    CMC-Computers, Materials & Continua, Vol.79, No.1, pp. 143-160, 2024, DOI:10.32604/cmc.2023.046011 - 25 April 2024

    Abstract Deep multi-view subspace clustering (DMVSC) based on self-expression has attracted increasing attention due to its outstanding performance and nonlinear application. However, most existing methods neglect that view-private meaningless information or noise may interfere with the learning of self-expression, which may lead to the degeneration of clustering performance. In this paper, we propose a novel framework of Contrastive Consistency and Attentive Complementarity (CCAC) for DMVsSC. CCAC aligns all the self-expressions of multiple views and fuses them based on their discrimination, so that it can effectively explore consistent and complementary information for achieving precise clustering. Specifically, the More >

  • Open Access

    ARTICLE

    An Improved Soft Subspace Clustering Algorithm for Brain MR Image Segmentation

    Lei Ling1, Lijun Huang2, Jie Wang2, Li Zhang2, Yue Wu2, Yizhang Jiang1, Kaijian Xia2,3,*

    CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.3, pp. 2353-2379, 2023, DOI:10.32604/cmes.2023.028828 - 03 August 2023

    Abstract In recent years, the soft subspace clustering algorithm has shown good results for high-dimensional data, which can assign different weights to each cluster class and use weights to measure the contribution of each dimension in various features. The enhanced soft subspace clustering algorithm combines interclass separation and intraclass tightness information, which has strong results for image segmentation, but the clustering algorithm is vulnerable to noisy data and dependence on the initialized clustering center. However, the clustering algorithm is susceptible to the influence of noisy data and reliance on initialized clustering centers and falls into a… More >

  • Open Access

    REVIEW

    Subspace Clustering in High-Dimensional Data Streams: A Systematic Literature Review

    Nur Laila Ab Ghani1,2,*, Izzatdin Abdul Aziz1,2, Said Jadid AbdulKadir1,2

    CMC-Computers, Materials & Continua, Vol.75, No.2, pp. 4649-4668, 2023, DOI:10.32604/cmc.2023.035987 - 31 March 2023

    Abstract Clustering high dimensional data is challenging as data dimensionality increases the distance between data points, resulting in sparse regions that degrade clustering performance. Subspace clustering is a common approach for processing high-dimensional data by finding relevant features for each cluster in the data space. Subspace clustering methods extend traditional clustering to account for the constraints imposed by data streams. Data streams are not only high-dimensional, but also unbounded and evolving. This necessitates the development of subspace clustering algorithms that can handle high dimensionality and adapt to the unique characteristics of data streams. Although many articles… More >

Displaying 1-10 on page 1 of 4. Per Page