An Efficient Algorithm for Reduction of Attribute in Information Systems

摘要：

An efficient algorithm for reduction of attribute in information systems is put forward, whose time complexity is maxO((|C|+|D|)|U|),O(|C|<2>|U|)). Compared with those existing heuristic algorithms, its flexibility has been increased because calculating the important value of unimportant attribute repeatedly can be avoided by removing unimportant attributes gradually from the search space. The theoretical analysis and experimental results show that this algorithm is much less time complexity than those existed algorithms; and a real example demonstrates its feasibility and effectiveness, respectively.

关键词： information systems Reduction of attribute Heuristic algorithm Time complexity

作者: Yue-jin Lv Jin-hai Li

作者单位: School of Mathematics and Information Sciences, Guangxi University, Nanning 530004, P.R. China School of Mathematics and Information Sciences Guangxi University, Nanning 530004, P.R. China

会议类型: 国际会议

会议名称: 第三届IEEE无线通讯、网络技术暨移动计算国际会议

会议地点: 上海

会议语种:英文

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