广义单侧概念格算法的若干复杂性问题

2012 IEEE 10th International Symposium on Applied Machine Intelligence and Informatics (SAMI) Pub Date : 2012-06-01 DOI:10.1109/SAMI.2012.6208964

P. Butka, J. Pócsová, J. Pócs

{"title":"广义单侧概念格算法的若干复杂性问题","authors":"P. Butka, J. Pócsová, J. Pócs","doi":"10.1109/SAMI.2012.6208964","DOIUrl":null,"url":null,"abstract":"In this paper we provide some complexity aspects of incremental algorithm for creation of generalized one-sided concept lattices. The novelty of this algorithm is in its possibility to work with different types of attributes and produce one-sided concept lattice from the generalized one-sided formal context. As it is shown in the paper, the complexity of the algorithm is in general exponential. However, in practice it is reasonable to consider special cases, where the number of attributes is fixed. Then complexity of presented algorithm asymptotically becomes linear function depending on the number of objects in formal context.","PeriodicalId":158731,"journal":{"name":"2012 IEEE 10th International Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"On some complexity aspects of generalized one-sided concept lattices algorithm\",\"authors\":\"P. Butka, J. Pócsová, J. Pócs\",\"doi\":\"10.1109/SAMI.2012.6208964\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we provide some complexity aspects of incremental algorithm for creation of generalized one-sided concept lattices. The novelty of this algorithm is in its possibility to work with different types of attributes and produce one-sided concept lattice from the generalized one-sided formal context. As it is shown in the paper, the complexity of the algorithm is in general exponential. However, in practice it is reasonable to consider special cases, where the number of attributes is fixed. Then complexity of presented algorithm asymptotically becomes linear function depending on the number of objects in formal context.\",\"PeriodicalId\":158731,\"journal\":{\"name\":\"2012 IEEE 10th International Symposium on Applied Machine Intelligence and Informatics (SAMI)\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE 10th International Symposium on Applied Machine Intelligence and Informatics (SAMI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SAMI.2012.6208964\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 10th International Symposium on Applied Machine Intelligence and Informatics (SAMI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAMI.2012.6208964","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

本文给出了创建广义单侧概念格的增量算法的一些复杂性问题。该算法的新颖之处在于它可以处理不同类型的属性，并从广义的单侧形式上下文中产生单侧概念格。如文中所示，该算法的复杂度一般呈指数级。然而，在实践中，考虑特殊情况是合理的，其中属性的数量是固定的。然后该算法的复杂度渐近地成为形式环境中对象数量的线性函数。

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

查看原文本刊更多论文

On some complexity aspects of generalized one-sided concept lattices algorithm

In this paper we provide some complexity aspects of incremental algorithm for creation of generalized one-sided concept lattices. The novelty of this algorithm is in its possibility to work with different types of attributes and produce one-sided concept lattice from the generalized one-sided formal context. As it is shown in the paper, the complexity of the algorithm is in general exponential. However, in practice it is reasonable to consider special cases, where the number of attributes is fixed. Then complexity of presented algorithm asymptotically becomes linear function depending on the number of objects in formal context.

求助全文

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

来源期刊

2012 IEEE 10th International Symposium on Applied Machine Intelligence and Informatics (SAMI)

自引率

0.00%

发文量