Web Personalisation Using ANN for Query System Optimization

Data mining is the powerful new technology with great potential to analyze important information in the data base .The application area of web usage mining is web personalisation. Web personalization is provide the user the relevant information from a large data set. Here we focus on the query system to find the most appropriate result. We suggest a simple modification to the Kd-tree search algorithm for nearest neighbour search resulting in an improved performance of spatial clustering algorithm .To prove that our approach is better the proposed algorithm is compared with the traditional algorithm (Kd Tree) and also investigate the brute force algo .Approximate Nearest neighbour search (ANN), also known as closest point search which is an optimization problem for finding closest points in metric spaces. Brute force is a trivial but 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. Brute force algo requires no preprocessing phase .A Brute-force algorithm for string matching problem has two inputs to be considered: pattern and text. A k-d tree is a data structure known for organizing some number of points in a space with k dimensions. K-d trees are very useful for range and nearest neighbour searches. In this paper, we studied k-d tree algorithm and implement to our proposed algo to show the better results and than compared to traditional algorithm. An approximate nearest neighbour is to evaluate and compare the efficiency of the data structure when applied on a particular number of data points, and focus on execution time. The work performed is to enhance the performance of kd tree and compared to traditional algo to obtain the optimal results. The aim of the algorithm is to make faster, more accurate and efficient data structure primarily depends on a particular data set. We have implemented a new modified k-d tree for better performance which can be applied for the enhancement of query system in the web personalisation.

[1]  Mohammed Otair,et al.  Approximate k-nearest neighbour based spatial clustering using k-d tree , 2013, ArXiv.

[2]  Yoram Singer,et al.  An Efficient Boosting Algorithm for Combining Preferences by , 2013 .

[3]  S. Chandramathi,et al.  A Review of various k-Nearest Neighbor Query Processing Techniques , 2011 .

[4]  D.M. Mount,et al.  An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Isabelle Alvarez,et al.  A kd-tree algorithm to discover the boundary of a black box hypervolume , 2015, Annals of Mathematics and Artificial Intelligence.

[6]  Deepika Verma,et al.  Comparison of Brute-Force and K-D Tree Algorithm , 2014 .

[7]  David G. Lowe,et al.  Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration , 2009, VISAPP.

[8]  Jon Louis Bentley,et al.  Multidimensional Binary Search Trees in Database Applications , 1979, IEEE Transactions on Software Engineering.

[9]  Jian Sun,et al.  Computing nearest-neighbor fields via Propagation-Assisted KD-Trees , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  S. G. Kulkarni,et al.  Introspection of various K-Nearest Neighbor Techniques , 2013 .

[11]  Divya Christopher,et al.  A Study on Selective Data Mining Algorithms , 2011 .

[12]  Robert F. Sproull,et al.  Refinements to nearest-neighbor searching ink-dimensional trees , 1991, Algorithmica.

[13]  Hanan Samet,et al.  A fast all nearest neighbor algorithm for applications involving large point-clouds , 2007, Comput. Graph..

[14]  Ramesh C. Jain,et al.  Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[15]  Roland Siegwart,et al.  Comparison of nearest-neighbor-search strategies and implementations for efficient shape registration , 2012 .

[16]  Dennis Shasha,et al.  Query Processing for Distance Metrics , 1990, VLDB.

[17]  Vandana,et al.  Survey of Nearest Neighbor Techniques , 2010, ArXiv.

[18]  Ophir Frieder,et al.  Varying approaches to topical web query classification , 2007, SIGIR.

[19]  W.R. Mark,et al.  Fast kd-tree Construction with an Adaptive Error-Bounded Heuristic , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[20]  Shivani Agarwal,et al.  Stability and Generalization of Bipartite Ranking Algorithms , 2005, COLT.

[21]  Pavel Zezula,et al.  Similarity Search - The Metric Space Approach , 2005, Advances in Database Systems.