Affiliations: Computer Engineering Institute, Qingdao Technological University, Qingdao, Shandong, P. R. China, 266520, [email protected] | Department of Automation, Tsinghua University, Beijing, P. R. China, 100084, [email protected] | College of Information Science and Technology, Shihezi University, Shihezi, Xinjiang, P. R. China, 832000, [email protected]
Note: [] Address for correspondence: 2 Changjiang Road, Huangdao, Qingdao, Shandong, P. R. China, 266520
Abstract: Attribute reduction is one basic issue in knowledge discovery of information systems. In this paper, based on the object oriented concept lattice and classical concept lattice, the approach of attribute reduction for formal contexts is investigated. We consider attribute reduction and attribute characteristics from the perspective of linear dependence of vectors. We first introduce the notion of context matrix and the operations of corresponding column vectors, then present some judgment theorems of attribute reduction for formal contexts. Furthermore, we propose a new method to reducing formal context and show corresponding reduction algorithms. Compared with previous reduction approaches which employ discernibility matrix and discernibility function to determine all reducts, the proposed approach is more simpler and easier to implement.
