One Double-Reduct Approach to Get Key Rules and the Experiment in Prison Computer Information Security

摘要

We introduce one Double-Reduct approach to get key rules of data set in this paper. Adopting rule usefulness as a measure of key rules, our approach greatly reduces the rule numbers comparing to the traditional method. Through an experimental study of computer information security in prison, this approach is proved to be feasible and effective.