• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Ontology Mapping Based on Bayesian Network

    2015-08-07 10:54:14ZHANGLingyu張凌宇TAOBairui陶佰睿

    ZHANG Ling-yu(張凌宇),TAO Bai-rui(陶佰睿)

    Computer Center,Qiqihar University,Qiqihar 161006,China

    Ontology Mapping Based on Bayesian Network

    ZHANG Ling-yu(張凌宇)*,TAO Bai-rui(陶佰睿)

    Computer Center,Qiqihar University,Qiqihar 161006,China

    Ontology mapping is a key interoperability enabler for the semantic web.In this paper,a new ontology mapping approach called ontology mapping based on Bayesian network(OM-BN)is proposed.OM-BN combines the models of ontology and Bayesian Network,and applies the method of M ulti-strategy to com puting sim ilarity.In OM-BN,the characteristics of ontology,such as tree structure and semantic inclusion relations among concepts,are used during the process of translation from ontology to ontology Bayesian network(OBN).Then the method of M ulti-strategy is used to create sim ilarity table(ST)for each concept-node in OBN.Finally,the iterative process of mapping reasoning is used to deduce new mappings from STs,repeated ly.

    component;ontology mapping;multi-strategy;Bayesian networkmodel

    Introduction

    Ontology mapping is to create semantic relations between elements that are from different ontologies,and three main elements are contained in ontology,i.e.,concepts,relations and instances.Both of relations and instances are used to represent concepts,and we can consider concepts as the basic elements of ontology.Therefore,calculation of concept similarity becomes a key step in ontology mapping.There are many different methods to compute concept similarity:the systems of GLUE and LSD,provided by Doan,create ontology mapping using machine learning techniques in Refs.[1-2]. Madhavan et al.[3]proposed amapping method named Cupid,which is a hybrid matcher based on both element-level and structure-levelmatching.Bayesian network(BN)is applied to ontology mapping in Refs.[4-7].However,the approaches in Refs.[1-3]did not consider how to effectively choose multi-strategies to decrease the calculation of similarity. Although the methods in Refs.[4-7],excessively concentrated on the technique of BN,they ignored the characteristics of ontology,such as tree structure and semantic inclusion relations among concepts.

    In this paper,we present a new approach of ontology mapping called ontology mapping based on BN(OM-BN). During the process of ontology mapping in OM-BN,we firstly use the characteristics of ontology,i.e.,tree structure and semantic inclusion relation among concepts,and translate ontology into BN.Here we name the translated BN as ontology BN(OBN)to distinguish with the traditional BN.Then we make use of themethod of themulti-strategy to create similarity table(ST)for each concept-node in OBN.Finally we use the iterative process ofmapping reasoning to deduce new mappings from the similarities of ST,repeatedly.

    1 Related Works

    At present,there are a great many of approaches for ontology mapping.For example,Jean-Mary and Kabuka[8]provided an algorithm of ontology mapping ASMOV,which useed lexical information,external information,internal information,and individual information.Tang et al.[9]proposed the ontology mapping model of risk m inim ization based ontology mapping(RiMOM)whose risk function was created by the Multi-strategy,such as name-based strategy,instance-based strategy,and description-based strategy.Asooja and Gracia[10]provided an ontology mapping system called monolingual and cross-lingual ontology matching(CIDERCL),and it computed sim ilarities for concept-pairs by comparing their context including linguistic description,axioms,related terms,etc.Kuo and Wu[11]proposed a Multistrategy ontology mapping system open data group ontology matching system(ODGOMS),in which the string-based and token-based strategies were exploited to create the mappings. Fang et al.[12]provided a mapping method for biomedical ontologies based onmultiple sim ilarity methods.Other classical systems for ontology mapping,such as GLUE[1],Cupid[3],combination of schema matching approaches(COMA)and Rahm[13],S-Match[14],and CIQ[15],also adopted the multistrategy method to createmappings for concepts.

    In addition,some researches on applying BN to ontologies mapping have been done.The most typically method is provided by M itra et al.[6].It introduced BN into ontology mapping and proposed ontology mapping enhancer(OMEN),which is a framework to probabilistically improve existing ontology mappings.In OMEN,the mapped concept-pairs are converted into nodes,and the edges of BN are formed by the relationships among concepts.Finally,“Meta-rules”proposed by OMEN are used to reason other new mappings.

    In recent years,the researches on ontology mapping have attached much attention,and many methods are provided. Zhang et al.[16]proposed a method called fuzzy ontoloyy mapping based on conceptual graph(FOM-CG)based on conceptual graph,which could be used to create mappings for multiple fuzzy ontologies.Lü[17]combined syntactic sim ilarity with structural similarity to create mappings in an ontology integration process.Tatsiopoulos and Boutsinas[18]translated ontologies to be mapped into association rule bases,and reasoned mapping relationships between them.Tun et al.[19]provided an enrichment-based ontology matching technique (EOM),which improved information for concepts based on philosophical notions,i.e.,identity,rigidity,and dependency.

    2 Translating from Ontology to BN

    In this section,we will propose the set of transformation rules,which isused to translate ontology to BN.Before presenting the set of transformation rules,we will briefly introduce themodels of ontology and BN.

    2.1 Themodels of ontology and BN

    Ontology provides a formal and explicit measure todescription domain know ledge,and it plays an important role in information integration and know ledgemanagement.According to Studer et al.[20],ontology is a formal,explicit specification of a shared conceptualization.Conceptualization refers to an abstractmodel of some phenomenon in the world by identifying the relevant concept of that phenomenon.Explicit means that the types of concepts used and the constraints on their use are explicitly defined.Formal refers to the fact that the ontology should bemachine readable(which excludes for instance natural language).Shared reflects the notion that an ontology captures consensual know ledge,that is,it is not private to some individual,but accepted as a group.

    Definition 1(Ontology)The formal definition of Ontology is O={C,HC,R,I,A},where

    1)C denotes a set of concepts,which are collections of instances(objects)of the domain,representing the basic meanings in the world;

    2)HCdenotes a set of taxonomy relations which represent inheritance relationships among concepts,such as“is-subclassof”and“is-supclass-of relations”;

    3)R denotes a set of non-taxonomy relations(i.e.,predicate relationships)among concepts;

    4)I denotes a set of instances belonging to a given concept;

    5)A denotes a set of axioms,formally expressing conditions to be verified by the elements of the ontology in order to guarantee its correctness,and allow ing to infer new know ledge which is not explicitly represented in the ontology.

    BN proposed in Ref.[21],also called probabilistic inference network or belief network,is a graphical probability model for representing the probabilistic relationships among a large number of random variables and probabilistic inference with them.BN is composed of a set of nodes and edges.The nodes,or vertices,represent the variables and the edges,or arcs,represent the conditional dependencies among the nodes. Generally speaking,BN is considered as a directed acyclic graph(DAG)thatallows for efficientand effective inference of probability distributions over a set of random variables.Besides the power of probabilistic reasoning provided by BN itself,we are also attracted to BN by the structural similarity between the DAG of a BN and the RDF graph of OWL ontology:both of them are directed graphs,and direct correspondence exists betweenmany nodes and edges in the two graphs.

    Definition 2(BN)The formal definition of BN is BN={G,θ},where:

    1)G is a directed acyclic graph whose vertices correspond to the random variables X1,X2,…,Xn,and whose edges represent direct dependencies between the variables;

    2)θrepresents the set of conditional probability tables (CPTs),each of which specifies the probability of each possible state of the node given each possible combination of states of its parents.

    2.2 The set of transformation rules

    The process of translating ontology into BN is realized by a translation function(φ).According to the quintuple O={C,HC,R,I,A}which is the formal definition of ontology,the BN translated byφisφ(O)={G=<N,E>,P,I,A,θST},where G is a DAG composed by the set of nodes N and the set of edges E,P and I respectively denote the property set and the instance set of nodes,A represents a set of axioms and θSTdenotes the set of STs which will be fully introduced in the next section.The translated BN is called OBN,because it has many characteristics inherited by ontology.The specific transformation rules are as follows.

    1)N=φ(C),i.e.,C,the setof concepts in ontology,is mapped into N,the set of concept-nodes in OBN,and the mapping relationships between concepts and concept-nodes are one-to-one.

    2)E=φ(HC),i.e.,HC,the set of hyponymy relationships among concepts in ontology,ismapped into E,the set of edges in OBN.

    3)P=φ(R),i.e.,R,the set of non-taxonomy relationships among concepts in ontology,ismapped into P,the set of properties in OBN.

    4)I=φ(I),i.e.,I,the set of instances for concepts in ontology,is mapped into I,the set of instances for conceptnodes in OBN.

    5)A=φ(A),i.e.,A,the set of axioms in ontology is mapped into A,the set of axioms in OBN.

    6)OBN=φ(O),i.e.,amodel of ontology O ismapped into amodel of OBN.

    All transformation rules for structure are given by abovementioned rules.In order to label nodes and edges of OBN with probabilities,some important rules for computing probabilities will be provided as follows.

    7)P(n)=φ(I(n)),where n∈N denotes a concept-node in OBN,and I(n)denotes the number of instances for n.The functionφ(I(n)),whose result is a ratio of the number of instances of n to the number of all instances,can be used to acquire prior probabilities of concept-nodes.

    8)P(B|A)=φ(B,A),where concept-node B is the child-node of concept-node A,andφ(B,A)is used to compute the conditional probability labeling the edge between A and B. For the conditional probability P(B|A),we can fallback on the formula of conditional probability that is P(B|A)=P(AB)/ P(A).In this formula,it is necessary to get two probabilities which are the prior probability P(A)and the joint probability P(AB).P(A)can be gotby the Rule7)easily,but P(AB)is unknown for us.However,the relationship of semantic inclusion between A and B,that is B?A or A∩B=B,makes it easily to get the equation P(AB)=P(B).So,the improved formula is as follows:

    For example,based on the above-mentioned transformation rules,a fragment of an ontology which represents the relationships between teachers and courses in some college can be transformed into a fragment of OBN.The result is shown in Fig.1,in which nodes and edges represent concepts and relationships,respectively.

    Fig.1 Themodel of OBN from a fragment of OWL document

    We have reason to believe that the proposed transformation rules are complete.To explain it,letus review the relationships between the transformation rules and the formal definition of ontology O={C,R,HC,A,I}.It is easy to find that the five elements in ontology can be mapped into the correspondingelements in OBN using the first five rules,and the mapping relationships are composed by C→N,HC→E,R→P,I→I,and A→A.To sum up,the translation does not cause information loss.

    3 Method of OM-BN

    In OM-BN,the process of ontology mapping is broken down into threemain steps shown in Fig.2.The first step is the translation from ontology to OBN(shown in section 2.2).The second step is to create ST for each concept-node in OBN.The last step is using the iterative process of mapping reasoning in which new mappings are repeatedly deduced from STs.

    Fig.2 The process of ontology mapping

    3.1 Creating sim ilarity tables for all conceptnodes

    For the sake of understanding,we divide this process into three sub-steps,i.e.,how to quickly create all correct conceptnode-pairs between two OBNs,how to compute similarities of concept-node-pairs by the multi-strategy,and how to generate STs to store the similarities.

    Fig.3 All the concept-node-pairs between OBN1and OBN2

    1)How to quickly create all correct concept-node-pairs between two OBNs

    Before computing sim ilarities,we should create all the correct concept-node-pairs,in which two concept-nodes do not come from the same OBN.As shown in Fig.3,concept-nodes of A1and B1belong to OBN1,and OBN2includes three concept-nodeswhich are A2,B2,and C2.It is easy tomanually create all the correct concept-node-pairs between OBN1and OBN2.The results obtained by human effort are(A1,A2),(A1,B2),(A1,C2),(B1,A2),(B1,B2),and(B1,C2).When OBN1and OBN2contain a great number of conceptnodes,in otherwords,m and n are very large,it is difficult for us to manually traverse the two OBNs and find all the correct concept-node-pairs.However,the tree structure of OBNs,i.e.,concept-nodes in OBNs are arranged by levels and no cycle will appear in OBNs,makes it easily for us to find all conceptnode-pairs by using many classic traversal algorithms such as depth-first traversal and breadth-first traversal.

    2)How to compute sim ilarities of concept-node-pairs by themulti-strategy

    In recent years,many ontology mapping systems are based on multi-strategies.Each strategy can only deal with a type of information effectively,and thus it is necessary to combine many different types of strategies to maxim ize sim ilarity accuracy.But using too many strategies will bring out some problems,e.g.,large calculation of similarities and hardship of similarity combination.Hence,the best way is to choose the most appropriate strategies,and avoid using the inefficient strategies.Since the semantics of concept-node is represented by the elementsof name,description,and instance,we can use the follow ing three strategies to get precise similarity of conceptnode-pair.

    (1)Name based strategy

    Names composed by character strings are human identifiers for concept-nodes,normally shared by a community of humans speaking a common language.Several ideas have already been created to compare names.Levenshtein Distance[22],which is the number of edit operations necessary to transform one string to another one,is a measure of the sim ilarity between two names.The follow ing is the Formula(2)based on name strategy:

    where the symbols of|x|and|y|respectively denote the length of strings x and y,and ed(x,y)indicates the number of edit operations,including deletions,insertions,and substitutions,required to transform x to y.

    (2)Description based strategy

    Description,which is expressed by natural language,is also one kind of expressive information of concept-nodes. Usually,it representsmore semantics of the concept-node than name itself.We use text classification method to compute similarity of the description between concept-nodes.More specifically,we use word frequencies in concept-node descriptions of the target OBN and construct a Naive Bayesian classifier[23].Then we exploit words in concept-node descriptions of the source OBN for prediction which is equivalent to the similarity.

    (3)Instance based strategy

    Instance based strategy has the advantage of focusing on the most active parts of the OBNs,and reflects concept-node-pair semantics as they are actually being used.The idea of this strategy is that similarity between the instances of two conceptnode-pairs predicts the semantic similarity of these conceptnode-pairs.The similarity between two concept-nodes can be computed by Jaccard coefficient[1]:

    In this formula,the symbolsof x and y denote two conceptnodes,and P(x,y)is the probability that a random ly chosen instance from the universe belongs to both x and y.The denominator of the Formula(3)is the probability that a random ly chosen instance from the universe belongs to either x or y.

    (4)Combination

    There are two combination approaches which are hybrid and composite[13].The hybrid approach ismost common where differentmatch criteria or properties(e.g.,name and data type)are used within a single algorithm.By contrast,a composite approach combines the results of several independently executed match algorithms.In order to use the results provided by the multi-strategies,we should adopt composite.The follow ing is the Formula(4)which combines the results generated by the three strategies with the corresponding weights:

    In this formula,the weights ofλName,λComment,andλInstanceare acquired by many ways,such as neural network,machine learning,and so on,and the relationship of these weights is λName+λComment+λInstance=1.

    3)How to generate STs to store the similarities

    A new data structure named by ST is introduced to store the similarities acquired by the multi-strategy.Among multiple OBNs,we should firstly consider themost important one as the source OBN,and the remainder ones are all target OBNs.To avoid redundancy computing of similarity,only concept-nodes in the source OBN are allowed to have STs.The ST of each concept-node in the source OBN saves all the similarities between the concept-node itself and other concept-nodes in other target OBNs.The process of obtaining STs consists of two major phases:one is to acquire a similarity list(SL);the other is to generate STs of concept-nodes by decomposing the SL.

    (1)Acquiring SL

    The SL will be used to save similarities between the concept-nodes in the source OBN and the concept-nodes in the target OBNs.Therefore,we label rows of SL by concept-nodes of the source OBN(A,B,C,…),and the columns are labelled by concept-nodes of target OBNs(A1,B1,C1,…,A2,B2,C2,…).Each cell in SL can be used to record the similarity of corresponding concept-node-pair.

    (2)Generating STs from SL

    From the SL,we find that rows in the SL are denoted by the corresponding concept-nodes in the source OBN.Therefore,by decomposing the SL by rows,we can generate all the STs of concept-nodes.For example,Table 1 shows the ST of conceptnode A,which contains the similarities between A and all the concept-nodes of the target OBNs.

    To sum up,we canmake the bestuse of the characteristics and the internal information of ontology,and create STs for all the concept-nodes in the source OBN.During the process of mapping reasoning,these data are used to deduce mapping relationships between concept-nodes.

    Table 1 The ST of concept-node A in source OBN

    3.2 The iterative process ofm apping reasoning

    Themeaning ofmapping reasoning is that creatingmapping relationship for the concept-node-pair whose sim ilarity exceeds some threshold.However,themapping reasoning process is not one step but iterative,because some new mappings created by the previous reasoning step will be used to deduce other mappings in the next reasoning step.We will introduce the iterative process of mapping reasoning with an example.The information of source OBN is shown in Fig.4,and Fig.5 shows amapping from A to A',according to the similarity Sim(A,A') which ismore than a given threshold.The final result is shown in Fig.6.

    Fig.4 STs in the source of OBN

    Fig.5 Creating mapping between A and A'

    Fig.6 The final result of the iterative process ofmapping-reasoning

    1)We will retrieve records in the STs,and find outall the concept-node-pairswhose sim ilarities are equal or greater than the given thresholdδ(0.9).According to different needs,the given thresholdδcan be modified.Then push these conceptnode-pairs into the MappingQueue storing the found conceptnode-pairs temporarily.From the STs of nodes shown in Fig.4,we find the sim ilarity Sim(A,A')is 0.95,which is greater thanδ,and the concept-node-pair(A,A')is pushed into the MappingQueue.

    2)Pop a concept-node-pair from the MappingQueue,e.g.,(A,A').Then we create the mapping relationship of Mapping(A,A')and add themapping to the MappedSetwhich restores the created mappings by reasoning.If the MappingQueue is empty,that is to say we can not get any mapping,and then we terminate the iterative process of mapping-reasoning,and return to users the finalmappings of the MappedSet.

    3)Creating two adjacent-node sets,i.e.,Set_Nodes and Set_Nodes',for the two concept-nodes in a concept-node-pair (A,A').Then the concept-nodes in Set_Nodes(resp.,Set_Nodes')are classified into three subsets.For example,concept-nodes A and A'are contained in the concept-node-pair (A,A').According to the set of edges E(resp.,E')and the set of properties P(resp.,P'),we can divide Set_Nodes (resp.,Set_Nodes')into three subsets:Set_Parent{P}(Set_ Parent'{P'})is the setof parent-nodes for A(resp.,A'),Set _Children{C1,C2,…,Cm}(resp.,Set_Children'...,C'n})the set of children-nodes,and Set_Predicate{Q1,Q2,…,Qx}(resp.,Set_Predicate'{Q'1,Q'2,…,Q'y})the set of predicate-nodes.

    4)Using the follow ing threemethods to update STs,as the concept-nodes are classified into the three subsets,i.e.,Set_ Parent,Set_Children and Set_Predicate.

    (1)A parent-concept-node in Set_Parent:the tree structure of OBN makes each concept-node except the root-node has only one parent-node.Since,only one parent-concept-node is contained in the set Set_Parent.For example,concept-node P is included in the set Set_Parent of A.Next,we can find the sim ilarity Sim(P,P')in the ST of P and use Formula(5)to update Sim(P,P').

    (2)Some children-concept-nodes in Set_Children:a concept-node in OBNmay havemore than one children-conceptnode,and thus we need toupdate each ST of children-conceptnode in Set_Children.For example,children-concept-nodes of C1,C2,…,Cmis included in the Set_Children of A,then we will update the sim ilarity Sim(Ci,C'j)in the ST of conceptnode Ci,where 1≤i≤m,1≤j≤n,and themethod of getting the parameters of Sim(Ci,C'j),is similar to Formula(1).

    (3)Some predicate-concept-nodes in Set_Predicate:In the set Set_Predicate of a concept-node,there may be multiple predicate-concept-nodes.Therefore the process of updating STs for the predicate-concept-nodes in Set_Predicate is similar to the process described by Formula(2).But no probability exists,which is used to label the predicate-relationship of two conceptnodes.Shown in Fig.5,Qiis one of predicate-concept-nodes of A.We will find that the label between A and Qiis not a similarity but a predicate.When we update Sim(Qi,Q'j)where concept-nodes of Qiand Q'jare the predicate-concept-nodes for themapped concept-nodes of A and A',we need to consider the similarity between two predicates as influence factor.

    5)Return the firststep and start the next reasoning.During the process aforementioned,the final result is shown in Fig.6. The vertical dashed frames denote the two sets of predicateconcept-nodes,and the horizontal dashed frames represent the two sets of children-concept-nodes.The dotted arrows denote the mapping relationship deduced by the iterative process of mapping-reasoning.

    4 Experim ental Results

    To evaluate our method OM-BN,we use the set of ontologies(benchmark)provided by the OAEI(Ontology Alignment Evaluation Initiative),which is designed to test the strength and weakness of ontologymappingmethods.In this test set,more than two hundred ontologies are designed.Among them,ontology#101 is considered as the reference ontology,as other ontologies are derived from#101 by modifying its some information,such as names,properties,instances,and so on. In the process of experiment,what we are going to do is to create mappings between#101 and other ontologies by our method OM-BN,respectively.Then,the three parameters,i.e.,precision,recall,and F-Measure are calculated,which are the standard information retrievalmetrics.The definitions of them is shown as follows,where C is the number of correct mappings found by themethod to be tested,F(xiàn) is the number of mappings found by the method,and E is the number of mappings found by ontology experts.

    The experimental result for OM-BN is shown in Table 2. We find that the precision,recall and F-Measure are 100%,when OM-BN creates mappings between reference ontology #101 and source ontologies#103 and#104.The reason is that the differences among them are very slight.For instance,the content of#103 and#104 are respectively changed by generalization and restriction of language,compared with #101.In addition,OM-BN has the general performance,when dealing with source ontologies#262,#265,and#266. That is because that the names,comments,and relations in these source ontologies are changed by different conventions,as well as the inexistence of instances and properties. Therefore,OM-BN can only work according to the structural sim ilarity of ontology.The precision,recall and F-Measure are relative low,at around 70%.As for other source ontologies in benchmark,the three parameters are up to 90%.In general,OM-BN performs well,when it is tested by the data in benchmark.

    To compare OM-BN with other mapping methods,we evaluate the follow ing methods by precision,recall and FMeasure,each of which is a classic method for ontology mapping,and the experimental results are shown in Fig.7.

    Table 2 The results of the benchmark data set

    Fig.7 The contrast test formapping methods

    5 Conclusions

    In this paper,we focus on how to apply BN to ontology mapping,and propose a new method named OM-BN.In OMBN,we first use the characteristics of ontology,i.e.,tree structure and semantic inclusion relation among concepts,and translate ontology into OBN which is simpler than traditional BN.Then we make use of the method of the multi-strategy,which computes sim ilarity more exactly,and create ST for each concept-node in OBN.Finally we use the iterative process of mapping-reasoning to deduce new mappings from the sim ilarities of ST,repeatedly.The iterative process of mapping-reasoning reduces the number of multi-strategies by using the extensional information of ontology,such as structure information and nontaxonomy information in ontology,and thus the sim ilarity calculation ofmulti-strategy is decreased.To sum up,OM-BN is an effective approach for ontology mapping.

    [1]Doan A,Madhavan J,Dom ingos P,et al.Learning to Map between Ontologies on the Semantic Web[C].Proceedings of the Eleventh InternationalWorld WideWeb Conference,Hawaii,USA,2002.

    [2]Doan A,Madhavan J,Dom ingos P,et al.Learning to Match the Schemas of Data Sources:a Multi-strategy Approach[J]. Machine Learning,2003,50(3):279-301.

    [3]Madhavan J,Bernstein P,Rahm E.Generic Schema Matching with Cupid[C].Proceedings of the International Conference on Very Large Databases,Roma,Italy,2001.

    [4]Ding Z L,Peng Y,Pan R.A Bayesian Approach to Uncertainty Modeling in OWL Ontology[C].Proceedings of 2004 International Conference on Advances in Intelligent Systems-Theory and Applications,Luxemburg,2004.

    [5]Ding Z L,Peng Y.A Probabilistic Extension to Ontology Language OWL[C].Proceedings of the 37th Hawaii International Conference on System Sciences,Hawaii,USA,2004.

    [6]M itra P,Noy N F,Jaiswal A R.OMEN:A Probabilistic Ontology Mapping Tool[C].Proceedings International Semantic Web Conference,Banff,Britain,2005.

    [7]Pan R,Ding Z L,Yu Y,etal.A Bayesian Network Approach to Ontology Mapping[C].Proceedings International Semantic Web Conference,Galway,Ireland,2005.

    [8]Jean-Mary Y,Kabuka M.ASMOV Results for OAEI2007[C]. Proceedings of International Semantic Web Conference 2007 Ontology Matching Workshop,Busan,Korea,2007.

    [9]Tang J,Li JZ,Liang B Y,et al.Using Bayesian Decision for Ontology Mapping[J].Journal ofWeb Semantics,2006,4(4): 243-262.

    [10]Asooja K,Gracia J.Monolingual and Cross-Lingual Ontology Matching with CIDER-CL:Evaluation Report for OAEI 2013[C].Proceedings of International Semantic Web Conference,Sydney,Australia,2013.

    [11]Kuo IH,Wu T T.ODGOMS–Results for OAEI 2013[C]. Proceedings of International Semantic Web Conference,Sydney,Australia,2013.

    [12]Fang A,Hong N,Wu S Z,et al.An Integrated Biomedical Ontology Mapping Strategy Based on Multiple Mapping Methods[C].Proceedings of Web Information Systems Engineering-W ISE 2013 Workshops,Berlin Heidelberg,2014.

    [13]Do H,Rahm E.Coma:A System for Flexible Combination of Schema Matching Approaches[C].Proceedings of the 28th International Conference on Very Large Data Bases(VLDB),Hong Kong,China,2002.

    [14]Giunchiglia F,Shvaiko P,Yatskevich M.S-Match:an Algorithm and Implementation of Semantic Matching[C].Proceedings of the European Semantic Web Symposium,Crete,Greece,2004.

    [15]Zhang Z W,Xu D Z,Zhang T.Ontology mapping based on conditional information quantity[C].Proceedings of International Conference on Networking,Sensing and Control,Sanya,China,2008.

    [16]Zhang L Y,Yan L,Ma Z M.A Conceptual Graph Based Approach for Mappings among Multiple Fuzzy Ontologies[J]. Journal ofWeb Engineering,2013,12(3/4):215-231.

    [17]LüY.An Approach to Ontologies Integration[C].Proceedings of International Conference on Fuzzy Systems and Know ledge Discovery(FSKD),Shanghai,China,2011.

    [18]Tatsiopoulos C,Boutsinas B.Ontology Mapping Based on Association Rule M ining[C].Proceedings of 11th International Conference on Enterprise Information Systems,M ilan,Italy,2009.

    [19]Tun N N,Dong J S,Tojo S.A Philosophy-Driven Entity Classification and Enrichment for Ontology Mapping[J].Expert Systems,2011,28(2):138-166.

    [20]Studer R,Benjam ins V R,F(xiàn)ensel D.Know ledge Engineering: Principles and Methods[J].Data and Know ledge Engineering,1998,25(122):161-197.

    [21]Jensen F V.Bayesian Networks and Decision Graphs[M].New York,USA:Springer,2001.

    [22]Levenshtein V.Binary Codes Capable of Correcting Deletions,Insertions and Reversals[J].Soviet Physics Doklady,1966,10 (8):707-710.

    [23]M itchell T M.Machine Learning[M].New York,USA: McGraw-Hill,1997:154-199.

    TG335.58

    A

    1672-5220(2015)04-0681-07

    date:2014-04-20

    s:National Natural Science Foundation of China(No.61204127);Natural Science Foundations of Heilongjiang Province,China (Nos.F2015024,F(xiàn)201334);Young Foundation of Qiqihar University,China(No.2014k-M 08)

    *Correspondence should be addressed to ZHANG Ling-yu,E-mail:zhanglingyu00217@126.com

    熟女av电影| 国产精品久久久久久精品电影| 在线 av 中文字幕| 日本爱情动作片www.在线观看| 国精品久久久久久国模美| 一级毛片电影观看| 七月丁香在线播放| 亚洲av福利一区| 亚洲av中文av极速乱| 国产有黄有色有爽视频| 91久久精品电影网| 国内精品美女久久久久久| 在线观看一区二区三区激情| 国产日韩欧美在线精品| av在线老鸭窝| 男人狂女人下面高潮的视频| 男人狂女人下面高潮的视频| 亚洲精品中文字幕在线视频 | 国产爽快片一区二区三区| 午夜精品国产一区二区电影 | 亚洲在久久综合| 免费大片黄手机在线观看| 免费观看在线日韩| 国产精品秋霞免费鲁丝片| 在线精品无人区一区二区三 | 欧美日韩在线观看h| 亚洲av国产av综合av卡| 国产精品国产三级专区第一集| 国内精品美女久久久久久| 2018国产大陆天天弄谢| 又粗又硬又长又爽又黄的视频| 又粗又硬又长又爽又黄的视频| 草草在线视频免费看| 国产精品国产三级国产av玫瑰| 美女国产视频在线观看| 国产成年人精品一区二区| 一级毛片电影观看| 久久99热6这里只有精品| 午夜免费男女啪啪视频观看| 国产午夜精品久久久久久一区二区三区| 国产国拍精品亚洲av在线观看| 性色avwww在线观看| 内地一区二区视频在线| 欧美三级亚洲精品| 国产男女内射视频| 色视频www国产| 99久久精品一区二区三区| 国产一区二区三区综合在线观看 | 伦精品一区二区三区| kizo精华| 看十八女毛片水多多多| 99视频精品全部免费 在线| 美女脱内裤让男人舔精品视频| 亚洲色图av天堂| 一级毛片黄色毛片免费观看视频| 国产午夜福利久久久久久| 欧美三级亚洲精品| 欧美亚洲 丝袜 人妻 在线| 亚洲自拍偷在线| 久久久久久久久大av| 国产男人的电影天堂91| 亚洲国产欧美人成| 亚洲aⅴ乱码一区二区在线播放| 97热精品久久久久久| 青春草国产在线视频| 97在线人人人人妻| 欧美+日韩+精品| 亚洲第一区二区三区不卡| 亚洲天堂av无毛| 国产黄a三级三级三级人| 欧美成人一区二区免费高清观看| 99久久精品国产国产毛片| 亚洲精品456在线播放app| 人妻 亚洲 视频| 天堂中文最新版在线下载 | 国产精品爽爽va在线观看网站| 欧美zozozo另类| 2021少妇久久久久久久久久久| 建设人人有责人人尽责人人享有的 | 亚洲欧美精品专区久久| 高清av免费在线| 亚洲婷婷狠狠爱综合网| 国产中年淑女户外野战色| tube8黄色片| 日本黄大片高清| 国产成年人精品一区二区| 亚洲精品日本国产第一区| 免费人成在线观看视频色| 午夜福利高清视频| 在线观看美女被高潮喷水网站| 青春草国产在线视频| 特级一级黄色大片| 亚洲伊人久久精品综合| 国产人妻一区二区三区在| 日韩欧美一区视频在线观看 | 成年版毛片免费区| 一本色道久久久久久精品综合| videossex国产| tube8黄色片| 日韩欧美 国产精品| 男女国产视频网站| 中文字幕亚洲精品专区| 你懂的网址亚洲精品在线观看| 国产精品一及| 五月天丁香电影| 日韩视频在线欧美| 日本与韩国留学比较| 日韩成人av中文字幕在线观看| 久热久热在线精品观看| 人体艺术视频欧美日本| 色哟哟·www| 在线免费观看不下载黄p国产| 亚洲人成网站在线观看播放| 亚洲av成人精品一二三区| 一区二区三区免费毛片| 夜夜爽夜夜爽视频| 亚洲激情五月婷婷啪啪| 久久精品久久精品一区二区三区| 欧美高清性xxxxhd video| 色网站视频免费| 国产精品人妻久久久影院| 男人爽女人下面视频在线观看| 午夜精品一区二区三区免费看| 国内精品美女久久久久久| 亚洲国产欧美人成| 欧美3d第一页| 国产熟女欧美一区二区| 亚洲精品国产成人久久av| 热re99久久精品国产66热6| 国产毛片a区久久久久| 亚洲国产精品专区欧美| 最近的中文字幕免费完整| 波多野结衣巨乳人妻| 夜夜看夜夜爽夜夜摸| 精品人妻偷拍中文字幕| 80岁老熟妇乱子伦牲交| 久久久久久久久久成人| 亚洲成人av在线免费| 纵有疾风起免费观看全集完整版| 亚洲欧美一区二区三区黑人 | 国产成人精品婷婷| 一区二区三区四区激情视频| 欧美zozozo另类| 好男人在线观看高清免费视频| 久久久久久久国产电影| 91狼人影院| 汤姆久久久久久久影院中文字幕| 成年女人看的毛片在线观看| 日本三级黄在线观看| 欧美日本视频| 欧美日韩综合久久久久久| 只有这里有精品99| av国产精品久久久久影院| a级毛色黄片| 国产精品国产av在线观看| 天堂中文最新版在线下载 | 欧美日韩视频精品一区| 噜噜噜噜噜久久久久久91| 91精品伊人久久大香线蕉| 久久久久精品性色| 中文字幕免费在线视频6| 男人添女人高潮全过程视频| 人人妻人人看人人澡| 99视频精品全部免费 在线| 国产 一区精品| 五月玫瑰六月丁香| 欧美日韩国产mv在线观看视频 | 99热这里只有精品一区| 日日摸夜夜添夜夜添av毛片| 亚洲精品日韩在线中文字幕| 少妇的逼好多水| 国产成人a∨麻豆精品| 久久久久性生活片| 午夜精品一区二区三区免费看| 国产欧美亚洲国产| 97人妻精品一区二区三区麻豆| 国产成人福利小说| 少妇人妻精品综合一区二区| 亚洲av中文字字幕乱码综合| 久久久久精品久久久久真实原创| 卡戴珊不雅视频在线播放| 男人狂女人下面高潮的视频| 欧美精品人与动牲交sv欧美| 欧美日韩国产mv在线观看视频 | 日韩欧美 国产精品| 少妇裸体淫交视频免费看高清| 内地一区二区视频在线| 亚洲真实伦在线观看| 一个人观看的视频www高清免费观看| 国产色爽女视频免费观看| 亚洲一区二区三区欧美精品 | 亚洲国产高清在线一区二区三| 又粗又硬又长又爽又黄的视频| 一级黄片播放器| 国产白丝娇喘喷水9色精品| 国产男女内射视频| 国产日韩欧美亚洲二区| av国产免费在线观看| 禁无遮挡网站| 黄色一级大片看看| 99九九线精品视频在线观看视频| 国产高清三级在线| eeuss影院久久| 一本一本综合久久| 国产黄片美女视频| 国产精品精品国产色婷婷| 中文字幕人妻熟人妻熟丝袜美| 亚洲av欧美aⅴ国产| 69av精品久久久久久| 夜夜爽夜夜爽视频| 精品久久久久久电影网| 久久精品久久久久久久性| 色网站视频免费| 亚洲av电影在线观看一区二区三区 | 在线看a的网站| 亚洲精品久久午夜乱码| 成人午夜精彩视频在线观看| 免费不卡的大黄色大毛片视频在线观看| 久久久久精品性色| 日本免费在线观看一区| 深爱激情五月婷婷| 又黄又爽又刺激的免费视频.| 亚洲精品视频女| 久久韩国三级中文字幕| av在线亚洲专区| 亚洲一级一片aⅴ在线观看| 女人被狂操c到高潮| 免费观看在线日韩| 亚洲婷婷狠狠爱综合网| 亚洲精品一二三| 久久久久久久久大av| 天堂俺去俺来也www色官网| 亚洲国产高清在线一区二区三| 亚洲最大成人av| 老女人水多毛片| 精品人妻视频免费看| 一本一本综合久久| 亚洲色图av天堂| 狂野欧美激情性xxxx在线观看| 成人亚洲精品av一区二区| 男的添女的下面高潮视频| 亚洲精品影视一区二区三区av| 成年女人在线观看亚洲视频 | 亚洲在线观看片| 97人妻精品一区二区三区麻豆| 国产亚洲精品久久久com| 国产探花极品一区二区| 97在线视频观看| 亚洲国产精品国产精品| 少妇丰满av| 久久精品夜色国产| 国产精品一区二区性色av| 卡戴珊不雅视频在线播放| 国产成人午夜福利电影在线观看| 各种免费的搞黄视频| 久久精品久久久久久久性| 在线精品无人区一区二区三 | 国产v大片淫在线免费观看| 中文字幕免费在线视频6| h日本视频在线播放| 亚洲怡红院男人天堂| 欧美日韩国产mv在线观看视频 | 国产视频内射| 久久精品国产亚洲av涩爱| 搡女人真爽免费视频火全软件| 性色avwww在线观看| 免费少妇av软件| 国产有黄有色有爽视频| 噜噜噜噜噜久久久久久91| 婷婷色av中文字幕| 免费av观看视频| 交换朋友夫妻互换小说| 日本猛色少妇xxxxx猛交久久| 丝袜美腿在线中文| 精品99又大又爽又粗少妇毛片| 欧美变态另类bdsm刘玥| 亚洲真实伦在线观看| 久久人人爽av亚洲精品天堂 | 午夜精品国产一区二区电影 | 久久精品久久久久久噜噜老黄| 嫩草影院新地址| 久久99热6这里只有精品| 免费看光身美女| 3wmmmm亚洲av在线观看| 亚洲国产精品成人综合色| 肉色欧美久久久久久久蜜桃 | 尾随美女入室| 丰满乱子伦码专区| 可以在线观看毛片的网站| 国产精品秋霞免费鲁丝片| 啦啦啦啦在线视频资源| 亚洲av中文av极速乱| 好男人在线观看高清免费视频| 黄色配什么色好看| 免费观看性生交大片5| 成人午夜精彩视频在线观看| 男女边吃奶边做爰视频| 美女被艹到高潮喷水动态| 少妇人妻久久综合中文| 国产久久久一区二区三区| 日本与韩国留学比较| 国产黄色视频一区二区在线观看| 免费观看av网站的网址| 能在线免费看毛片的网站| 精品酒店卫生间| 视频中文字幕在线观看| 内射极品少妇av片p| 久久久精品欧美日韩精品| 亚洲三级黄色毛片| 少妇的逼好多水| 国产色爽女视频免费观看| 一区二区av电影网| av线在线观看网站| 99热国产这里只有精品6| 亚洲成人一二三区av| 国产黄色免费在线视频| 久久精品国产亚洲网站| 日产精品乱码卡一卡2卡三| 亚洲成人久久爱视频| 人人妻人人澡人人爽人人夜夜| 免费av毛片视频| 99热全是精品| 国产白丝娇喘喷水9色精品| 日韩中字成人| 国产亚洲91精品色在线| 久久精品夜色国产| 国产色婷婷99| 亚洲欧美精品自产自拍| 狂野欧美激情性xxxx在线观看| 国产亚洲一区二区精品| av天堂中文字幕网| 麻豆国产97在线/欧美| 香蕉精品网在线| 亚洲电影在线观看av| 亚洲最大成人av| 亚洲国产精品国产精品| 日韩av在线免费看完整版不卡| 久久综合国产亚洲精品| 丝袜喷水一区| 欧美亚洲 丝袜 人妻 在线| 国产免费视频播放在线视频| 日韩电影二区| 国产男人的电影天堂91| 成人一区二区视频在线观看| 国产黄a三级三级三级人| 午夜精品一区二区三区免费看| 精品久久久久久电影网| 老师上课跳d突然被开到最大视频| 欧美bdsm另类| 别揉我奶头 嗯啊视频| 少妇人妻 视频| 中文字幕制服av| 97人妻精品一区二区三区麻豆| 亚洲欧美日韩另类电影网站 | 中文欧美无线码| 三级国产精品片| 婷婷色麻豆天堂久久| 最近的中文字幕免费完整| 国产乱人视频| 韩国av在线不卡| 22中文网久久字幕| av国产久精品久网站免费入址| 美女被艹到高潮喷水动态| 草草在线视频免费看| 超碰97精品在线观看| 亚洲自拍偷在线| 又爽又黄无遮挡网站| 国产黄频视频在线观看| 国产v大片淫在线免费观看| 97人妻精品一区二区三区麻豆| 麻豆乱淫一区二区| 亚洲欧美日韩无卡精品| 亚洲人成网站在线播| 成人国产麻豆网| 欧美成人午夜免费资源| 成人国产av品久久久| 看非洲黑人一级黄片| 美女视频免费永久观看网站| 视频区图区小说| 国产久久久一区二区三区| 国产精品秋霞免费鲁丝片| 99久久人妻综合| 99热网站在线观看| 国产免费又黄又爽又色| 麻豆国产97在线/欧美| a级一级毛片免费在线观看| 久久精品综合一区二区三区| 人妻一区二区av| 观看美女的网站| 亚洲欧美日韩东京热| 丝袜美腿在线中文| 在线天堂最新版资源| 国产亚洲av嫩草精品影院| 国产成人精品久久久久久| 亚洲四区av| 日韩欧美 国产精品| 狂野欧美白嫩少妇大欣赏| 日产精品乱码卡一卡2卡三| 日本黄色片子视频| 男女下面进入的视频免费午夜| 91精品国产九色| 日韩精品有码人妻一区| 国产色爽女视频免费观看| 在线观看三级黄色| 亚洲av中文字字幕乱码综合| 欧美性猛交╳xxx乱大交人| 亚洲国产精品999| 少妇裸体淫交视频免费看高清| 色5月婷婷丁香| 国产黄片视频在线免费观看| 看十八女毛片水多多多| 免费观看的影片在线观看| 免费观看av网站的网址| 狂野欧美激情性bbbbbb| 深夜a级毛片| 中文字幕制服av| 久久综合国产亚洲精品| 九草在线视频观看| 亚洲国产最新在线播放| 交换朋友夫妻互换小说| 国产亚洲一区二区精品| 视频区图区小说| videos熟女内射| 欧美精品国产亚洲| 熟女av电影| 国产高清有码在线观看视频| 九九在线视频观看精品| 水蜜桃什么品种好| 成人黄色视频免费在线看| 欧美成人午夜免费资源| 五月玫瑰六月丁香| 97超碰精品成人国产| 观看美女的网站| 国产黄片美女视频| 五月天丁香电影| 亚洲av中文av极速乱| 婷婷色av中文字幕| 久久久久久伊人网av| 欧美成人精品欧美一级黄| 久久99蜜桃精品久久| 国产美女午夜福利| 成年女人看的毛片在线观看| 国精品久久久久久国模美| 精品视频人人做人人爽| 免费av毛片视频| 18禁动态无遮挡网站| 91午夜精品亚洲一区二区三区| 丝袜美腿在线中文| 日日摸夜夜添夜夜添av毛片| 欧美国产精品一级二级三级 | 超碰av人人做人人爽久久| 午夜免费观看性视频| 在线观看三级黄色| 乱码一卡2卡4卡精品| 日韩不卡一区二区三区视频在线| 丰满乱子伦码专区| 中国美白少妇内射xxxbb| 69av精品久久久久久| 高清午夜精品一区二区三区| 乱系列少妇在线播放| 只有这里有精品99| 久久精品国产a三级三级三级| 日日撸夜夜添| 小蜜桃在线观看免费完整版高清| 一级二级三级毛片免费看| 成人免费观看视频高清| 国产老妇伦熟女老妇高清| av在线观看视频网站免费| 极品教师在线视频| 各种免费的搞黄视频| 赤兔流量卡办理| av国产精品久久久久影院| 99视频精品全部免费 在线| 国产 精品1| 成人黄色视频免费在线看| 高清在线视频一区二区三区| 久久久久久国产a免费观看| 特级一级黄色大片| 久久久久九九精品影院| 国产精品国产三级专区第一集| 嘟嘟电影网在线观看| 国产精品一及| 18+在线观看网站| 丝袜美腿在线中文| 1000部很黄的大片| 一级av片app| 久久国产乱子免费精品| 嘟嘟电影网在线观看| 欧美日韩在线观看h| 成人二区视频| 3wmmmm亚洲av在线观看| 国产69精品久久久久777片| 午夜福利在线在线| 熟女人妻精品中文字幕| 精品人妻偷拍中文字幕| 下体分泌物呈黄色| 三级国产精品欧美在线观看| 国产亚洲精品久久久com| 天堂中文最新版在线下载 | 亚洲av在线观看美女高潮| 最新中文字幕久久久久| 久久久久久久国产电影| 久久久久精品久久久久真实原创| 国产69精品久久久久777片| 国产午夜精品久久久久久一区二区三区| 国产精品久久久久久精品电影小说 | 日韩电影二区| 日本猛色少妇xxxxx猛交久久| 国产一区有黄有色的免费视频| 99久久精品热视频| 国产乱人偷精品视频| 免费电影在线观看免费观看| 国产精品麻豆人妻色哟哟久久| 国产大屁股一区二区在线视频| 国产精品麻豆人妻色哟哟久久| 免费不卡的大黄色大毛片视频在线观看| 别揉我奶头 嗯啊视频| 99热国产这里只有精品6| 亚洲国产成人一精品久久久| 26uuu在线亚洲综合色| 亚洲精品国产av蜜桃| 国产精品秋霞免费鲁丝片| 国产色爽女视频免费观看| 色哟哟·www| 18+在线观看网站| 18禁在线播放成人免费| 久久亚洲国产成人精品v| 最近中文字幕高清免费大全6| 国产伦理片在线播放av一区| 亚洲aⅴ乱码一区二区在线播放| 精品酒店卫生间| 午夜福利视频1000在线观看| 欧美xxⅹ黑人| 丝袜脚勾引网站| 国产亚洲5aaaaa淫片| 国产v大片淫在线免费观看| 一区二区av电影网| 一级爰片在线观看| 精品久久久久久久久av| 亚洲在线观看片| 成人特级av手机在线观看| 亚洲国产精品999| 免费观看无遮挡的男女| 人人妻人人澡人人爽人人夜夜| 欧美成人a在线观看| 美女脱内裤让男人舔精品视频| 精品久久久久久久末码| 黄色配什么色好看| av卡一久久| 欧美日韩综合久久久久久| 久久国内精品自在自线图片| 国产免费一级a男人的天堂| 简卡轻食公司| 日韩人妻高清精品专区| 青春草国产在线视频| 亚洲熟女精品中文字幕| 欧美极品一区二区三区四区| 精品国产三级普通话版| 久久精品国产鲁丝片午夜精品| 少妇被粗大猛烈的视频| 久久精品国产a三级三级三级| 少妇人妻 视频| 日本一本二区三区精品| 大片电影免费在线观看免费| 欧美变态另类bdsm刘玥| 国产综合精华液| 亚洲色图av天堂| 2021少妇久久久久久久久久久| 国产精品一区二区性色av| 麻豆乱淫一区二区| 少妇被粗大猛烈的视频| 乱码一卡2卡4卡精品| 国产成人福利小说| 国产精品不卡视频一区二区| 国精品久久久久久国模美| 最近中文字幕2019免费版| 国产淫片久久久久久久久| 国产黄色免费在线视频| 欧美成人精品欧美一级黄| 久久久久久伊人网av| 一级毛片aaaaaa免费看小| 美女xxoo啪啪120秒动态图| 九色成人免费人妻av| 成人综合一区亚洲| 国产亚洲最大av| 日韩国内少妇激情av| 毛片一级片免费看久久久久| 国内精品美女久久久久久| 国产黄色视频一区二区在线观看| 国内少妇人妻偷人精品xxx网站| 午夜激情福利司机影院| 亚洲精品,欧美精品| 特大巨黑吊av在线直播| av国产免费在线观看| 在线亚洲精品国产二区图片欧美 | av又黄又爽大尺度在线免费看| 国产 一区 欧美 日韩| 一级a做视频免费观看| 91狼人影院| 亚洲婷婷狠狠爱综合网| 亚洲精品自拍成人| 国产69精品久久久久777片| 成人国产麻豆网| 男人添女人高潮全过程视频| 欧美性感艳星| 亚洲色图av天堂| 久久久久网色| 亚洲天堂av无毛| 亚洲av成人精品一区久久| a级毛片免费高清观看在线播放| 高清视频免费观看一区二区| 能在线免费看毛片的网站| 亚洲精品视频女| 国产爽快片一区二区三区| xxx大片免费视频|