DocumentCode
2177569
Title
Computation of Intent Reduction Based on Incremental Construction of Concept Lattices
Author
Bin, Ge ; Meng Xiang-rui
Author_Institution
Dept. Of Sci. Res., Anhui Univ. Of Sci. & Technol., Huainan, China
fYear
2010
fDate
24-26 Aug. 2010
Firstpage
1
Lastpage
4
Abstract
Concept lattice is accurate and complete in knowledge representation and is an effective tool for data analysis and knowledge discovery. This paper focuses on incremental computation of intent reduction of concepts. By theoretical analysis of characteristic change of intent reduction of lattice nodes during incremental construction of concept lattice, it advances an incremental algorithm to compute intent reduction based on Godin algorithm.
Keywords
data analysis; data mining; knowledge representation; Godin algorithm; concept lattice; data analysis; incremental construction; intent reduction computation; knowledge discovery; knowledge representation; Algorithm design and analysis; Arrays; Buildings; Classification algorithms; Construction industry; Labeling; Lattices;
fLanguage
English
Publisher
ieee
Conference_Titel
Management and Service Science (MASS), 2010 International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-5325-2
Electronic_ISBN
978-1-4244-5326-9
Type
conf
DOI
10.1109/ICMSS.2010.5577345
Filename
5577345
Link To Document