Intelligent query mechanism for expert systems

W. Shao, H. Soon
{"title":"Intelligent query mechanism for expert systems","authors":"W. Shao, H. Soon","doi":"10.1109/CMPSAC.1990.139437","DOIUrl":null,"url":null,"abstract":"The authors describe a set of query techniques which helps to improve the efficiency of the query mechanism of expert systems. They discuss a number of algorithms and formulae for identifying a key feature set and deriving an ideal query sequence. The proposed algorithms aim to cut down the consultation time so as to increase the efficiency of the expert system. The query mechanism can be further enhanced by taking the cost factor of answering each query into consideration. This consideration will affect the value of the features, for the greater the cost required to obtain the answer, the less favorable is the query about that feature. This will lead to more realistic algorithms for finding a KFS (key feature set) and an ideal query sequence. The advantages and disadvantages of a static query mechanism are examined. The solution suggested is to employ a semi-dynamic mechanism. In this way, an appropriate threshold value for the number of patterns which remain undifferentiated has to be determined for the switching from the static to the dynamic mechanism before the suggested mechanism can improve the module.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1990.139437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The authors describe a set of query techniques which helps to improve the efficiency of the query mechanism of expert systems. They discuss a number of algorithms and formulae for identifying a key feature set and deriving an ideal query sequence. The proposed algorithms aim to cut down the consultation time so as to increase the efficiency of the expert system. The query mechanism can be further enhanced by taking the cost factor of answering each query into consideration. This consideration will affect the value of the features, for the greater the cost required to obtain the answer, the less favorable is the query about that feature. This will lead to more realistic algorithms for finding a KFS (key feature set) and an ideal query sequence. The advantages and disadvantages of a static query mechanism are examined. The solution suggested is to employ a semi-dynamic mechanism. In this way, an appropriate threshold value for the number of patterns which remain undifferentiated has to be determined for the switching from the static to the dynamic mechanism before the suggested mechanism can improve the module.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
专家系统的智能查询机制
作者描述了一套有助于提高专家系统查询机制效率的查询技术。他们讨论了许多用于识别关键特征集和推导理想查询序列的算法和公式。提出的算法旨在缩短咨询时间,从而提高专家系统的效率。通过考虑回答每个查询的成本因素,可以进一步增强查询机制。这种考虑将影响特征的价值,因为获得答案所需的成本越大,对该特征的查询就越不利。这将导致更现实的算法来查找KFS(关键特性集)和理想的查询序列。分析了静态查询机制的优点和缺点。建议的解决方案是采用半动态机制。这样,在建议的机制能够改进模块之前,必须确定从静态机制切换到动态机制的未区分模式数量的适当阈值。>
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Compiling linear recursive Prolog programs with list structure into procedural language PPK: a method for recording and analyzing software design processes Concurrent transaction execution in multidatabase systems An application of object-oriented design for communication control systems The analysis of infeasible concurrent paths of concurrent Ada programs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1