Efficient regularized spectral data embedding

DOI10.1007/S11634-020-00386-8MaRDI QIDQ2036143zbMATH OpenOpenAlexFDO

Authors Lazhar Labiod, M. Nadif

Publication date 28 June 2021

Published in Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11634-020-00386-8

zbMATH Keywords

data embeddingdata sciencespectral clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites work

• 10.1162/153244303321897735
• A generalized solution of the orthogonal Procrustes problem
• Clustering and disjoint principal component analysis
• Clustering for binary data and mixture models—choice of the model
• Clustering of functional data in a low-dimensional subspace
• Directional co-clustering
• Factorial k-means analysis for two-way data.
• scientific article; zbMATH DE number 3921764 (Why is no real title available?)
• scientific article; zbMATH DE number 4020246 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Learning spectral clustering, with application to speech separation
• Mutual information, phi-squared and model-based co-clustering for contingency tables
• On the eigenvectors of \(p\)-Laplacian
• On Using Principal Components Before Separating a Mixture of Two Multivariate Normal Distributions
• Reducing the Dimensionality of Data with Neural Networks

Cited in

(2)

• Unsupervised learning from attributed networks
• On the ADAC issue 2 of volume 20 (2026)

Describes a project that uses

Uses Software

• darch
• CoClust

This page was built for publication: Efficient regularized spectral data embedding

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