Vector Approximation File: Cluster Bounding in High-Dimension Data Set
Mridu Sahu, Poonam Yerpude · 2011
Abstract— In many modern application ranges high-dimensional feature vectors are used to model complex data sets. We have proposed an overview about efficient indexing method for high-dimensional database using an filtering approach known as vector approximation approach which supports the nearest neighbor search efficiently And A cluster distance bound based on separating hyper planes, that complements our index in electively retrieving clusters that contain data entries closest to the query. The Creation of approximation for Vectors for use in similarity (also known the retrieval of k-nearest neighbor) is examined.