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

2011 IEEE International Conference on Cloud Computing and Intelligence Systems Pub Date : 2011-10-13 DOI:10.1109/CCIS.2011.6045145

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

摘要

意图减弱的价值是概念之间的联系。本文提出了一种概念格形成的增量算法，该算法是由衰落值计算的，同时带有程度和意图。由于该算法将期望值包含在中间结果中，因此可以简单快速地确定概念是否为“顶部元素”，并且“顶部元素”的检查速度将非常快。因此，概念格的形成速度明显提高。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 IEEE International Conference on Cloud Computing and Intelligence Systems

自引率

0.00%

发文量