A pruning based incremental construction algorithm of concept lattice

Authors:
Zhang Ji-Fu;Hu Li-Hua;Zhang Su-Lan
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;School of Computer Science and Technology, Tai-Yuan University of Science, and Technology, Tai-Yuan, P.R. China
Venue:
ICDM'06 Proceedings of the 6th Industrial Conference on Data Mining conference on Advances in Data Mining: applications in Medicine, Web Mining, Marketing, Image and Signal Mining
Year:
2006

Citing 3
Cited 0

Knowledge acquisition by methods of formal concept analysis

Proceedings of the conference on Data analysis, learning symbolic and numeric knowledge
An incremental concept formation approach for learning from databases

Theoretical Computer Science - Special issue on formal methods in databases and software engineering
Data mining: concepts and techniques

Data mining: concepts and techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept lattice has played an important role in knowledge discovery. However due to inevitable occurrence of redundant information in the construction process of concept lattice, the low construction efficiency has been a main concern in the literature. In this work, an improved incremental construction algorithm of concept lattice over the traditional Godin algorithm, called the pruning based incremental algorithm is proposed, which uses a pruning process to detect and eliminate possible redundant information during the construction. Our pruning based construction algorithm is in nature superior to the Godin algorithm. It can achieve the same structure with the Godin algorithm but with less computational complexity. In addition, our pruning based algorithm is also experimentally validated by taking the star spectra from the LAMOST project as the formal context.