Abstract

A classification approach called angle-based neighborhood graph (ANG) is proposed in this paper, which can flexibly define the neighborhood of a given query sample based on the geometrical relation established using an angle parameter. The proposed ANG is geometrically intuitive and can be readily implemented. Compared with the traditional neighborhood graph classifiers, ANG can adjust the size of the neighborhood by tuning the angle parameter to obtain better classification accuracy. To deal with the parameter selection in ANG, an evidential reasoning based approach is proposed. Experimental results are provided for comparing ANG and the traditional neighborhood graph classifiers, including Gabriel Graph (GG), Relative Neighborhood Graph (RNG), β skeletons, and adaptive weighted k nearest neighbors classifiers. It can be concluded that ANG is a simple yet flexible and effective classifier, and the evidential reasoning based parameter selection approach for ANG is also effective.

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.