Abstract

In solving most of the practical problems associated with classification, a heuristic approach is widely used. Currently, many heuristic methods and algorithms based on various heuristic criteria have been developed. The most popular criteria are heuristic informational criteria. These criteria are related to the assessment of the separability of these classes and are based on the fundamental hypothesis of recognition compactness, i.e. with an increase in the relationship between classes, their separability improves. If traits maximize relationships, they are called "good." Such heuristic criteria are widely used and give good results in solving practical problems, but they are poorly studied in theoretical terms. At present, the method for choosing non-informative features, taking into account the relationship of features based on heuristic criteria, has not yet been developed. The article considers the problem of determining informative features by eliminating uninformative ones.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.