PLST: Point Location Using Search Technique Algorithms
Journal: International Journal of Advanced Computer Research (IJACR) (Vol.3, No. 8)Publication Date: 2013-03-25
Authors : Syed Jaffar Abbas Raju Manjhi;
Page : 280-283
Keywords : Data mining; k - d tree; point location; A* algorithm; PLS T algorithm;
Abstract
Search technique is a basic tool of data mining. A hierarchical search technique for point location based on k - d tree i s introduced. Algorithms of building and traversing this bi nary data structure are explained . In this technique we will go over how to use a k - d tree for finding the k nearest neighbours o f a specific point or location and then will also go over how to find all neighbours within some distance specified by the user.
Other Latest Articles
- Study on Testing as a Service on Cloud
- New Lightweight Security Protocol for VANET by Using Registration Identity and Group Certificate
- A Robust Technique for Feature-based Image Mosaicing using Image Fusion
- Effective Performance Evaluation of On-Demand Routing Protocol for Cognitive Radio Ad Hoc Network
- Implementing Log Based Security in Data Warehouse
Last modified: 2013-04-02 20:03:57