Font Size: a A A

An Approach For Semantic Web Service Matching And Composition Based On Domain Ontology

Posted on:2012-10-08Degree:MasterType:Thesis
Country:ChinaCandidate:Y T JiaoFull Text:PDF
GTID:2218330368988667Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
With the development of telecommunications service, electronic commerce, office automation and enterprise calculations, the web service technology was generated. Web service composition is the main research contents to fulfill the complex request of customers or applications. The emergency of semantic web technology is to make computers understand the data in web and automatically realize web service composition. Based on web service technology and semantic web technology, we mainly study an approach for semantic web services matching and composition.Firstly, the existing computing methods about semantic distance between concepts in ontology are summarized and a new computing method is provided based on domain ontology. Meanwhile, a definition for semantic similarity between concepts is designed based on this semantic distance. Mapping web service properties into concepts in ontology, based on concepts semantic distance, I study the semantic matching rules between web services and give a computing method about web services semantic similarities.Then, a method for semantic matching between web services is designed with clustering technology based on web services semantic similarities. Used a tree-likely form to denote the web services and their semantic similarities, the sequence, choice, concurrency and cyclic structures are all provided and web service automating composition is realized and the optimal web services composition is composed. According to the setting service requesting threshold value, the consistency between the composed web service and service request.Lastly, the accuracy, completeness and time efficiency of the algorithm for web services matching is simulated with OWLS-TC2.2 services testing collection, and on the basis of realized algorithm, the success rate and composed efficiency of web services composition is tested to use this collection. The experimental result states that the Web Service Matching Algorithm has higher precision, completeness and time efficiency. The Web Service Composition Algorithm has higher composed success rate at the premise of changeless combined efficiency.
Keywords/Search Tags:domain ontology, semantic distance, semantic similarity, web services, semantic matching, clustering, services composition
PDF Full Text Request
Related items