Abstract: This paper considers the problem of concept generalization in decision-making systems where such features of real-world databases as large size, incompleteness and inconsistence of the stored information are taken into account. The methods of the rough set theory (like lower and upper approximations, positive regions and reducts) are used for the solving of this problem. The new discretization algorithm of the continuous attributes is proposed. It essentially increases an overall performance of generalization algorithms and can be applied to processing of real value attributes in large data tables. Also the search algorithm of the significant attributes combined with a stage of discretization is developed. It allows avoiding splitting of continuous domains of insignificant attributes into intervals.

Keywords: knowledge acquisition, knowledge discovery, generalization problem, rough sets, discretization algorithm.

ACM Classification Keywords: H.2.8 Database Applications: data mining; I.2.6 Learning: knowledge acquisition; B.2.4 High-Speed? Arithmetic: algorithms.

Link:

THE DEVELOPMENT OF THE GENERALIZATION ALGORITHM BASED ON THE ROUGH SET THEORY

Marina Fomina, Alexey Kulikov, Vadim Vagin

http://www.foibg.com/ijita/vol13/ijita13-3-p09.pdf