The Finite Study And The Algorithms Implement Of Formal Context Kernel

The network technique raised the existence quantity and the character of the person consumedly, making one becomes a social person, a global person, meanwhile, the universality of the network offers us a great deal of information, which brings us convenient and also a lot of problems,Firstly, the information is too excessive, hard to digest, secondly, the authenticity of information is not easy to judge. Thirdly, it is difficult to assure the safety of the information. Fourthly, the form of the information is so various that it's hard to process coincidently.Hence the people start considering"How to discover useful knowledge and how to boost information utilization?"Face to this challenge, the data mining and knowledge discover technique emerges, and displays the strong vitality.As the concept lattice in formal concept analysis has good mathematical properties, and adapt to process in block and also it can express the relation between concepts clearly, we deem the concept lattice model a very ideal tool for data mining.The theory of formal concept analysis (FCA) starts from the basic data form called context. So the context scale is an important factor that affects the construction and the application of the lattice.Therefor, this paper studies the context general and systemic, puts forward the concept and the correlative limitative theorem of the context kernel. An arbitrary context could be denoted using finite elements in the context kernel, and the new lattice could quickly be built by those of these kernel elements. The main study involves context extracting, partitioning, reducting, isomorphic detecting, algebraic character and building algorithms of the context kernel. We suggest the partition algorithms and the reduction algorithms by means of the thoughts of reducing the context scale. By the notions of the formal context base, we implement the algorithms and prove the...