A Page Sorting Algorithm Based On Session Search Research And Design

With the rapid development of Internet technology,the resources on the Internet is growing more and more.The development of search engines allows users to find the information they need from vast Internet resources.Users can get information they are interested with the help of search engine.The results of web page returned to users affect satisfaction of search engine,and the core technology of search engine's results is page sorting algorithm.Nowadays,two of most popular sorting algorithm are Google's PageRank and IBM's HITS,which based on the linking of web'pages.The more a page is linked by other pages,the topper it is in the results of query.But the algorithm mentioned above barely consider the interaction of users and search engines,so there exists large room for improvement.More and more studies of search engine focus on the sorting algorithm.First,this paper introduces some popular page sorting algorithm and the MDP model of the search engine,then proposes a kind of QCM web page sorting algorithm,which base on user searching session.By using the change of user searching syntax,the change of the query and the relationship between the forming queries,the algorithm reinforce the search.And the effectiveness of the algorithm is verified by experiment.Finally,an information retrieval prototype system is designed based on QCM page sorting algorithm.The results show that the method can be useful.In this paper,a new web-page sorting algorithm based on user searching session is proposed.The algorithm focuses on the interaction between the user and the search engine,and focuses on the change of the search words in the process of user search.And the new kind of web page sorting algorithm's name is QCM.Finally,after designing and making experiment,it is verified that the QCM page sorting algorithm proposed in this paper has a great improvement in sorting efficiency.