arXiv (All)
open access
Graph Domain Adaptation Does Not End with Representation Learning
Graph domain adaptation (GDA) transfers knowledge from a labeled source graph to an unlabeled target graph under shifts in both node attributes and graph structure. Existing methods primarily adapt graph representations through propagation redesign, distribution alignment, or source-to-target transi
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
- Data-Efficient Agentic Graph Domain Adaptation via Reliability-Aware Prototype Learning#1083523
- Adversarial Course-of-Action Generation: Game-Theoretic Multi-Agent Algorithms for COA matching & COA generation#1061964
- Test-Time Generalized Category Discovery#1119010
- GLASS: Graph-Language Alignment with Spherical Scoring for Transferable Graph-Level Anomaly Detection#972191
- EvLink: Source-Grounded Evidence Linking for Graph RAG#1077622
Record · ID 1061327
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