Abstract
A commonly used approach for feature selection is to select those features that extremize certain probabilistic distance measures. In most of the procedures it is assumed that the labels of the patterns are perfect. There are many practical situations in which the labels of the patterns are imperfect. This paper examines the applicability of the extremization of the Bhattacharyya distance, the divergence, equivocation, Kalmogrov variational distance, and Matusita distance as criteria for selecting the effective features from imperfectly identified patterns.
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 callMore From: International Journal of Computer & Information Sciences
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.
