Efficient regularized spectral data embedding

DOI10.1007/s11634-020-00386-8OpenAlexW3008542237MaRDI QIDQ2036143

Mohamed Nadif, Lazhar Labiod

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

spectral clusteringdata sciencedata embedding

Mathematics Subject Classification ID

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

Uses Software

• darch
• CoClust

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering of functional data in a low-dimensional subspace
• Clustering and disjoint principal component analysis
• Mutual information, phi-squared and model-based co-clustering for contingency tables
• On the eigenvectors of \(p\)-Laplacian
• Directional co-clustering
• A generalized solution of the orthogonal Procrustes problem
• Reducing the Dimensionality of Data with Neural Networks
• On Using Principal Components Before Separating a Mixture of Two Multivariate Normal Distributions
• Clustering for binary data and mixture models—choice of the model
• 10.1162/153244303321897735
• Factorial \(k\)-means analysis for two-way data.

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