Clustering Web Search Results Based on Interactive Suffix Tree Algorithm

Clustering is an effective way to organize Web search results, which allows users to navigate into relevant documents quickly. Traditional clustering techniques are inadequate to Chinese search results and do not generated clusters with highly readable names. In this paper, we propose a new method to clustering Web search results which is based on interactive suffix tree algorithm (ISTC). This method uses phrase extracted from the snippets as characteristics of clustering. In the course of interaction with users, it only returns cluster label to users in the first tier. When users want to make further interaction, users can select a document which they are interested in for the second clustering instead of the traditional recursive clustering. ISTC can also be applied to Chinese and English information processing which avoids the recursive algorithm for achieving linear time complexity and improving the efficiency of search engine. Experimental results verify our methodpsilas feasibility and effectiveness.