A comparison study of graph Laplacian computation

DOI10.1007/978-3-031-87804-6_8MaRDI QIDQ7238094zbMATH OpenFDO

Authors Michela Marini, Haiyan Cheng, Cristina Garcia-Cardona, Weihong Guo, Sara Hahner, Yifei Lou, Sui Tang, Yuan Liu

Publication date 5 May 2026

Full work available at URL https://doi.org/10.1007/978-3-031-87804-6_8

zbMATH Keywords

spectral clusteringQR decompositiongraph LaplacianNyström methodk-nearest neighbor (KNN)

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Statistical aspects of big data and data science (62R07) Artificial intelligence (68Txx)

Cites work

• scientific article; zbMATH DE number 2062634 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Classification and image processing with a semi‐discrete scheme for fidelity forced Allen–Cahn on graphs
• Diffuse Interface Models on Graphs for Classification of High Dimensional Data
• Improved \(k\)-nearest neighbor classification
• Joint Reconstruction-Segmentation on Graphs
• Learning Laplacian Matrix in Smooth Graph Signal Representations
• On the diffusion geometry of graph Laplacians and applications
• Recompression techniques for adaptive cross approximation
• Scikit-learn: machine learning in Python
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning

This page was built for publication: A comparison study of graph Laplacian computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238094)