Comparison of Brute-Force and K-D Tree Algorithm

Download Now
Provided by: International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)
Topic: Big Data
Format: PDF
Data mining may be viewed as the extraction of the hidden predictive information from large databases, is a powerful new technology with great potential to analyze important information in the data warehouse. Nearest Neighbor Search (NNS), also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces. Brute-force search is a very general problem-solving technique that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement.
Download Now

Find By Topic