Euclidean embedding of co-occurrence data
From MaRDI portal
Recommendations
Cited in
(14)- Visualizing non-metric similarities in multiple maps
- DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling
- Matrix optimization based Euclidean embedding with outliers
- A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors
- Unsupervised representation learning with minimax distance measures
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- scientific article; zbMATH DE number 7626751 (Why is no real title available?)
- Minimum-Distortion Embedding
- Some theory for ordinal embedding
- Parametric Embedding for Class Visualization
- Embedding Learning
- An L-DEIM induced high order tensor interpolatory decomposition
- Relaxation of the rank-1 tensor approximation using different norms
- Non-negative matrix factorization algorithms generally improve topic model fits
This page was built for publication: Euclidean embedding of co-occurrence data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174157)