{"title":"分类系统的知识获取","authors":"T. Miura, I. Shioya","doi":"10.1109/TAI.1996.560438","DOIUrl":null,"url":null,"abstract":"We propose a new method to mine a type scheme semi-automatically from an initial database scheme and the instances. Our data model assumes that one entity may have more than one type and classification (or type scheme). It might be appropriate when each entity is classified into at most k (least general) classes with respect to the ISA hierarchy, to keep database processing efficient. Our method differs from others in evolving ISA hierarchy by introducing a semantical metric. We propose a sophisticated algorithm to simplify, evolve and generate type schemes.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Knowledge acquisition for classification systems\",\"authors\":\"T. Miura, I. Shioya\",\"doi\":\"10.1109/TAI.1996.560438\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a new method to mine a type scheme semi-automatically from an initial database scheme and the instances. Our data model assumes that one entity may have more than one type and classification (or type scheme). It might be appropriate when each entity is classified into at most k (least general) classes with respect to the ISA hierarchy, to keep database processing efficient. Our method differs from others in evolving ISA hierarchy by introducing a semantical metric. We propose a sophisticated algorithm to simplify, evolve and generate type schemes.\",\"PeriodicalId\":209171,\"journal\":{\"name\":\"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1996.560438\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1996.560438","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

提出了一种从初始数据库模式和实例中半自动挖掘类型模式的新方法。我们的数据模型假设一个实体可能有多个类型和分类(或类型方案)。当每个实体相对于ISA层次结构被划分为最多k个(最少一般)类时,这可能是合适的,以保持数据库处理的效率。我们的方法不同于其他方法,它通过引入语义度量来发展ISA层次结构。我们提出了一种复杂的算法来简化、进化和生成类型方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Knowledge acquisition for classification systems
We propose a new method to mine a type scheme semi-automatically from an initial database scheme and the instances. Our data model assumes that one entity may have more than one type and classification (or type scheme). It might be appropriate when each entity is classified into at most k (least general) classes with respect to the ISA hierarchy, to keep database processing efficient. Our method differs from others in evolving ISA hierarchy by introducing a semantical metric. We propose a sophisticated algorithm to simplify, evolve and generate type schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
AI tools in scheduling problem solving: a solver based on a "well-behaved" restriction of TCSPs A deliberative and reactive diagnosis agent based on logic programming Subdefinite models as a variety of constraint programming Oz Scheduler: a workbench for scheduling problems Automatic scale selection as a pre-processing stage to interpreting real-world data
×
引用
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