用可信度传播算法,自动识别RAG系统中哪些文档靠谱
ClaimTrust: Propagation Trust Scoring for RAG Systems
- 基于事实主张构建文档图,用改进的PageRank动态传播可信度分数
- 在814篇新闻上提取2173个主张,965个支持/反驳关系,提升可信度区分能力
- 适合需要验证信息真实性的RAG系统开发者和内容安全研究者
RAG系统的广泛应用带来了生成内容的飞跃,但也凸显了检索信息可信度问题。本文提出ClaimTrust,一种基于传播的可信度评分框架,通过改进的PageRank算法,根据提取的事实主张间关系(支持或反驳)在文档图中传播可信度分数。我们对Kaggle虚假新闻数据集中的814篇政治新闻进行预处理,提取2,173个唯一主张,并分类出965个有意义的关系。通过将数据集表示为文档图,ClaimTrust迭代更新可信度分数直至收敛,有效区分可信与不可信文章。该方法结合嵌入式过滤实现高效主张比对与关系分类,在保持计算可扩展性的同时,实现了11.2%的显著连接率。实验表明,ClaimTrust能正确赋予已验证文档更高可信度分值,并惩罚包含虚假信息的文章。未来方向包括优化主张抽取与比对、参数调优、增强语言模型利用及构建鲁棒评估指标,以推广至多领域和数据集。
原文摘要 · Abstract (English)
The rapid adoption of retrieval-augmented generation (RAG) systems has revolutionized large-scale content generation but has also highlighted the challenge of ensuring trustworthiness in retrieved information. This paper introduces ClaimTrust, a propagation-based trust scoring framework that dynamically evaluates the reliability of documents in a RAG system. Using a modified PageRank-inspired algorithm, ClaimTrust propagates trust scores across documents based on relationships derived from extracted factual claims. We preprocess and analyze 814 political news articles from Kaggle's Fake News Detection Dataset to extract 2,173 unique claims and classify 965 meaningful relationships (supporting or contradicting). By representing the dataset as a document graph, ClaimTrust iteratively updates trust scores until convergence, effectively differentiating trustworthy articles from unreliable ones. Our methodology, which leverages embedding-based filtering for efficient claim comparison and relationship classification, achieves a 11.2% of significant connections while maintaining computational scalability. Experimental results demonstrate that ClaimTrust successfully assigns higher trust scores to verified documents while penalizing those containing false information. Future directions include fine-tuned claim extract and compare (Li et al., 2022), parameter optimization, enhanced language model utilization, and robust evaluation metrics to generalize the framework across diverse datasets and domains.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。