Heuristic Algorithm for Attribute Reduction in Information Concept Lattice Based on the Close- Degree

摘要：

The concept lattice is an efficient tool of data analysis and knowledge processing. This paper first puts forward the closedegree 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.

关键词： informationformalcontext informationconcept lattice close-degree attribute reduction

作者: GUI Xian-cai

作者单位: Mathematics and Computational Science School, Zhanjiang Normal University Zhanjiang, China

会议类型: 国际会议

会议名称: 2011 International Conference on Business Management and Electronic Information(2011商业管理与电子信息国际学术会议 BMEI2011)

会议地点: 广州

会议语种:英文

页码: 1-4

在线出版日期: 2011-05-13（万方平台首次上网日期，不代表论文的发表时间）