Results 41 to 50 of about 49,338 (223)
Hypergraph-Supervised Deep Subspace Clustering
Auto-encoder (AE)-based deep subspace clustering (DSC) methods aim to partition high-dimensional data into underlying clusters, where each cluster corresponds to a subspace. As a standard module in current AE-based DSC, the self-reconstruction cost plays
Yu Hu, Hongmin Cai
doaj +1 more source
With the increasing demand for unsupervised learning for fault diagnosis, the subspace clustering has been considered as a promising technique enabling unsupervised fault diagnosis. Although various subspace clustering methods have been developed to deal
Jie Gao +4 more
doaj +1 more source
Soft Subspace Clustering Algorithm Optimized by Brain Storm Algorithm for Breast MR Image
The traditional soft subspace clustering algorithm is very susceptible to the initial clustering center and noise data when segmenting breast MR images with large amount of information, uneven intensity and boundary blur, which results in that algorithm ...
FAN Hong, SHI Xiaomin, YAO Ruoxia
doaj +1 more source
In the field of radar reconnaissance, unsupervised recognition of radar signals is a particularly important method for classifying different signals and estimating signal parameters.
Lutao Liu, Shuai Xu
doaj +1 more source
Kernel Block Diagonal Representation Subspace Clustering with Similarity Preservation
Subspace clustering methods based on the low-rank and sparse model are effective strategies for high-dimensional data clustering. However, most existing low-rank and sparse methods with self-expression can only deal with linear structure data effectively,
Yifang Yang, Fei Li
doaj +1 more source
The Shape Interaction Matrix (SIM) is one of the earliest approaches to performing subspace clustering (i.e., separating points drawn from a union of subspaces).
Ji, Pan, Li, Hongdong, Salzmann, Mathieu
core +1 more source
Subspace Clustering through Sub-Clusters
The problem of dimension reduction is of increasing importance in modern data analysis. In this paper, we consider modeling the collection of points in a high dimensional space as a union of low dimensional subspaces. In particular we propose a highly scalable sampling based algorithm that clusters the entire data via first spectral clustering of a ...
Li, Weiwei +2 more
openaire +3 more sources
Neighborhood Selection for Thresholding-based Subspace Clustering
Subspace clustering refers to the problem of clustering high-dimensional data points into a union of low-dimensional linear subspaces, where the number of subspaces, their dimensions and orientations are all unknown. In this paper, we propose a variation
Agustsson, Eirikur +2 more
core +1 more source
An Efficient Representation-Based Subspace Clustering Framework for Polarized Hyperspectral Images
Recently, representation-based subspace clustering algorithms for hyperspectral images (HSIs) have been developed with the assumption that pixels belonging to the same land-cover class lie in the same subspace. Polarization is regarded to be a complement
Zhengyi Chen +5 more
doaj +1 more source
Recently, a series of collaborative representation (CR) methods have attracted much attention for hyperspectral images classification. In this article, two CR-based dynamic ensemble selection (DES) methods using multiview kernel collaborative subspace ...
Hongliang Lu +3 more
doaj +1 more source

