Abstract
For large collections of melodies, it is too slow to calculate the distance of the query object from all the test objects. A reasonably fast method is needed to coarse sieve and identify a set of closest tunes .One way to achieve this is by using nearest neighbour methods on indexed database. Graph Spectra [1] Indexing method, which index tunes using their Laplacian spectra have proved successful in finding nearest neighbours of a query melody. In this paper we propose a modified version of Graph Spectra indexing method called Ratio Graph Spectra. A comparison of commonly used geometric methods such as Earth Movers Distance (EMD) and Indexing methods specifically Graph Spectra with Ratio Graph Spectra is conducted. We observed that R Graph Spectra indexing method outperformed other methods giving up to 80 % accuracy in retrieving nearest neighbour for a query tune.
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.
