Results 71 to 80 of about 656,770 (269)
Subspace Clustering through Sub-Clusters
The problem of dimension reduction is of increasing importance in modern data analysis. In this paper, we consider modeling the collection of points in a high dimensional space as a union of low dimensional subspaces. In particular we propose a highly scalable sampling based algorithm that clusters the entire data via first spectral clustering of a ...
Weiwei Li +2 more
openaire +5 more sources
Technical limitations often let dominant signals overshadow rare cell types and fine‐grained heterogeneity in spatial transcriptomics. SemanticST, a graph neural network using multi‐semantic graph fusion and a novel min‐cut loss, recovers these subtle patterns.
Roxana Zahedi +7 more
wiley +1 more source
Partial Multi-view Subspace Clustering
For many real-world multimedia applications, data are often described by multiple views. Therefore, multi-view learning researches are of great significance. Traditional multi-view clustering methods assume that each view has complete data.
Luo, Xiangyang +4 more
core +1 more source
Schematic illustration of development of experimental datasets and algorithm models, screening and preparation of the scaffolds and their applications in vivo. ABSTRACT Bone defects require materials with osteogenic, neurogenic, and angiogenic activity, yet designing such materials within high‐dimensional compositional spaces remains challenging. Here,
Kunlu Lin +9 more
wiley +1 more source
Subspace clustering is an effective method for single-cell RNA sequencing (scRNA-seq) data analysis and has been widely used to identify cell types and characterize cellular heterogeneity.
Dan Li +3 more
doaj +1 more source
An Efficient Representation-Based Subspace Clustering Framework for Polarized Hyperspectral Images
Recently, representation-based subspace clustering algorithms for hyperspectral images (HSIs) have been developed with the assumption that pixels belonging to the same land-cover class lie in the same subspace. Polarization is regarded to be a complement
Zhengyi Chen +5 more
doaj +1 more source
Fusion and Enhancement of Consensus Matrix for Multi-View Subspace Clustering
Multi-view subspace clustering is an effective method that has been successfully applied to many applications and has attracted the attention of scholars.
Xiuqin Deng, Yifei Zhang, Fangqing Gu
doaj +1 more source
Computationally Evidence‐Grounded Sequence‐First Design of Peptide Binders
BOND‐PEP enables controllable, sequence‐first peptide binder design by grounding generation in binding evidence retrieved for each target. It uses topology‐conditioned message passing to integrate relevant peptide examples with the target protein sequence, forming a residue‐level representation that guides the generation of diverse, target‐specific ...
Wenze Ding
wiley +1 more source
Subspace clustering via thresholding and spectral clustering [PDF]
ICASSP ...
Reinhard Heckel, Helmut Bölcskei
openaire +3 more sources
Convolutional Subspace Clustering Network With Block Diagonal Prior
Standard methods of subspace clustering are based on self-expressiveness in the original data space, which states that a data point in a subspace can be expressed as a linear combination of other points. However, the real data in raw form are usually not
Junjian Zhang +4 more
doaj +1 more source

