Abstract
This paper considers a two-step approach to solving the problem of multidimensional data search in which, first, the dimensionality of the original data set is reduced and only then the index structure is built in the low-dimensional space. To reduce the dimensionality, the nonlinear dimensionality reduction method with the use of reference nodes is applied. R-trees are used as the index structure. The carried out experiments show that this approach can be used for rapid prefiltering of multidimensional data.
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.
