A pruning based incremental construction of horizontal partitioned concept lattice

  • Authors:
  • Lihua Hu;Jifu Zhang;Sulan Zhang

  • Affiliations:
  • School of Computer Science and Technology, Tai-Yuan University of Science and Technology, Tai-Yuan, P.R. China;School of Computer Science and Technology, Tai-Yuan University of Science and Technology, Tai-Yuan, P.R. China and National Laboratory of Pattern Recognition, Institute of Automation, Chinese Acad ...;School of Computer Science and Technology, Tai-Yuan University of Science and Technology, Tai-Yuan, P.R. China

  • Venue:
  • ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.