期刊名称：International Journal of Hybrid Information Technology
印刷版ISSN：1738-9968
出版年度：2016
卷号：9
期号：8
页码：1-10
DOI：10.14257/ijhit.2016.9.8.01
出版社：SERSC
摘要：Attribute reduction have always been hot issues in the concept lattice research. In this paper, we define the attribute waned value, and prove that using attribute waned values can simplifies the conversion of the discernibility function. Furthermore, we prove the attribute reduction can be generated by selecting elements from attribute waned values of infimum irreducible concepts, and provide an approach that uses attribute concepts to find all infimum irreducible concepts. In addition, we give an algorithm to get all attribute reductions. Because this algorithm only uses infimum irreducible concepts rather than all concepts, the time and space complexity is polynomial form and smaller.
