A Pruning Based Incremental Construction of Horizontal Partitioned Concept Lattice
Since the completeness of the concept lattice, its construction efficiency is a key of restricting the application. For the inevitable redundant information occurred in the construction process of partitioned concept lattice, an improved incremental construction algorithm PHCL of horizontal partitioned concept lattice, called the pruning based incremental algorithm is proposed, which uses a pruning process to eliminate redundant information during the construction, to improve the construction efficiency of horizontal partitioned concept lattice. In the end, the experiment results prove the correctness and validity of the pruning based algorithm PHCL by taking the star spectra from the LAMOST project as the formal context.
Unable to display preview. Download preview PDF.