Abstract
A problem of searching a minimum-size feature set to use in distribution of multidimensional objects in classes, for instance with the help of classifying trees, is considered. It has an important value in developing high speed and accuracy classifying systems. A short comparative review of existing approaches is given. Formally, the problem is formulated as finding a minimum-size (minimum weighted sum) covering set of discriminating 0,1-matrix, which is used to represent capabilities of the features to distinguish between each pair of objects belonging to different classes. There is given a way to build a discriminating 0,1-matrix. On the basis of the common solving principle, called the group resolution principle, the following problems are formulated and solved: finding an exact minimum-size feature set; finding a feature set with minimum total weight among all the minimum-size feature sets (the feature weights may be defined by the known methods, e.g. the RELIEF method and its modifications); finding an optimal feature set with respect to fuzzy data and discriminating matrix elements belonging to diapason [0,1]; finding statistically optimal solution especially in the case of big data. Statistically optimal algorithm makes it possible to restrict computational time by a polynomial of the problem sizes and density of units in discriminating matrix and provides a probability of finding an exact solution close to 1.
 Thus, the paper suggests a common approach to finding a minimum-size feature set with peculiarities in problem formulation, which differs it from the known approaches. The paper contains a lot of illustrations for clarification aims. Some theoretical statements given in the paper are based on the previously published works.
 In the concluding part, the results of the experiments are presented, as well as the information on dimensionality reduction for the coverage problem for big datasets. Some promising directions of the outlined approach are noted, including working with incomplete and categorical data, integrating the control model into the data classification system.
Highlights
One of important applied problems in data mining, control and system analysis is reduction of the feature set used in a model
Finding an exact minimum-size feature set; finding a feture set with minimum total weight among all the minimum-size feature sets; finding an optimal feature set with respect to fuzzy data; finding statistically optimal solution especially in the case of big data
We previously found a minimum-size cover 2 { f6, f1, f3} with correspondingly (Table 5)
Summary
One of important applied problems in data mining, control and system analysis is reduction of the feature set used in a model (e.g. classification or recognition ones). This problem attracts serious attention [1,2,3,4,5]. There are three common groups (and their combinations) of methods to realize feature set reduction including filtering, wrapper, and embedded methods. They give different results from the viewpoint of accuracy and computational complexity
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
