Unverified50% confidenceFactExact time
GraphSAGE learns aggregation functions rather than fixed embeddings, allowing the model to generalize to new nodes not seen during training and thus achieve inductive learning.
1
Sources
50%
Confidence
Long-term
Relevance
9/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedGraphRAG organizes code knowledge by constructing a knowledge graph that uses functions, classes, and modules as nodes, and call relationships, inheritance relationships, and dependency relationships as edges.73% similarUnverifiedThe GraphRAG architecture compensates for the limitations of pure vector retrieval by explicitly modeling character relationships and event causal chains through knowledge graphs.71% similarUnverifiedGraphRAG范式先用向量检索定位候选实体节点，再通过图遍历沿关系链条扩展上下文，形成语义召回加结构推理的两阶段管道71% similarUnverifiedGraphRAG first uses an LLM to extract entities and dependency relationships from code to build a knowledge graph, and retrieves answers through graph traversal rather than vector similarity during retrieval, making it suitable for multi-hop reasoning scenarios but sacrificing fuzzy semantic matching for unstructured text.70% similarUnverifiedStéphane Ross等人提出DAgger算法，通过训练中持续让学生模型产生新轨迹并请求教师标注来缓解行为克隆的分布偏移问题69% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/914029API
curl https://kongchang.com/api/v1/knowledge/claims/914029MCP
get_claim(id=914029)