AI Paper Atlas

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

AAAI 2026 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
use centerless label-free MFA (best distance variant) instead of K-MeansDGEF · YalefaceACC: 0.3964 -> 0.5636Improved
DGEF vs strongest baselineDGEF · ORLACC: 0.6625 -> 0.7250Improved
DGEF vs strongest baselineDGEF · FaceV5ACC: 0.9676 -> 0.9696No clear effect
DGEF vs KsumsDGEF · FaceV5NMI: 0.9893 -> 0.9903No clear effect
Butterworth distance instead of Euclidean (ablation)DGEF · ORLACC: 0.6475 -> 0.7250Improved
Gaussian kernel distance instead of Euclidean (ablation)DGEF · USPSACC: 0.7710 -> 0.6637Hurt
KNN distance instead of Euclidean (ablation)DGEF · USPSACC: 0.7710 -> 0.8843Improved
Gaussian kernel distance instead of Euclidean (ablation)DGEF · MSRCV2ACC: 0.8143 -> 0.8714Improved
KNN distance instead of Euclidean (ablation)DGEF · FaceV5ACC: 0.9564 -> 0.9404Hurt
vary lambda and dimension t (ablation)DGEF · MSRCV2, YalefaceACC: best at lambda = 0.05Mixed

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy