The Application And The Research Of The Association Rules In The Search Engine

Because the traditional search engine keywords extraction algorithm exists so many Limitations at the time of the retrieval,in this paper,the association rules in data mining algorithms will be improved, and combined it with the search engine technology to be a way to improve the rate of recall and precision rates in the traditional search engines.The paper mainly consists of two main parts:In first part,using the improved non-weighted association rules will be integrated with the Search Engine technology. Firstly using the improved classic Apriori algorithm of the Association rules to solve the problems in traditional search engines, and then find the new problems,lastly, introduce the concept of two kinds of FP-tree to solve the new problems.In second part, the study of non-association rules being applied to search engines did not concern the weight problem of every words, In order to meet the ture condition, introduce the related theorem for improving the FP-tree to solve the new problems.Done the main work and the research are as follows:(1)Because there is the problem of the low recall rate and the low precision rates in the traditional keyword algorithm,in this paper,the improved traditional classical apriori algorithm will be integrated very well with the Search Engine technology; It is the first time to combined the association rules and the Search Engine technology.(2) Because the improved apriori algorithm repeatedly scans the datas of the database,and its efficiency is too low, the concept of the FP-tree will be referenced to solve this problem.(3) Because the improved algorithm did not consider the weights of the web pages items, and it does not meet the actual situation, in this paper, with the degree of the weighted support to solve the problem to search the weighted term.(4) Because the methods of the weighted filter is not fine, in this paper,with the idea of the tree to solve this problems.