Research map / Learning theory and algorithms / Clustering
Kernel Mean Embedding Deviation Subspace for Unsupervised Learning with Heterogeneous Data
Luoyao Yu, Lixing Zhu, Ruoqing Zhu, Xuehu Zhu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| apply corrected kernel PCA (CKPCA) before change point detection | E-Divisive · Example 1 Case 1 (p=200) | Rand Index: 0.274 -> 0.992 | Improved |
| replace KPCA with CKPCA | E-Divisive · Example 1 Case 1 (p=200) | Rand Index: 0.830 -> 0.992 | Improved |
| apply CKPCA before Multirank | Multirank · Example 1 Case 1 (p=200) | Rand Index: 0.142 -> 0.995 | Improved |
| replace KPCA with CKPCA | Multirank · Example 1 Case 1 (p=200) | Rand Index: 0.124 -> 0.995 | Improved |
| replace KPCA with CKPCA | E-Divisive · Example 2 (a=4, p=200) | Rand Index: 0.939 -> 0.975 | Improved |
| replace Mahalanobis matrix method with CKPCA | E-Divisive · Example 2 (a=4, p=200) | Rand Index: 0.522 -> 0.975 | Improved |
| increase bandwidth multiplier m from 0.4 to 2 (ablation) | E-DivisiveC · Example 2 (a=4, p=200) | Rand Index: 0.977 -> 0.956 | Hurt |
| apply iterative CKPCA before K-means | K-means · Clustering simulation (p=100) | Rand Index: 0.505 -> 1.000 | Improved |
| apply iterative CKPCA before PAM | PAM · Clustering simulation (p=100) | Rand Index: 0.334 -> 1.000 | Improved |
| replace KPCA with CKPCA | DBSCAN · MNIST digits 6/8/9 | Rand Index: 0.346 -> 0.655 | Improved |
| replace KPCA with CKPCA | PAM · MNIST digits 6/8/9 | Rand Index: 0.772 -> 0.876 | Improved |
| replace KPCA with CKPCA | K-means · MNIST digits 6/8/9 | Rand Index: 0.827 -> 0.844 | Improved |
Closest papers by meaning
- Intrinsic Grassmann Averages for Online Linear, Robust and Nonlinear Subspace Learning (TPAMI 2020 · similarity 0.86)
- Implicit Annealing in Kernel Spaces: A Strongly Consistent Clustering Approach (TPAMI 2022 · similarity 0.86)
- Solving Interpretable Kernel Dimensionality Reduction (NeurIPS 2019 · similarity 0.84)
- Scalable Multiple Kernel Clustering: Learning Clustering Structure from Expectation (ICML 2024 · similarity 0.84)
- Heterogeneous Sufficient Dimension Reduction and Subspace Clustering (ICML 2025 · similarity 0.84)
- Capturing the denoising effect of PCA via compression ratio (NeurIPS 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
