Results 11 to 20 of about 656,770 (269)
Projection subspace clustering
Gene expression data is a kind of high dimension and small sample size data. The clustering accuracy of conventional clustering techniques is lower on gene expression data due to its high dimension.
Xiaoyun Chen, Mengzhen Liao, Xianbao Ye
doaj +2 more sources
Discriminative Subspace Clustering [PDF]
We present a novel method for clustering data drawn from a union of arbitrary dimensional subspaces, called Discriminative Subspace Clustering (DiSC). DiSC solves the subspace clustering problem by using a quadratic classifier trained from unlabeled data (clustering by classification).
Vasileios Zografos +2 more
openaire +3 more sources
The Generic Subspace Clustering Model [PDF]
In this paper we present an overview of methods for clustering high dimensional data in which the objects are assigned to mutually exclusive classes in low dimensional spaces. To this end, we will introduce the generic subspace clustering model. This model will be shown to encompass a range of existing clustering techniques as special cases.
Marieke E. Timmerman, Eva Ceulemans
openaire +5 more sources
Clustering quality metrics for subspace clustering
Abstract We study the problem of clustering validation, i.e., clustering evaluation without knowledge of ground-truth labels, for the increasingly-popular framework known as subspace clustering. Existing clustering quality metrics (CQMs) rely heavily on a notion of distance between points, but common metrics fail to capture the geometry of subspace ...
John Lipor, Laura Balzano
openaire +4 more sources
Impact Parameter Analysis of Subspace Clustering
Subspace clustering, which detects all clusters in affine subspaces of a given high dimensional vector space, is used in various applications, including e-business.
Dongjin Lee, Junho Shim
doaj +2 more sources
Generalized Independent Subspace Clustering
Data can encapsulate different object groupings in subspaces of arbitrary dimension and orientation. Finding such subspaces and the groupings within them is the goal of generalized subspace clustering. In this work we present a generalized subspace clustering technique capable of finding multiple non-redundant clusterings in arbitrarily-oriented ...
Wei Ye 0001 +3 more
openaire +3 more sources
Learnable Subspace Clustering [PDF]
This paper studies the large-scale subspace clustering (LSSC) problem with million data points. Many popular subspace clustering methods cannot directly handle the LSSC problem although they have been considered as state-of-the-art methods for small-scale data points. A basic reason is that these methods often choose all data points as a big dictionary
Jun Li 0027 +4 more
openaire +4 more sources
Transformed Subspace Clustering [PDF]
Subspace clustering assumes that the data is sepa-rable into separate subspaces. Such a simple as-sumption, does not always hold. We assume that, even if the raw data is not separable into subspac-es, one can learn a representation (transform coef-ficients) such that the learnt representation is sep-arable into subspaces.
Jyoti Maggu +2 more
openaire +3 more sources
Multilinear subspace clustering [PDF]
In this paper we present a new model and an algorithm for unsupervised clustering of 2-D data such as images. We assume that the data comes from a union of multilinear subspaces (UOMS) model, which is a specific structured case of the much studied union of subspaces (UOS) model.
Eric Kernfeld +3 more
openaire +4 more sources
MethyAnno: An Interpretable Automated Annotation Method Leveraging Multi-Scale Information and Metric Learning Framework for scDNAm Data. [PDF]
MethyAnno enables robust and interpretable annotation of single‐cell DNA methylation data by integrating multi‐scale epigenetic information, bidirectional cross‐attention, and prototype‐based metric learning. The framework resolves rare and novel cell types across datasets while revealing cell‐type‐specific epigenetic signatures associated with disease
Jia Y, Li S, Tang S, Gu K, Chen S.
europepmc +2 more sources

