AIDB Daily Papers
PolyUQuest:異種グラフを用いた構造認識型の検証可能なWeb RAGフレームワーク
※ 日本語タイトル・ポイントはAIによる自動生成です。正確な内容は原論文をご確認ください。
ポイント
- WebページのDOM構造やハイパーリンク、エンティティ関係を統合した異種グラフに基づく新しいRAGフレームワークを開発した。
- クエリの構造的ニーズに応じて検索モードを使い分ける二段階ルーターを導入し、根拠の追跡を容易にした点が革新的である。
- 既存のRAGシステムと比較して回答の正確性と網羅性が向上し、クエリあたりのトークン消費量を大幅に削減することに成功した。
Abstract
Existing retrieval-augmented generation (RAG) systems treat web pages as flat text, losing the structural and semantic signals encoded in HTML. We present PolyUQuest, a verifiable, structure-aware web RAG framework built on a heterogeneous graph that unifies hyperlink topology between pages, DOM hierarchy within pages, and entity-relation knowledge across pages. A two-tier router dispatches each query to one of three retrieval modes matched to its structural need, including direct block retrieval, cross-page graph traversal, and multi-hop entity reasoning. Every answer is fully verifiable, as each cited block carries its source page, heading path, and entity links so that users can trace any claim back to its structural evidence. We evaluate on the official websites of the Hong Kong Polytechnic University (PolyU), comprising 4,240 pages, 31,086 DOM blocks, 29,119 entities, and 37,680 relations, together with a multi-type evaluation benchmark. PolyUQuest outperforms existing RAG systems in answer correctness, coverage, and faithfulness, while consuming significantly fewer LLM tokens per query. The demonstration provides an interactive interface for inspecting cited answers, comparing retrieval traces across routing modes, and exploring evidence graph paths. PolyUQuest is being prepared for deployment as a student-facing QA service at PolyU.
Paper AI Chat
この論文のPDF全文を対象にAIに質問できます。
質問の例: