Skip to Main Content
Concept lattice is widely used in data analysis. This paper aims to reduce redundant nodes from concept lattice by replacing lattice with join-semilattice. We develop an algorithm based on gradual insertion of concepts into partially hasse diagram. An example is proposed to illustrate the constructing procedure of concept semilattice. Experimental results show effectiveness and efficiency of the proposed algorithm.
Date of Conference: 18-21 Nov. 2008