Abstract
A method for finding the optimal distance function for the classification problem with two classes in which the objects are specified by vectors of their ordinal features is proposed. An optimal distance function is sought by the minimization of the weighted difference of the average intraclass and interclass distances. It is assumed that a specific distance function is given for each feature, which is defined on the Cartesian product of the set of integer numbers in the range from 0 to N − 1 and takes values from 0 to M. Distance functions satisfy modified metric properties. The number of admissible distance functions is calculated, which enables one to significantly reduce the complexity of the problem. To verify the appropriateness of metric optimization and to perform experiments, the nearest neighbor algorithm is used.
Sign-in/Register to access full text options 
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: Computational Mathematics and Mathematical Physics
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.
