Entropy-Based Incomplete Cholesky Decomposition for a Scalable Spectral Clustering Algorithm: Computational Studies and Sensitivity Analysis
Spectral clustering methods allow datasets to be partitioned into clusters by mapping the input datapoints into the space spanned by the eigenvectors of the Laplacian matrix. In this article, we make use of the incomplete Cholesky decomposition (ICD) to construct an approximation of the graph Laplac...
Main Authors: | Rocco Langone, Marc Van Barel, Johan A. K. Suykens |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2016-05-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/18/5/182 |
Similar Items
-
Cholesky Decomposition-Based Metric Learning for Video-Based Human Action Recognition
by: Si Chen, et al.
Published: (2020-01-01) -
A Matrix-Free Posterior Ensemble Kalman Filter Implementation Based on a Modified Cholesky Decomposition
by: Elias D. Nino-Ruiz
Published: (2017-07-01) -
LINEAR CHOLESKY DECOMPOSITION OF COVARIANCE MATRICES IN MIXED MODELS WITH CORRELATED RANDOM EFFECTS
by: Anasu Rabe, et al.
Published: (2019-12-01) -
Recovering Cholesky Factor in Smoothing and Mapping
by: Touchette, Sébastien
Published: (2018) -
Analysis of Crout, Lu, Cholesky Decomposition, and QR Factorization: A Case Study On The Relationship Between Abiotic (Carbon and Nitrogen) and Biotic (Macrobenthos Diversity) Factors
by: Widowati Widowati
Published: (2014-08-01)