earticle

논문검색

Semantic Web Service Discovery Algorithm based on Constraint Extraction and Structure Analysis

초록

영어

As the Internet Web services increased, how to find a web service which can meet user's requirements quickly and accurately has become a problem to be solved .Now many kinds of web service methods based on semantic are based IO matching .They used other ways to supplement while semantic matching is failed. However the accuracy of semantic web service discovery based on IO matching purely is not high enough, the Algorithm of semantic web service discovery which is based on constraint extraction and structure analysis is proposed. It is divided into two parts. First part is to carry out the concept of semantic matching based on constraint extraction .Then it uses algorithm based on structure analysis while matching is failed, aiming to assess the structural similarity of the desired vs the retrieved services and the semantic similarity of their identifiers. This article uses owls-tc2.0 as test set to test this method .The experimental results show that this method improves service discovery accuracy effectively.

목차

Abstract
 1. Instruction
 2. Related Research
 3. Semantic Web Service Discovery Algorithm Based on Constraint Extraction and Structuretructure Analysis 
  3.1. Semantic Matching of Web Services
  3.2. The Concept Semantic Constraints of Web Service
  3.3. Structural Analysis of Web Services
  3.4. Algorithm Description
 4. Experimental Result and Analysis
 5. Conclusion
 References

저자정보

  • Kun Li College of Computer and Communication Engineering China University of Petroleum, UPC, Qingdao, China
  • Huayu Li College of Computer and Communication Engineering China University of Petroleum, UPC, Qingdao, China
  • Jidong Chen College of Computer and Communication Engineering China University of Petroleum, UPC, Qingdao, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.