Computation of Intent Reduction Based on Incremental Construction of Concept Lattices

摘要

Concept lattice is accurate and complete in knowledge representation and is an effective tool for data analysis and knowledge discovery. This paper focuses on incremental computation of intent reduction of concepts. By theoretical analysis of characteristic change of intent reduction of lattice nodes during incremental construction of concept lattice, it advances an incremental algorithm to compute intent reduction based on Godin algorithm.