Results 31 to 40 of about 656,770 (269)
Subspace Clustering with Active Learning [PDF]
Subspace clustering is a growing field of unsupervised learning that has gained much popularity in the computer vision community. Applications can be found in areas such as motion segmentation and face clustering.
Peng, Hankui, Pavlidis, Nicos
core +5 more sources
ClustNails: Visual Analysis of Subspace Clusters
Subspace clustering addresses an important problem in clustering multi-dimensional data. In sparse multi-dimensional data, many dimensions are irrelevant and obscure the cluster boundaries. Subspace clustering helps by mining the clusters present in only
Andrada Tatu +6 more
doaj +1 more source
Latent Distribution Preserving Deep Subspace Clustering [PDF]
Subspace clustering is a useful technique for many computer vision applications in which the intrinsic dimension of high-dimensional data is smaller than the ambient dimension. Traditional subspace clustering methods often rely on the self-expressiveness
Liu, X +17 more
core +1 more source
Dimension Selected Subspace Clustering [PDF]
Subspace clustering is a popular method for clustering unlabelled data. However, the computational cost of the subspace clustering algorithm can be unaffordable when dealing with a large data set.
Chambers, Jonathon +7 more
core +1 more source
Diversity-induced Multi-view Subspace Clustering Algorithm with Grouping Effect [PDF]
The multi-view subspace clustering algorithm, a type of multi-view clustering algorithm, emphasizes discovering potential subspaces in multi-view data and clustering based on these subspaces.
ZHANG Yuechen, GE Hongwei, LI Ting
doaj +1 more source
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
Subspace clustering refers to the task of finding a multi-subspace representation that best fits a collection of points taken from a high-dimensional space. This paper introduces an algorithm inspired by sparse subspace clustering (SSC) [In IEEE Conference on Computer Vision and Pattern Recognition, CVPR (2009) 2790-2797] to cluster noisy data, and ...
Soltanolkotabi, Mahdi +2 more
openaire +4 more sources
A survey on soft subspace clustering [PDF]
This paper has been published in Information Sciences Journal in ...
Zhaohong Deng +4 more
openaire +4 more sources
Group-invariant Subspace Clustering [PDF]
Proceedings of Allerton ...
Shuchin Aeron, Eric Kernfeld
openaire +4 more sources
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

