Application of Approximate Nearest Neighbor Search Algorithms-KD Tree

Abstract

Chapter 1: INTRODUCTION 1.1 Introduction Over the last decade, a very large amount of information has become available. From collections of camera pictures, to biological information, and to network traffic data, modern and cheap storage technologies have made it possible to gather such heavy datasets. But can we effectively use all this data or information? The ever increasing sizes of the datasets make it necessary to design new algorithms which must be capable of shifting through this data with extreme efficiency.