DocumentCode
1843494
Title
Heuristic algorithm for attribute reduction in information concept lattice based on the close-degree
Author
Gui Xian-cai
Author_Institution
Math. & Comput. Sci. Sch., Zhanjiang Normal Univ., Zhanjiang, China
Volume
1
fYear
2011
fDate
13-15 May 2011
Firstpage
690
Lastpage
693
Abstract
The concept lattice is an efficient tool of data analysis and knowledge processing. This paper first puts forward the close-degree of information concept lattice, define the significance of attribute and design a heuristic algorithm for attribute reduction on information concept lattice. Finally, a real example is used to demonstrate both its feasibility and effectiveness.
Keywords
data analysis; data reduction; heuristic programming; knowledge engineering; attribute reduction; data analysis tool; heuristic algorithm; information concept lattice; knowledge processing; Algorithm design and analysis; Context; Data analysis; Heuristic algorithms; Knowledge engineering; Lattices; attribute reduction; close-degree; information concept lattice; information formal context;
fLanguage
English
Publisher
ieee
Conference_Titel
Business Management and Electronic Information (BMEI), 2011 International Conference on
Conference_Location
Guangzhou
Print_ISBN
978-1-61284-108-3
Type
conf
DOI
10.1109/ICBMEI.2011.5917030
Filename
5917030
Link To Document