<p>Advising on academic regulations is difficult because sources are fragmented, frequently revised, and written in administrative prose. We present CRANE, a five-stage category-routed advising framework with two algorithms: <i>CRANE Build</i> for offline construction and <i>CRANE Resolve</i> for online answering. It unifies dense retrieval with graph-guided reasoning over a regulation-enriched graph. A lightweight classifier routes each query to a domain-specific subgraph and restricts vector search to the matching index partition. Graph evidence is gated by an edge-confidence threshold <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\tau \)</EquationSource> </InlineEquation> and does not affect vector similarity. Vietnamese named-entity recognition and <Emphasis FontCategory="NonProportional">PhoBERT</Emphasis> embeddings provide language-appropriate enrichment, and the generator receives a structured prompt with citations and version metadata. We evaluate CRANE on institutional question–answering (Q-A) using two resources: 13,684 labeled queries and 8,635 Q-A pairs verified by academic staff. Under protocol parity, CRANE attains an F1 Score of 99.03% with GPT and 98.69% with Mistral at <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\tau {=}0.6\)</EquationSource> </InlineEquation>. It improves over a vector-only RAG baseline by 3.66 and 3.71 points while maintaining average end-to-end latency near 7&#xa0;s per query. The domain router reaches 97.29% accuracy and 96.72% F1 Score on six-way domain classification. Ablation studies show that removing query routing, named-entity recognition, or budgeted <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\tau \)</EquationSource> </InlineEquation>-thresholded graph expansion reduces F1 Score by 2.56–4.38 points. Sensitivity peaks at <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\tau {=}0.6\)</EquationSource> </InlineEquation>. Scalability tests keep accuracy stable with near-linear latency as the vector index grows. Overall, these results indicate that category-routed retrieval with confidence-gated graph evidence can deliver verifiable regulation advising with high accuracy under a bounded latency budget.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Explainable academic advising via category-routed knowledge graph retrieval and generation

  • Huu-Hoa Nguyen,
  • Tri-Tam La,
  • Thanh Ma

摘要

Advising on academic regulations is difficult because sources are fragmented, frequently revised, and written in administrative prose. We present CRANE, a five-stage category-routed advising framework with two algorithms: CRANE Build for offline construction and CRANE Resolve for online answering. It unifies dense retrieval with graph-guided reasoning over a regulation-enriched graph. A lightweight classifier routes each query to a domain-specific subgraph and restricts vector search to the matching index partition. Graph evidence is gated by an edge-confidence threshold \(\tau \) and does not affect vector similarity. Vietnamese named-entity recognition and PhoBERT embeddings provide language-appropriate enrichment, and the generator receives a structured prompt with citations and version metadata. We evaluate CRANE on institutional question–answering (Q-A) using two resources: 13,684 labeled queries and 8,635 Q-A pairs verified by academic staff. Under protocol parity, CRANE attains an F1 Score of 99.03% with GPT and 98.69% with Mistral at \(\tau {=}0.6\) . It improves over a vector-only RAG baseline by 3.66 and 3.71 points while maintaining average end-to-end latency near 7 s per query. The domain router reaches 97.29% accuracy and 96.72% F1 Score on six-way domain classification. Ablation studies show that removing query routing, named-entity recognition, or budgeted \(\tau \) -thresholded graph expansion reduces F1 Score by 2.56–4.38 points. Sensitivity peaks at \(\tau {=}0.6\) . Scalability tests keep accuracy stable with near-linear latency as the vector index grows. Overall, these results indicate that category-routed retrieval with confidence-gated graph evidence can deliver verifiable regulation advising with high accuracy under a bounded latency budget.