Abstract

Web mining is one among the thrust area of research in the data mining domain. The classification of query recommendation can be divided into two major classes that are document-based approach and log-based approach. Log-based method can get relatively good query recommendation and find query inner relation. Query flow graph is one of log-based method and get relatively good recommendation. However, query flow graph cannot get query semantic information. And there are many isolated nodes because of data sparseness. Therefore, word2vec is used to define the query semantic and add query semantic to query flow graph. That can be able to modify query transfer probability which is calculated by query flow graph. At the same time, we can get connection between the isolated queries that are related but no connection due to the data sparseness and the inaccuracy of session split. Empirical tests are conducted in accordance with the AOL log. From the results the efficiency of the approach in suggesting queries and F1 value is about 20% higher than the traditional query flow graph.