Results 31 to 40 of about 3,374,256 (360)
Density Gain-Rate Peaks for Spectral Clustering
Clustering has been troubled by varying shapes of sample distributions, such as line and spiral shapes. Spectral clustering and density peak clustering are two feasible techniques to address this problem, and have attracted much attention from academic ...
Jiexing Liu, Chenggui Zhao
doaj +1 more source
Consistency of spectral clustering in stochastic block models [PDF]
We analyze the performance of spectral clustering for community extraction in stochastic block models. We show that, under mild conditions, spectral clustering applied to the adjacency matrix of the network can consistently recover hidden communities ...
Lei, Jing, Rinaldo, Alessandro
core +1 more source
Mini-batch spectral clustering [PDF]
The cost of computing the spectrum of Laplacian matrices hinders the application of spectral clustering to large data sets. While approximations recover computational tractability, they can potentially affect clustering performance. This paper proposes a practical approach to learn spectral clustering based on adaptive stochastic gradient optimization.
Han, Yufei, Filippone, Maurizio
openaire +2 more sources
Deep Spectral Clustering Using Dual Autoencoder Network [PDF]
The clustering methods have recently absorbed even-increasing attention in learning and vision. Deep clustering combines embedding and clustering together to obtain optimal embedding subspace for clustering, which can be more effective compared with ...
Xu Yang +4 more
semanticscholar +1 more source
Abnormal behavior detection of social security funds is a method to analyze large-scale data and find abnormal behavior. Although many methods based on spectral clustering have achieved many good results in the practical application of clustering, the ...
Yan Wu, Yonghong Chen, Wenhao Ling
doaj +1 more source
Covariate-assisted spectral clustering [PDF]
28 pages, 4 figures, includes substantial changes to theoretical ...
Binkiewicz, Norbert +2 more
openaire +3 more sources
Fast kernel spectral clustering [PDF]
Abstract Spectral clustering suffers from a scalability problem in both memory usage and computational time when the number of data instances N is large. To solve this issue, we present a fast spectral clustering algorithm able to effectively handle millions of datapoints at a desktop PC scale.
Langone, Rocco, Suykens, Johan
openaire +1 more source
Identifying cell types from single-cell data based on similarities and dissimilarities between cells
Background With the development of the technology of single-cell sequence, revealing homogeneity and heterogeneity between cells has become a new area of computational systems biology research.
Yuanyuan Li +3 more
doaj +1 more source
Impact of regularization on Spectral Clustering [PDF]
The performance of spectral clustering can be considerably improved via regularization, as demonstrated empirically in Amini et. al (2012). Here, we provide an attempt at quantifying this improvement through theoretical analysis.
Joseph, Antony, Yu, Bin
core +1 more source
Affinity Matrix Learning Via Nonnegative Matrix Factorization for Hyperspectral Imagery Clustering
In this article, we integrate the spatial-spectral information of hyperspectral image (HSI) samples into nonnegative matrix factorization (NMF) for affinity matrix learning to address the issue of HSI clustering.
Yao Qin +5 more
doaj +1 more source

