The Improvement Of Godin Algorithm And The Application Of Formal Concept Analysis In The Intelligent Search Engine

Using the traditional search engines may cause some problems, such as scanning too much irrelevant information or scanning little relevant information, In order to solve these problems, we try to find some efficient ways. The optimal way is using intelligent search engine. In Formal Concetp Analyse, concept lattice has good mathematical characters and is suitable for batching and can be denoted relations between concepts, so concept lattice model is an admirable tool while doing search on intelligent search engine. Considering that we have to process a lot of data, we choose the distributed concept lattice model. The aim of this paper is to introduce the mathematical models of concept lattice, study its mathematical properties, discuss the lattice construction algorithms, and provide mathematical foundation for its distributed storage and parallel processing. Following these steps, we will do some preparatory search on intelligent search engine. (1) The defects in the traditional search engine system are introduced including the necessarity and the possibility of the Intelligent Search Engine. It also appears that concept model can be readily applied to the development of the Intelligent Search Engine. (2) Introduce the mathematical foundations of the concept lattice and some definitions in lattice theory as same as concept model related order theory. We give two kinds of lattice construction algorithms: batch algorithms and incremental algorithms. The details of classical batch algorithms, such as Bordat and Chein algorithms, and classical incremental algorithms such as Godin algorithms are introduced particularly, moreover, propose an improved Godin algorithm. (3) We build a mathematical model of distributed concept lattice and discuss the union operation to combine two extention-independent same field lattices, and besides, introduce concept lattice algorithms and its parallel construction. Also, give a description of the characters and the actuality of parallel calculate with an exhaustive analysis of one of the parallel construction algorithms. (4) Discuss how to extract Formal Concept from different data sources.Mainly from Relation Data base tables and XML. (5) Discuss the Intelligent Search Engine based on FCA analyzing the characters of the routine search engines and the necessarity of the introduction of the Intelligent Search Engine, furthermore the possibility of the application of the FCA to it. Find out the solutions of the two key problems while FCA is applied to the Intelligent Search Engine.