期刊
INFORMATION SCIENCES
卷 491, 期 -, 页码 48-62出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2019.03.038
关键词
Classification of attributes; Formal concept analysis; Reduction in concept lattice; Discernibility matrix; Algorithm
资金
- Palacky University Olomouc [JG_2019_008]
- ESF - European Social Fund [CZ.1.07/2.3.00/20.0059]
- state budget of the Czech Republic
We eliminate unnecessary computations of attribute discernibility sets in discernibility matrix-based methods (DM-methods) of attribute reduction in concept lattices. We obtain a polynomial time algorithm we call a Skim DM-method. The Skim DM-method however is merely slightly different from the standard clarification and reduction (CR-method). This result enables us to express a relationship of the CR-method and the DM-methods: the DM-methods are basically the CR-method with up to an exponential amount of unnecessary computations. Additionally, we experimentally evaluate the Skim DM-method in comparison with the CR-method. (C) 2019 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据