Attribute reduction algorithm for incomplete decision table based on attribute discernibility

被引：0
作者：
机构：
[1] Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education, Anhui University, Hefei 230039, Anhui
[2] School of Computer Science and Technology, Anhui University, Hefei 230601, Anhui
来源：
Ji, X. (jixia1983@163.com) | 1600年 / South China University of Technology卷 / 41期
关键词：
Attribute discernibility; Attribute reduction; Consistent block; Incomplete decision table;
D O I：
10.3969/j.issn.1000-565X.2013.01.013
中图分类号：
学科分类号：
摘要：
Proposed in this paper is a novel attribute reduction algorithm based on the attribute discernibility to reduce the high computational complexity of the existing attribute reduction algorithms for incomplete decision tables. In the investigation, the external manifestation of condition attribute significance relative to the decision attribute in incomplete decision tables is analyzed, the attribute discernibility is defined, and the calculating method of dynamic update of attribute discernibility with the change of reduction subset is proposed. During the attribute reduction, the algorithm continuously deletes the objects belonging to the positive domain or the consistent blocks having no effect on the positive domain calculation. Thus, the data scale and the time consumption decreases, and the attribute reduction quickens. Theoretical analyses and simulation experiments demonstrate that the proposed attribute reduction algorithm for incomplete decision tables is effective and is superior to the existing algorithms in terms of time complexity.
引用
收藏
页码：83 / 88
页数：5
相关论文
共 15 条
  • [1] Pawlak Z., Rough sets, International Journal of Computer and Information Science, 11, 5, pp. 341-356, (1982)
  • [2] Liu Y., Xiong R., Chu J., Quick attribute reduction algorithm with Hash, Chinese Journal of Computers, 32, 8, pp. 1493-1499, (2009)
  • [3] Wang S.K.M., Ziarko W., On optional decision rules in decision table, Bulletin of Polish Academy of Sciences, 33, 11-12, pp. 693-696, (1985)
  • [4] Hu X., Nick C., Learning in relational databases: A rough set approach, International Journal of Computational Intelligence, 11, 2, pp. 323-338, (1995)
  • [5] Liang J.Y., Xu Z.B., The algorithm on knowledge reduction in incomplete information systems, International Journal of Uncertainty, Fuzziness and Knowledge Based Systems, 24, 1, pp. 95-103, (2002)
  • [6] Huang B., Zhou X.-Z., Zhang R.-R., Attribute reduction based on information quantity under incomplete information systems, System Engineering Theory and Practice, 4, 4, pp. 55-60, (2005)
  • [7] Meng Z.Q., Shi Z.Z., A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets, Information Science, 179, 16, pp. 2774-2793, (2009)
  • [8] Xie J.-Y., Li N., Qiao Z.-R., Feature subset selection algorithm for incomplete decision systems based on neighborhood rough sets, Journal of Nanjing University: Nature Sciences, 47, 4, pp. 383-390, (2011)
  • [9] Hu Q.H., Yu D.R., Liu J.F., Et al., Neighborhood rough set based heterogeneous feature subset selection, Information Science, 178, 18, pp. 3577-3594, (2008)
  • [10] Hu Q.H., Liu J.F., Yu D.R., Mixed feature selection based on granulation and approximation, Knowledge-Based System, 21, 4, pp. 294-304, (2008)
12