Research On Theory And Technology Of Pseudo-intent And Processing The Information Of Semantic Networks

With the rapid development of the computer technology and the increasing popularity of the network application, the information of the World Wide Web goes up massively, and we need to deal effectively with massive amounts of data information. Faced with these information of network and the depiction of nature and expression about network knowledge, some formal system tools which have been formed are all indispensable. Such as Formal Concept Analysis, Ontology which based on Semantic Web, the method of information processing and knowledge reasoning based on Description Logic and so on. Among them, the concept lattice and formal context in formal concept analysis are a better method of knowledge representation. While intent and pseudo-intent is extremely important to be found in formal context, on its basis we derived implicit knowledge in the field of knowledge and then identify the relationship between the various properties, as well as the correspondence between the properties and individuals, so that help us deal with the circulation of information on the Internet effectively. At present, pseudo-intent has become a hot research tipic in the field of formal concept analysis.In today’s network of information and knowledge era, formal concept analysis as powerful data analysis tools which have played a certain role in the expressive power and reasoning, while pseudo-intent as important concepts in formal concept analysis and all of them represents the core set of attributes at different levels. We proposed the axiomatic set of implication in the syntax, which can apply the information processing and knowledge engineering to improve the level of reasoning. So FCA theory, especially the "pseudo-intent set" to seek and "the set of implication" to establish have become the key to a lot of problems in the field of information processing. Node part of Semantic Web is actually Ontology library or Description logic library, however,the hierarchical relationship between concepts depicts more clearly under the theoretical framework of the FCA, and this hierarchical structure is very close to the ontology concept. The relationship between the concept and the concept contained in the ontology has certain similarities with the concept lattice in formal concept analysis, the ontology is actually a lattice structure, and the formal concept analysis applied to the ontology can overcome ontology’s own shortcomings. Therefore, the study of theoretical knowledge and technology about pseudo-intent has a higher practical value and theoretical value.The innovation of this paper is that our theoretical research on pseudo-intent is pioneering in domestic, and we clearly describe some basic concept issues which are related to the theory of pseudo-intent for the first time. This paper described the redundant computations about existing calculation method based on generating all pseudo-intents with minimal generators of formal concept (GPI algorithm), then propose a new algorithm was used to seek "pseudo-intent set", which is called "Based on the structure of the lattice for comprehensive algorithm of HLB under cover set"(Hybrid Lattice Based pseudo-intent algorithm).The main research contents of this paper include the following aspects:Firstly, the basis theoretical knowledge of semantic web, ontology, description logic and formal concept analysis are detailedly introduced. The goal of the semantic web is to make the information on the web with a computer-understandable semantic, while ontology as a basis of the semantic web application describes some semantic about it. In order to deal with the generalized information well, it must build ontology knowledge base which is supported by description logic language under the environment of the semantic web. At present, the construction of ontology still use the method of concept lattice structure.Secondly, the in-depth and comprehensive research on the structural properties of intent and pseudo-intent is pioneering in domestic. We depict all possible pseudo-intents of formal context from the lattice structure of formal concept lattice, and given the specific elements of these pseudo-intents.Thirdly, through the analysis of previous reference which is called generating all pseudo-intents with minimal generators of formal concept, we find that this algorithm has several types of redundant computations, and illustrate these redundant computations and storage will exist in any concept lattice structure.Finally, combining the research on characteristics and classification about pseudo-intents of intent B, this paper gives hierarchical decomposition about pseudo-intents of nodes on concept lattice, and on this basis, we propose a comprehensive algorithm of HLB which based on the structure of the lattice under cover of set B.In this paper, we propose a comprehensive algorithm of HLB which was used to seek all pseudo-intents from a formal context through further research and analysis of structure properties about pseudo-intent. This algorithm can effectively obtain all pseudo-intents from a formal context, and the correctness and completeness of the algorithm are also described.