摘要
提出了一种改进的启发式算法,与已有启发式算法相比,能从搜索空间中逐次删除冗余属性,避免了对其重要性的重复计算,同时减少对非冗余属性重要性的计算,从而降低了时间复杂度。通过实例表明了该约简算法的可行性与有效性。
An improved heuristic algorithm is proposed.Compared with those existed heuristic algorithms,its flexibility has been increased because calculating the important value of unimportant attributes repeatedly can be avoided by removing unimportant attributes gradually from the search space.Futhermore,the improved heuristic algorithm reduces calculating the important value of attributes,it futher reduces the time complexity.Finally,an example is used to demonstrate both the feasibility and validity of the proposed algorithm.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第8期146-148,共3页
Computer Engineering and Applications
基金
国家自然科学基金(No.70861001)
广西自然科学基金(No.0991027)~~
关键词
形式背景
概念格
属性约简
启发式算法
formal context concept lattice attribute reduction heuristic algorithm