Research map / Graph learning / Graph algorithms and clustering
Discriminative Graph Embedding Framework via Label-Free Marginal Fisher Analysis
Qianqian Wang, Mengping Jiang, Wei Feng, Haixi Zhang, Bin Liu
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 |
|---|---|---|---|
| use centerless label-free MFA (best distance variant) instead of K-Means | DGEF · Yaleface | ACC: 0.3964 -> 0.5636 | Improved |
| DGEF vs strongest baseline | DGEF · ORL | ACC: 0.6625 -> 0.7250 | Improved |
| DGEF vs strongest baseline | DGEF · FaceV5 | ACC: 0.9676 -> 0.9696 | No clear effect |
| DGEF vs Ksums | DGEF · FaceV5 | NMI: 0.9893 -> 0.9903 | No clear effect |
| Butterworth distance instead of Euclidean (ablation) | DGEF · ORL | ACC: 0.6475 -> 0.7250 | Improved |
| Gaussian kernel distance instead of Euclidean (ablation) | DGEF · USPS | ACC: 0.7710 -> 0.6637 | Hurt |
| KNN distance instead of Euclidean (ablation) | DGEF · USPS | ACC: 0.7710 -> 0.8843 | Improved |
| Gaussian kernel distance instead of Euclidean (ablation) | DGEF · MSRCV2 | ACC: 0.8143 -> 0.8714 | Improved |
| KNN distance instead of Euclidean (ablation) | DGEF · FaceV5 | ACC: 0.9564 -> 0.9404 | Hurt |
| vary lambda and dimension t (ablation) | DGEF · MSRCV2, Yaleface | ACC: best at lambda = 0.05 | Mixed |
Closest papers by meaning
- Self-Supervised Graph Embedding Clustering (TPAMI 2025 · similarity 0.90)
- Probabilistic Dimensionality Reduction via Structure Learning (TPAMI 2017 · similarity 0.86)
- A Study of the Classification of Low-Dimensional Data with Supervised Manifold Learning (JMLR 2018 · similarity 0.86)
- Partition First, Embed Later: Laplacian-Based Feature Partitioning for Refined Embedding and Visualization of High-Dimensional Data (ICML 2025 · similarity 0.85)
- How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings (ICLR 2025 · similarity 0.84)
- Unified K-Means Clustering with Label-Guided Manifold Learning (ICML 2025 · similarity 0.84)
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.
