Quick complete attribute reduction algorithm

Authors:
Chuanjian Yang;Hao Ge;Guangshun Yao;Lisheng Ma
Affiliations:
Dept. of Computer Science, Chuzhou University, Chuzhou, P.R. China;Dept. of Electronic and Information Engineering, Chuzhou University, Chuzhou, P.R. China;Dept. of Computer Science, Chuzhou University, Chuzhou, P.R. China;Dept. of Computer Science, Chuzhou University, Chuzhou, P.R. China
Venue:
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 4
Year:
2009

Citing 1
Cited 2

Reduction algorithms based on discernibility matrix: the ordered attributes method

Journal of Computer Science and Technology

Rough set based quality of service design for service provisioning in clouds

RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Intelligent agent-based intrusion detection system using enhanced multiclass SVM

Computational Intelligence and Neuroscience

Quantified Score

Hi-index	0.00

Visualization

Abstract

To improve the efficiency of attribute reduction and obtain the minimal attribute reduction, the notion of consistent simplified decision table is proposed. The concentrated discernibility set is created in the consistent simplified decision table, and an algorithm of completeness attribute reduction based on concentrated discernibility set is put forward. The least information of attribute reduction is withheld in concentrated the discernibility set, so the efficiency of the algorithm is improved. In addition, the heuristic method is used to select the deleted attribute, which better ensure to acquire the minimal reduction. The experimental results show that the algorithm is correct and effective.