Research map / Graph learning / Graph algorithms and clustering
Structured Graph Learning Via Laplacian Spectral Constraints
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 |
|---|---|---|---|
| Learn the clustered graph and its weights jointly from the sample covariance matrix | SGL versus CLR · PANCAN cancer dataset | ACC: 0.9862 -> 0.99875 | Helped |
Closest papers by meaning
- Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them (NeurIPS 2026 · similarity 0.87)
- Structure-Aware Spectral Sparsification via Uniform Edge Sampling (NeurIPS 2025 · similarity 0.87)
- Distribution Learning Meets Graph Structure Sampling (NeurIPS 2025 · similarity 0.87)
- Structural Entropy Based Graph Structure Learning for Node Classification (AAAI 2024 · similarity 0.87)
- Pass-Efficient Algorithms for Graph Spectral Clustering (Student Abstract) (AAAI 2024 · similarity 0.87)
- Signed Laplacians for Constrained Graph Clustering (ICML 2025 · similarity 0.87)
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.