一种基于意图值的概念格生成增量算法

Xuesong Dai, Yuan Ma
{"title":"一种基于意图值的概念格生成增量算法","authors":"Xuesong Dai, Yuan Ma","doi":"10.1109/CCIS.2011.6045145","DOIUrl":null,"url":null,"abstract":"The intent waned value is a connection between concepts. In this article a kind of incremental algorithm of concept lattice formation calculated by waned value altogether with extent and intent is provided. As in this algorithm the intend waned value is contained in intermediate result so it is easy and rapid to determine if the concept is a “top element” and the speed of “top element” checking will be very quick. Therefore the speed of concept lattice formation is improved obviously.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An incremental algorithm for formation a concept lattice based on the intent waned value\",\"authors\":\"Xuesong Dai, Yuan Ma\",\"doi\":\"10.1109/CCIS.2011.6045145\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The intent waned value is a connection between concepts. In this article a kind of incremental algorithm of concept lattice formation calculated by waned value altogether with extent and intent is provided. As in this algorithm the intend waned value is contained in intermediate result so it is easy and rapid to determine if the concept is a “top element” and the speed of “top element” checking will be very quick. Therefore the speed of concept lattice formation is improved obviously.\",\"PeriodicalId\":128504,\"journal\":{\"name\":\"2011 IEEE International Conference on Cloud Computing and Intelligence Systems\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Cloud Computing and Intelligence Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCIS.2011.6045145\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCIS.2011.6045145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

意图减弱的价值是概念之间的联系。本文提出了一种概念格形成的增量算法,该算法是由衰落值计算的,同时带有程度和意图。由于该算法将期望值包含在中间结果中,因此可以简单快速地确定概念是否为“顶部元素”,并且“顶部元素”的检查速度将非常快。因此,概念格的形成速度明显提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An incremental algorithm for formation a concept lattice based on the intent waned value
The intent waned value is a connection between concepts. In this article a kind of incremental algorithm of concept lattice formation calculated by waned value altogether with extent and intent is provided. As in this algorithm the intend waned value is contained in intermediate result so it is easy and rapid to determine if the concept is a “top element” and the speed of “top element” checking will be very quick. Therefore the speed of concept lattice formation is improved obviously.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A dynamic and integrated load-balancing scheduling algorithm for Cloud datacenters A CPU-GPU hybrid computing framework for real-time clothing animation The communication of CAN bus used in synchronization control of multi-motor based on DSP An improved dynamic provable data possession model Ensuring the data integrity in cloud data storage
×
引用
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