Abstract
Locality sensitive discriminant analysis (LSDA) is a method considering both the discriminant and geometrical structure of the data. Within-class graph and between-class graph are first constructed to discover both geometrical and discriminant structure of the data manifold. Then a proportional constant is used to measure the different importance of two graphs. Finally, a reasonable criterion is used to choose a good map so that the connected points of within-class graph stay as close as possible while connected points of between-class graph stay as distant as possible. The key technique of LSDA is nearest neighbor graph construction. In this paper, we compared two different nearest neighbor graph construction methods. The experiment results demonstrate that splitting a nearest neighbor into equally sized with class graph and between-class graph has smaller amount of computations while construct within-class graph and between-class graph by using different sized nearest neighbors could improving the accuracy.
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 callDisclaimer: 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.
