Results 61 to 70 of about 656,770 (269)
Unified Low-Rank Subspace Clustering with Dynamic Hypergraph for Hyperspectral Image
Low-rank representation with hypergraph regularization has achieved great success in hyperspectral imagery, which can explore global structure, and further incorporate local information.
Jinhuan Xu, Liang Xiao, Jingxiang Yang
doaj +1 more source
Filtrated Algebraic Subspace Clustering [PDF]
Subspace clustering is the problem of clustering data that lie close to a union of linear subspaces. Existing algebraic subspace clustering methods are based on fitting the data with an algebraic variety and decomposing this variety into its constituent subspaces.
Manolis C. Tsakiris, René Vidal
openaire +2 more sources
Subspace Clustering by Capped l(1) Norm
Subspace clustering, as an important clustering problem, has drawn much attention in recent years. State-of-the-art methods generally try to design an efficient model to regularize the coefficient matrix while ignore the influence of the noise model on
Tao, Dacheng +8 more
core +1 more source
Multi-view clustering via simultaneously learning shared subspace and affinity matrix
Due to the existence of multiple views in many real-world data sets, multi-view clustering is increasingly popular. Many approaches have been investigated, among which the subspace clustering methods finding the underlying subspaces of data have been ...
Nan Xu +4 more
doaj +1 more source
Local Connectivity Enhanced Sparse Representation
During the past two decades, the subspace clustering problem has attracted much attention. Since the data set in real-world problems usually contains a lot of categories, it seems that the large subspace number (LSN) subspace clustering has great ...
Kewei Tang +6 more
doaj +1 more source
SSC: Statistical Subspace Clustering [PDF]
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with high dimensional data where the curse of dimensionality occurs. It has also the benefit of providing smaller descriptions of the clusters found. Existing methods only consider
Candillier, Laurent +3 more
openaire +3 more sources
Organic Materials of Tomorrow: Horizons of Artificial Intelligence
This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena +3 more
wiley +1 more source
Neural Collaborative Subspace Clustering [PDF]
We introduce the Neural Collaborative Subspace Clustering, a neural model that discovers clusters of data points drawn from a union of low-dimensional subspaces.
Harandi, Mehrtash +4 more
core +3 more sources
Using single‐cell transcriptomic and epigenomic profiling, researchers mapped microglial dysfunction across the lifespan of db/db mice. The authors uncovered a nonlinear microglial remodeling featuring early inflammatory priming, a mid‐stage transcriptional inflection, and late dysfunction.
Jizhou Zhang +6 more
wiley +1 more source
Robust Spectral Clustering Incorporating Statistical Sub-Graph Affinity Model
Hyperspectral image (HSI) clustering is a challenging work due to its high complexity. Subspace clustering has been proven to successfully excavate the intrinsic relationships between data points, while traditional subspace clustering methods ignore the ...
Zhenxian Lin, Jiagang Wang, Chengmao Wu
doaj +1 more source

