An association rules mining method based on semantic relativity is proposed to solve the problem that there are more candidate item sets and higher time complexity in traditional association rules mining.Semantic rela...An association rules mining method based on semantic relativity is proposed to solve the problem that there are more candidate item sets and higher time complexity in traditional association rules mining.Semantic relativity of ontology concepts is used to describe complicated relationships of domains in the method.Candidate item sets with less semantic relativity are filtered to reduce the number of candidate item sets in association rules mining.An ontology hierarchy relationship is regarded as a directed acyclic graph rather than a hierarchy tree in the semantic relativity computation.Not only direct hierarchy relationships,but also non-direct hierarchy relationships and other typical semantic relationships are taken into account.Experimental results show that the proposed method can reduce the number of candidate item sets effectively and improve the efficiency of association rules mining.展开更多
To improve the performance of the ontology matching process, a more efficient ontology matching algorithm, which can effectively eliminate unnecessary operations of matching entities, is proposed. By the theoretical a...To improve the performance of the ontology matching process, a more efficient ontology matching algorithm, which can effectively eliminate unnecessary operations of matching entities, is proposed. By the theoretical analysis and proof, a set of matching rules are summarized for depicting inherent relations among matching results of entities. Based on these rules, the proposed algorithm can reuse the matching results of two entities to directly determine the matching results of their adjacent entities. Thereby, redundant operations of matching adjacent entities can be avoided, which can improve the performance of the whole matching process. The experimental results show that, compared with related algorithms, the proposed algorithm has high matching accuracy and can remarkably reduce the consuming time of the whole matching process. So, the proposed algorithm is more competent for the large-scale ontology matching which often occurs in the practical heterogeneous web resources integration project.展开更多
In order to solve the semantic irreconcilable problems caused by contextual differences during the process of ontology integration, a context-driven reconciliation mechanism is proposed. The mechanism is based on the ...In order to solve the semantic irreconcilable problems caused by contextual differences during the process of ontology integration, a context-driven reconciliation mechanism is proposed. The mechanism is based on the previous work about a context-based formalism-Context-SHOIQ （D ＋ ） DL, which is used for explicitly representing context of ontology by adopting the description logic and the category theory. The formalism is extended by adding four migration rules （InclusionRule, SelectionRule, PreferenceRule, and MappingRule）, that are used to specify what should be imported into the IntegrativeContext, and three related contextual integration operations of increasing interoperability （import, partial reconciliation, and full reconciliation）. While not exhaustive, the mechanism is sufficient for solving the five types of semantic irreconcilable problems that are discussed, and favors integration of ontologies from one context to another.展开更多
Currently, knowledge-based sharing and service system has been a hot issue and knowledge fusion, especially for implicit knowledge discovery, becomes the core of knowledge processing and optimization in the system. In...Currently, knowledge-based sharing and service system has been a hot issue and knowledge fusion, especially for implicit knowledge discovery, becomes the core of knowledge processing and optimization in the system. In the research, a knowledge fusion framework based on agricultural ontology and fusion rules was pro- posed, including knowledge extraction, clearing and annotation modules based on a- gricultural ontology, fusion rule construction, choosing and evaluation modules based on agricultural ontology and knowledge fusion module for users＇ demands. Finally, the significance of the framework to system of agricultural knowledge services was proved with the help of a case.展开更多
基金The National Natural Science Foundation of China(No.50674086)Specialized Research Fund for the Doctoral Program of Higher Education(No.20060290508)the Science and Technology Fund of China University of Mining and Technology(No.2007B016)
文摘An association rules mining method based on semantic relativity is proposed to solve the problem that there are more candidate item sets and higher time complexity in traditional association rules mining.Semantic relativity of ontology concepts is used to describe complicated relationships of domains in the method.Candidate item sets with less semantic relativity are filtered to reduce the number of candidate item sets in association rules mining.An ontology hierarchy relationship is regarded as a directed acyclic graph rather than a hierarchy tree in the semantic relativity computation.Not only direct hierarchy relationships,but also non-direct hierarchy relationships and other typical semantic relationships are taken into account.Experimental results show that the proposed method can reduce the number of candidate item sets effectively and improve the efficiency of association rules mining.
基金R & D Infrastructure and Facility Development(No2005DKA64201)the National High Technology Research and De-velopment Program of China (863Program) (No2006AA12Z202)
文摘To improve the performance of the ontology matching process, a more efficient ontology matching algorithm, which can effectively eliminate unnecessary operations of matching entities, is proposed. By the theoretical analysis and proof, a set of matching rules are summarized for depicting inherent relations among matching results of entities. Based on these rules, the proposed algorithm can reuse the matching results of two entities to directly determine the matching results of their adjacent entities. Thereby, redundant operations of matching adjacent entities can be avoided, which can improve the performance of the whole matching process. The experimental results show that, compared with related algorithms, the proposed algorithm has high matching accuracy and can remarkably reduce the consuming time of the whole matching process. So, the proposed algorithm is more competent for the large-scale ontology matching which often occurs in the practical heterogeneous web resources integration project.
文摘In order to solve the semantic irreconcilable problems caused by contextual differences during the process of ontology integration, a context-driven reconciliation mechanism is proposed. The mechanism is based on the previous work about a context-based formalism-Context-SHOIQ （D ＋ ） DL, which is used for explicitly representing context of ontology by adopting the description logic and the category theory. The formalism is extended by adding four migration rules （InclusionRule, SelectionRule, PreferenceRule, and MappingRule）, that are used to specify what should be imported into the IntegrativeContext, and three related contextual integration operations of increasing interoperability （import, partial reconciliation, and full reconciliation）. While not exhaustive, the mechanism is sufficient for solving the five types of semantic irreconcilable problems that are discussed, and favors integration of ontologies from one context to another.
基金Supported by Specialized Funds of CASIndividual Service System of Agricultural Information in Tibet(2012-J-08)+1 种基金Science and Technology Funds of CASMultimedia Information Service in Rural Area based on 3G Information Terminal(201219)~~
文摘Currently, knowledge-based sharing and service system has been a hot issue and knowledge fusion, especially for implicit knowledge discovery, becomes the core of knowledge processing and optimization in the system. In the research, a knowledge fusion framework based on agricultural ontology and fusion rules was pro- posed, including knowledge extraction, clearing and annotation modules based on a- gricultural ontology, fusion rule construction, choosing and evaluation modules based on agricultural ontology and knowledge fusion module for users＇ demands. Finally, the significance of the framework to system of agricultural knowledge services was proved with the help of a case.
