Structured graph learning for scalable subspace clustering: From single view to multiview
Graph-based subspace clustering methods have exhibited promising performance.
However, they still suffer some of these drawbacks: they encounter the expensive time …
However, they still suffer some of these drawbacks: they encounter the expensive time …
Large-scale multi-view subspace clustering in linear time
A plethora of multi-view subspace clustering (MVSC) methods have been proposed over the
past few years. Researchers manage to boost clustering accuracy from different points of …
past few years. Researchers manage to boost clustering accuracy from different points of …
A new subspace clustering strategy for AI-based data analysis in IoT system
Z Cui, X **g, P Zhao, W Zhang… - IEEE Internet of Things …, 2021 - ieeexplore.ieee.org
The Internet-of-Things (IoT) technology is widely used in various fields. In the Earth
observation system, hyperspectral images (HSIs) are acquired by hyperspectral sensors and …
observation system, hyperspectral images (HSIs) are acquired by hyperspectral sensors and …
Deep subspace clustering networks
We present a novel deep neural network architecture for unsupervised subspace clustering.
This architecture is built upon deep auto-encoders, which non-linearly map the input data …
This architecture is built upon deep auto-encoders, which non-linearly map the input data …
Towards k-means-friendly spaces: Simultaneous deep learning and clustering
Most learning approaches treat dimensionality reduction (DR) and clustering separately (ie,
sequentially), but recent research has shown that optimizing the two tasks jointly can …
sequentially), but recent research has shown that optimizing the two tasks jointly can …
Deep clustering via joint convolutional autoencoder embedding and relative entropy minimization
In this paper, we propose a new clustering model, called DEeP Embedded RegularIzed
ClusTering (DEPICT), which efficiently maps data into a discriminative embedding subspace …
ClusTering (DEPICT), which efficiently maps data into a discriminative embedding subspace …
Subspace clustering by block diagonal representation
This paper studies the subspace clustering problem. Given some data points approximately
drawn from a union of subspaces, the goal is to group these data points into their underlying …
drawn from a union of subspaces, the goal is to group these data points into their underlying …
Pseudo-supervised deep subspace clustering
Auto-Encoder (AE)-based deep subspace clustering (DSC) methods have achieved
impressive performance due to the powerful representation extracted using deep neural …
impressive performance due to the powerful representation extracted using deep neural …
On the applications of robust PCA in image and video processing
Robust principal component analysis (RPCA) via decomposition into low-rank plus sparse
matrices offers a powerful framework for a large variety of applications such as image …
matrices offers a powerful framework for a large variety of applications such as image …
Beyond linear subspace clustering: A comparative study of nonlinear manifold clustering algorithms
Subspace clustering is an important unsupervised clustering approach. It is based on the
assumption that the high-dimensional data points are approximately distributed around …
assumption that the high-dimensional data points are approximately distributed around …