Results 31 to 40 of about 49,736 (243)
Deep Subspace Clustering Algorithm with Data Augmentation and Adaptive Self-Paced Learning [PDF]
Deep subspace clustering achieves better performance than traditional clustering by jointly performing self-expressed feature learning and cluster allocation.Despite the emergence of a large number of deep subspace clustering algorithms in various ...
Yuyan JIANG, Chengfeng TAO, Ping LI
doaj +1 more source
Filtrated Algebraic Subspace Clustering [PDF]
Subspace clustering is the problem of clustering data that lie close to a union of linear subspaces. In the abstract form of the problem, where no noise or other corruptions are present, the data are assumed to lie in general position inside the algebraic variety of a union of subspaces, and the objective is to decompose the variety into its ...
Tsakiris, Manolis C., Vidal, René
openaire +2 more sources
Transformed Subspace Clustering [PDF]
Subspace clustering assumes that the data is sepa-rable into separate subspaces. Such a simple as-sumption, does not always hold. We assume that, even if the raw data is not separable into subspac-es, one can learn a representation (transform coef-ficients) such that the learnt representation is sep-arable into subspaces.
Jyoti Maggu +2 more
openaire +2 more sources
SSC: Statistical Subspace Clustering [PDF]
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with high dimensional data where the curse of dimensionality occurs. It has also the benefit of providing smaller descriptions of the clusters found. Existing methods only consider
Candillier, Laurent +3 more
openaire +2 more sources
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
A Convex Formulation for Spectral Shrunk Clustering [PDF]
Spectral clustering is a fundamental technique in the field of data mining and information processing. Most existing spectral clustering algorithms integrate dimensionality reduction into the clustering process assisted by manifold learning in the ...
Chang, Xiaojun +4 more
core +1 more source
Subspace Clustering of High-Dimensional Data: An Evolutionary Approach
Clustering high-dimensional data has been a major challenge due to the inherent sparsity of the points. Most existing clustering algorithms become substantially inefficient if the required similarity measure is computed between data points in the full ...
Singh Vijendra, Sahoo Laxman
doaj +1 more source
Subspace-based I-nice Clustering Algorithm [PDF]
Subspace clustering of high-dimensional data is a hot issue in the field of unsupervised learning.The difficulty of subspace clustering lies in finding the appropriate subspaces and corresponding clusters.At present,the most existing subspace clustering ...
HE Yifan, HE Yulin, CUI Laizhong, HUANG Zhexue
doaj +1 more source
Hypergraph Convolutional Subspace Clustering With Multihop Aggregation for Hyperspectral Image
Subspace clustering methods have become a powerful tool to cluster hyperspectral imaging (HSI) data as they ensure theoretical guarantees and empirical success.
Zijia Zhang +5 more
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

