DocumentCode
402871
Title
A fast algorithm for building concept lattice
Author
Qiao, Sheng-yong ; Wen, Swo-pin ; Chen, Cai-yun ; Li, Zhi-guo
Author_Institution
Center for Combinatorics, Nankai Univ., Tianjin, China
Volume
1
fYear
2003
fDate
2-5 Nov. 2003
Firstpage
163
Abstract
The concept (or Galois) lattice produced from a binary relation which has been proved is useful for many applications. But building concept lattice is difficult. Reference [L. Nourine, et al., 1999] gives a fast algorithm for building lattice, but the concept lattice has some special characters. This article presents a fast algorithm for building concept lattice and corresponding graph, an also gives the time complexity of this algorithm. Database updating is always necessary. In our paper, we also give an algorithm for modify lattice when data update happened.
Keywords
data mining; database management systems; knowledge based systems; building concept lattice; database updating; fast algorithm; time complexity; Combinatorial mathematics; Cybernetics; Databases; Lattices; Machine learning;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2003 International Conference on
Print_ISBN
0-7803-8131-9
Type
conf
DOI
10.1109/ICMLC.2003.1264463
Filename
1264463
Link To Document