Advertisement

A Pruning Based Incremental Construction of Horizontal Partitioned Concept Lattice

  • Lihua Hu
  • Jifu Zhang
  • Sulan Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4114)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Lihua Hu
    • 1
  • Jifu Zhang
    • 1
    • 2
  • Sulan Zhang
    • 1
  1. 1.School of Computer Science and Technology, Tai-Yuan University of Science and, Technology, Tai-Yuan 030024China
  2. 2.National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing 100080China

Personalised recommendations