Author : Guddati Venkata Satya Sriram 1
Date of Publication :7th December 2017
Abstract: The volume of various non-textual content data is growing exponentially in the present viable universe. A conventional way of extracting helpful information from such records is to direct substance material generally in view of likenesses exertion. The most effective method to manufacture data frameworks to enable youthful comparability to discover on a major scale is an issue of developing significance. The endeavor is that trademark stacked actualities are normally spoken to as unreasonable dimensional trademark vectors, and the scourge of dimensionality orders that as dimensionality develops, any hunt methodology analyzes an expanding number of huge parts of the dataset lastly worsens its execution. In this article, we take a gander at a few key issues to enhance the precision and effectiveness of high-dimensional comparability asks. This paper is set non-surmised quickening of high-dimensional nonparametric operation including k closest neighbor classifiers. We endeavor to make the most the way that despite the fact that we require particular responses to nonparametric questions, we by and large don't have to expressly find the records directs close Toward the Inquiry, however simply need to answer inquiries concerning the homes of that arrangement of records focuses
Reference :
-
- V. Athitsos, J. Alon, S. Sclaroff, and G. Kollios, “BoostMap: A method for efficient approximate similarity rankings,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2004, vol. 2, pp. II-268–II- 275.
- V. Athitsos, M. Hadjieleftheriou, G. Kollios, and S. Sclaroff, “Query-sensitive embeddings,” ACM Trans. Database Syst., vol. 32, no. 2, p. 8, 2007.
- C. Bohm, S. Berchtold, and D. A. Keim, “Searching in high-dimen- € sional spaces: Index structures for improving the performance of multimedia databases,” ACM Comput. Surv., vol. 33, no. 3, pp. 322–373, 2001.
- L. Boytsov and B. Naidan, “Learning to prune in metric and nonmetric spaces,” in Proc. Adv. Neural Inf. Process. Syst., 2013, pp. 1574–1582.
- J. Brandt, “Transform coding for fast approximate nearest neighbor search in high dimensions,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2010, pp. 1815–1822
- P. Ciaccia, M. Patella, and P. Zezula, “M-tree: An efficient access method for similarity search in metric spaces,” in Proc. 23rd Int. Conf. Very Large Databases, 1997, pp. 426–435.
- M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, “Localitysensitive hashing scheme based on p-stable distributions,” in Proc. Symp. Comput. Geometry, 2004, pp. 253–262