Results 231 to 240 of about 656,770 (269)
Some of the next articles are maybe not open access.

Related searches:

Subspace Clustering

IEEE Signal Processing Magazine, 2011
René Vidal
exaly   +4 more sources

A Survey on Enhanced Subspace Clustering

open access: yesData Mining and Knowledge Discovery, 2013
Subspace clustering finds sets of objects that are homogeneous in subspaces of high-dimensional datasets, and has been successfully applied in many domains.
Arthur Zimek   +2 more
exaly   +2 more sources

Subspace clustering

WIREs Data Mining and Knowledge Discovery, 2012
AbstractSubspace clusteringrefers to the task of identifying clusters of similar objects or data records (vectors) where the similarity is defined with respect to a subset of the attributes (i.e., a subspace of the data space). The subspace is not necessarily (and actually is usually not) the same for different clusters within one clustering solution ...
Hans-Peter Kriegel   +2 more
openaire   +2 more sources

Deep Subspace Clustering

IEEE Transactions on Neural Networks and Learning Systems, 2020
In this article, we propose a deep extension of sparse subspace clustering, termed deep subspace clustering with L1-norm (DSC-L1). Regularized by the unit sphere distribution assumption for the learned deep features, DSC-L1 can infer a new data affinity matrix by simultaneously satisfying the sparsity principle of SSC and the nonlinearity given by ...
Xi Peng 0001   +4 more
openaire   +3 more sources

Predictive Subspace Clustering

2011 10th International Conference on Machine Learning and Applications and Workshops, 2011
The problem of detecting clusters in high-dimensional data is increasingly common in machine learning applications, for instance in computer vision and bioinformatics. Recently, a number of approaches in the field of subspace clustering have been proposed which search for clusters in subspaces of unknown dimensions. Learning the number of clusters, the
Brian McWilliams, Giovanni Montana
openaire   +1 more source

Cascade Subspace Clustering

Proceedings of the AAAI Conference on Artificial Intelligence, 2017
In this paper, we recast the subspace clustering as a verification problem. Our idea comes from an assumption that the distribution between a given sample x and cluster centers Omega is invariant to different distance metrics on the manifold, where each distribution is defined as a probability map (i.e.
Xi Peng 0001   +4 more
openaire   +2 more sources

Nonlinear subspace clustering

2017 IEEE International Conference on Image Processing (ICIP), 2017
This paper presents a nonlinear subspace clustering (NSC) method for image clustering. Unlike most existing subspace clustering methods which only exploit the linear relationship of samples to learn the affine matrix, our NSC reveals the multi-cluster nonlinear structure of samples via a nonlinear neural network.
Wencheng Zhu, Jiwen Lu, Jie Zhou 0001
openaire   +2 more sources

Home - About - Disclaimer - Privacy