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

Comparing Subspace Clusterings

IEEE Transactions on Knowledge and Data Engineering, 2006
We present the first framework for comparing subspace clusterings. We propose several distance measures for subspace clusterings, including generalizations of well-known distance measures for ordinary clusterings. We describe a set of important properties for any measure for comparing subspace clusterings and give a systematic comparison of our ...
Anne Patrikainen, Marina Meila
exaly   +3 more sources

Interpretable Subspace Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
Subspace clustering is one of the most popular clustering methods due to its effectiveness. Although subspace clustering methods have been demonstrated to achieve promising performance, they still lack interpretability, especially when handling high-dimensional complicated data. To bridge this gap, this paper focuses on the interpretability of subspace
Zheng Zhang   +4 more
openaire   +3 more sources

Subspace Structure-Aware Spectral Clustering for Robust Subspace Clustering

2019 IEEE/CVF International Conference on Computer Vision (ICCV), 2019
Subspace clustering is the problem of partitioning data drawn from a union of multiple subspaces. The most popular subspace clustering framework in recent years is the graph clustering-based approach, which performs subspace clustering in two steps: graph construction and graph clustering.
Masataka Yamaguchi   +3 more
openaire   +1 more source

Algebraic Clustering of Affine Subspaces

open access: yesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2018
Subspace clustering is an important problem in machine learning with many applications in computer vision and pattern recognition. Prior work has studied this problem using algebraic, iterative, statistical, low-rank and sparse representation techniques. While these methods have been applied to both linear and affine subspaces, theoretical results have
Manolis C. Tsakiris, René Vidal
exaly   +6 more sources

Finding the Optimal Subspace for Clustering

2014 IEEE International Conference on Data Mining, 2014
The ability to simplify and categorize things is one of the most important elements of human thought, understanding, and learning. The corresponding explorative data analysis techniques - dimensionality reduction and clustering - have initially been studied by our community as two separate research topics. Later algorithms like CLIQUE, ORCLUS, 4C, etc.
Goebl, S.   +4 more
openaire   +4 more sources

Nonlinear subspace clustering for image clustering

Pattern Recognition Letters, 2018
Abstract We present in this paper 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   +1 more source

Clustering Curves on a Reduced Subspace

Journal of Computational and Graphical Statistics, 2012
The aim of this article is to propose a procedure to cluster functional observations in a subspace of reduced dimension. The dimensional reduction is obtained by constraining the cluster centroids to lie into a subspace which preserves the maximum amount of discriminative information contained in the original data.
GATTONE, STEFANO ANTONIO, ROCCI, ROBERTO
openaire   +4 more sources

Efficient dense subspace clustering

IEEE Winter Conference on Applications of Computer Vision, 2014
In this paper, we tackle the problem of clustering data points drawn from a union of linear (or affine) subspaces. To this end, we introduce an efficient subspace clustering algorithm that estimates dense connections between the points lying in the same subspace.
Pan Ji, Mathieu Salzmann, Hongdong Li
openaire   +2 more sources

Agent-Based Subspace Clustering

2011
This paper presents an agent-based algorithm for discovering subspace clusters in high dimensional data. Each data object is represented by an agent, and the agents move from one local environment to another to find optimal clusters in subspaces. Heuristic rules and objective functions are defined to guide the movements of agents, so that similar ...
Chao Luo   +4 more
openaire   +2 more sources

Consensus Subspace Clustering

2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI), 2021
Nathan Thom   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy