arXiv (All)
open access
Robustness of shallow graph embedding methods for community detection
data-analysismachine-learningphysics-and-societysocial-and-information-networksstatistics-and-probability
This study investigates the robustness of shallow graph embedding methods for community detection in the face of network perturbations, specifically node deletions. Graph embedding techniques, which represent nodes as low-dimensional vectors, are widely used for various graph machine learning tasks
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- NICE: Scale-Stable Perturbations for Graph Neural Network Explanations via Noise Corruption#630167
- NICE: Scale-Stable Perturbations for Graph Neural Network Explanations via Noise Corruption#628305
- Separable Nonnegative Matrix Factorization Using Powered Ratio-of-Norms Regularization#793037
- Separable Nonnegative Matrix Factorization Using Powered Ratio-of-Norms Regularization#789033
- Trust-But-Verify: Poisoning-Resilient Locally Private Graph Learning Protocols#975127
Record · ID 987376
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive