专家图:通过协作合成新的专业知识
Expert Graphs: Synthesizing New Expertise via Collaboration
摘要:
考虑具有重叠专业知识的多个专家在不确定输入下处理分类问题。什么是一套一致的观点?我们如何预测专家对缺失子域的意见?在本文中,我们定义了一个框架来分析这个问题,称为“专家图”。“在专家图中,顶点代表类,边代表对其顶点主题的二元意见。我们推导出专家图有效性的必要条件,并使用它们来创建“合成专家”,描述与其他专家的观察意见一致的意见。我们证明了这个框架是等价的研究线性有序多面体。我们表明,我们的条件是不足以描述所有的专家图集团,但足够的周期。
英文摘要:
Consider multiple experts with overlapping expertise working on a classification problem under uncertain input. What constitutes a consistent set of opinions? How can we predict the opinions of experts on missing sub-domains? In this paper, we define a framework of to analyze this problem, termed "expert graphs." In an expert graph, vertices represent classes and edges represent binary opinions on the topics of their vertices. We derive necessary conditions for expert graph validity and use them to create "synthetic experts" which describe opinions consistent with the observed opinions of other experts. We show this framework to be equivalent to the well-studied linear ordering polytope. We show our conditions are not sufficient for describing all expert graphs on cliques, but are sufficient for cycles.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。