A new subspace clustering strategy for AI-based data analysis in IoT system
Z Cui, X Jing, 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 …
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 …
Beyond linear subspace clustering: A comparative study of nonlinear manifold clustering algorithms
M Abdolali, N Gillis - Computer Science Review, 2021 - Elsevier
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 …
Nonconvex nonsmooth low rank minimization via iteratively reweighted nuclear norm
The nuclear norm is widely used as a convex surrogate of the rank function in compressive
sensing for low rank matrix recovery with its applications in image recovery and signal …
sensing for low rank matrix recovery with its applications in image recovery and signal …
Self-supervised convolutional subspace clustering network
Subspace clustering methods based on data self-expression have become very popular for
learning from data that lie in a union of low-dimensional linear subspaces. However, the …
learning from data that lie in a union of low-dimensional linear subspaces. However, the …
Scalable sparse subspace clustering by orthogonal matching pursuit
Subspace clustering methods based on ell_1, l_2 or nuclear norm regularization have
become very popular due to their simplicity, theoretical guarantees and empirical success …
become very popular due to their simplicity, theoretical guarantees and empirical success …
Robust subspace clustering for multi-view data by exploiting correlation consensus
More often than not, a multimedia data described by multiple features, such as color and
shape features, can be naturally decomposed of multi-views. Since multi-views provide …
shape features, can be naturally decomposed of multi-views. Since multi-views provide …
Structured sparse subspace clustering: A joint affinity learning and subspace clustering framework
Subspace clustering refers to the problem of segmenting data drawn from a union of
subspaces. State-of-the-art approaches for solving this problem follow a two-stage …
subspaces. State-of-the-art approaches for solving this problem follow a two-stage …
Smooth representation clustering
Subspace clustering is a powerful technology for clustering data according to the underlying
subspaces. Representation based methods are the most popular subspace clustering …
subspaces. Representation based methods are the most popular subspace clustering …
A survey on sparse learning models for feature selection
X Li, Y Wang, R Ruiz - IEEE transactions on cybernetics, 2020 - ieeexplore.ieee.org
Feature selection is important in both machine learning and pattern recognition.
Successfully selecting informative features can significantly increase learning accuracy and …
Successfully selecting informative features can significantly increase learning accuracy and …