Abstract
This paper presents a new nonlinear approximate indexing method for high-dimensional data such as multimedia data. The new indexing method is designed for approximate similarity searches and all the work is performed in the transformed Gaussian space. In this indexing method, we first map the input space into a feature space via the Gaussian mapping, and then compute the top eigenvectors in the Gaussian space to capture the cluster structure based on the eigenvectors. We describe each cluster with a minimal hypersphere containing all objects in the cluster, derive the similarity measure for each cluster individually and construct a bitmap index for each cluster. Finally we transform the nearest neighbor query into the hyper-rectangular range query and search the clusters near the query point. The experimental results for our new indexing method show considerable effectiveness and efficiency.
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: International Journal of Software Engineering and Its Applications
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.
