首页> 外文学位 >Dynamically adapting knowledge spaces.
【24h】

Dynamically adapting knowledge spaces.

机译:动态适应知识空间。

获取原文
获取原文并翻译 | 示例

摘要

A key step in the application of Knowledge Spaces theory is the construction of an accurate knowledge structure. A number of algorithms, such as QUERY (Koppen, 1993; Koppen and Doignon, 1990; see also Dowling, 1993; Müller 1989), have been designed to build a knowledge structure by interviewing experts. Though efficient at making logical inferences, these algorithms have no provision for careless or judgment errors by the expert and tend to amplify the effect of such errors through numerous derivations. In the light of these shortcomings, several authors (Kambouri et aL, 1994; Schrepp and Held, 1995; Cosyn and Thiéry, 2000) pointed to the need for empirical validation of a knowledge structure. In this dissertation, we address the issue of gradually improving the accuracy of a knowledge structure, a process that we call ‘adaptation’ of knowledge structures. The focus of our approach is to set in place mechanisms capable of constantly adjusting a knowledge structure while it is used and empirical data is collected. A main source of data is the results obtained from assessing individuals. By introducing some redundancy in the questioning of these individuals, we can design algorithms that gradually improve a knowledge structure. Three classes of procedures are presented: ‘refinement’ of a knowledge structure, multiple stage improvement using the concept of ‘rim’ of a knowledge structure, and gradual ‘adaptation’ by evolving within the ‘fringes’ of a ‘well-graded’ knowledge space. Much of our efforts have been centered on the mathematical (in particular, combinatoric) foundation of these procedures. A key result, is that the set of all ‘well-graded’ ‘discriminative’ families which are closed under union is ‘path-connected’. This result is important because it proves that ‘well-graded’ ‘discriminative’ knowledge spaces have non-empty ‘fringes’, and that any ‘well-graded’ ‘discriminative’ knowledge space can be transformed gradually (by adding only one knowledge state at a time) into any other ‘well-graded’ ‘discriminative’ knowledge space which includes it. A link can be made between these approaches and the objective of improving the functioning of a system through empirical data, or Machine Learning, as it is called in Artificial Intelligence.
机译:知识空间理论应用中的关键步骤是构建准确的知识结构。设计了许多算法,例如 QUERY (Koppen,1993; Koppen和Doignon,1990;另请参见Dowling,1993;Müller1989),以通过采访专家来构建知识结构。尽管这些算法在进行逻辑推理时很有效,但它们并未提供专家的粗心大意或判断错误,并且往往会通过大量推导来放大此类错误的影响。鉴于这些缺点,几位作者(Kambouri等人,1994; Schrepp和Held,1995; Cosyn和Thiéry,2000)指出需要对知识结构进行实证验证。在本文中,我们解决了逐步提高知识结构的准确性的问题,我们称此过程为知识结构的“适应”。我们方法的重点是建立能够在使用知识和收集经验数据时不断调整知识结构的机制。数据的主要来源是从评估个人获得的结果。通过在这些人的提问中引入一些冗余,我们可以设计逐渐改善知识结构的算法。提出了三类程序:知识结构的“细化”,使用知识结构的“边缘”概念的多阶段改进以及通过在“渐进的”知识的“边缘”内演化而逐渐进行的“适应”空间。我们的许多努力都集中在这些过程的数学(特别是组合)基础上。一个关键的结果是,在联盟之下封闭的所有“评级良好”的“歧视性”家庭的集合都是“路径相关的”。该结果很重要,因为它证明“等级良好”的“区分性”知识空间具有非空的“条纹”,并且任何“等级良好”的“歧视性”知识空间都可以逐渐转变(通过仅添加一个知识状态)一次)进入包含它的任何其他“经过良好分级”“歧视性”知识空间。可以在这些方法与通过经验数据或机器学习改善系统功能的目标之间建立联系,这在人工智能中被称为。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号