G.Manoranjitham, M.Ramesh
Creating search histories is a difficult process in the web and organizing the user search logs is rapidly increasing in the field of data mining for finding the user interestingness. Daily billions of queries can be passed to the server for relevant information, most of the search engines retrieves the information based on the query similarity score or related links with respect to the given query. This paper explains the problem of organizing a user’s historical queries into groups in a dynamic and automated fashion. This paper go beyond approaches that rely on textual similarity or time thresholds, and propose a more robust approach that leverages search query logs. The Incremental algorithm is used as IAssociation rule and ICover graph. This work experimentally study the performance of different techniques, and showcase their potential, especially when combined together.