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 …
Deepsecure: Scalable provably-secure deep learning
This paper presents DeepSecure, the an scalable and provably secure Deep Learning (DL)
framework that is built upon automated design, efficient logic synthesis, and optimization …
framework that is built upon automated design, efficient logic synthesis, and optimization …
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 …
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 …
Learning a self-expressive network for subspace clustering
State-of-the-art subspace clustering methods are based on the self-expressive model, which
represents each data point as a linear combination of other data points. However, such …
represents each data point as a linear combination of other data points. However, such …
Oracle based active set algorithm for scalable elastic net subspace clustering
State-of-the-art subspace clustering methods are based on expressing each data point as a
linear combination of other data points while regularizing the matrix of coefficients with l_1 …
linear combination of other data points while regularizing the matrix of coefficients with l_1 …
Provable subspace clustering: When LRR meets SSC
Abstract Sparse Subspace Clustering (SSC) and Low-Rank Representation (LRR) are both
considered as the state-of-the-art methods for {\em subspace clustering}. The two methods …
considered as the state-of-the-art methods for {\em subspace clustering}. The two methods …
Noisy sparse subspace clustering
This paper considers the problem of subspace clustering under noise. Specifically, we study
the behavior of Sparse Subspace Clustering (SSC) when either adversarial or random noise …
the behavior of Sparse Subspace Clustering (SSC) when either adversarial or random noise …
Stochastic sparse subspace clustering
State-of-the-art subspace clustering methods are based on self-expressive model, which
represents each data point as a linear combination of other data points. By enforcing such …
represents each data point as a linear combination of other data points. By enforcing such …
Provable self-representation based outlier detection in a union of subspaces
Many computer vision tasks involve processing large amounts of data contaminated by
outliers, which need to be detected and rejected. While outlier detection methods based on …
outliers, which need to be detected and rejected. While outlier detection methods based on …