[1]QIAO Lijuan,XU Zhangyan,XIE Xiaojun,et al.Efficient attribute reduction algorithm for an incomplete decision table based on knowledge granulation[J].CAAI Transactions on Intelligent Systems,2016,11(1):129-135.[doi:10.11992/tis.201506029]
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
11
Number of periods:
2016 1
Page number:
129-135
Column:
学术论文—知识工程
Public date:
2016-02-25
- Title:
-
Efficient attribute reduction algorithm for an incomplete decision table based on knowledge granulation
- Author(s):
-
QIAO Lijuan1; 2; XU Zhangyan1; 2; XIE Xiaojun1; 2; ZHU Jinhu1; 2; CHEN Xiaofei2; LI Juan2
-
1. Guangxi Key Laboratory of Multi-source Information Mining & Security, Guangxi Normal University, Guilin 541004, China;
2. College of Computer Science and Information Technology, Guangxi Normal University, Guilin 541004, China
-
- Keywords:
-
attribute reduction; knowledge granularity; incomplete decision table; condition attribute frequency; discernibility matrix; heuristic information
- CLC:
-
TP18
- DOI:
-
10.11992/tis.201506029
- Abstract:
-
The use of knowledge granularity is an effective attribute reduction approach. But for a large decision table, computing knowledge granularity is so time-consuming that the algorithm is not efficient for practical use.After the introduction of the discernibility matrix of granularity, a function was designed for calculating the occurrence frequency of condition attributes in the matrix. In this paper, we design an efficient attribute reduction algorithm based on the granularity discernibility matrix. The new algorithm reduces the time and space complexities to O(K|C||U|) (K=max{|Tc(xi)|, xi∈U}) and O(|U|), respectively. The results from our simulation example verify that the proposed algorithm is feasible and highly efficient.