Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Management / 管理學院
  3. Information Management / 資訊管理學系
  4. Approximate Matching and Ranking of Web Services Using Ontologies and Rules
 
  • Details

Approximate Matching and Ranking of Web Services Using Ontologies and Rules

Date Issued
2007
Date
2007
Author(s)
Hsieh, Chung-Hao
DOI
en-US
URI
http://ntur.lib.ntu.edu.tw//handle/246246/54301
Abstract
Web Service technology, which is a software framework supporting interoperable machine-to-machine interaction over the Internet, has transformed the Web from a static collection of information into a dynamic service repository. As the number of available Web services continues to grow, service matching becomes an increasingly important issue. Matching is the process that requires a service repository to take a requirement as input, and return all the advertisements that satisfy the requirements specified in the input query. However, since users' requirements may vary from person to person, it is unrealistic to expect that a matching scheme will always find services that match requirements perfectly. When exact matches cannot be achieved, an approximate matching scheme, which gives satisfying and ranked results, will be needed. In this thesis, we integrate previous approaches that can deal with "quantitative relations" and allow users to specify "matching accuracy settings". We then extend them with an approach to model "concept composition". Concept composition could be useful when we want to compose two concepts linked by a certain property. Since there is no such constructor in Description Logic, we use individuals to represent concepts which are leaf nodes of the ontology. Then, we use a role to represent the composition relationship. In our scheme, domain knowledge is stored in the knowledge base in the form of ontologies and rules. We model service descriptions as concept expressions. Therefore, service matching problems can be transformed into concept subsumption checking, which is a basic reasoning service supported by reasoners. To approximate users' requirements, we try to relax the constraints of requirements by substituting these constraints with more general ones. Furthermore, we rank these results according to our ranking scheme, which can provide a relative priority for users to select services that best fit their needs. To validate our approach, we implement a prototype system - the Matchmaker, which focuses on the tourism domain. This system is fully integrated with the Traveller, which is a prototype system of the service composition framework that demonstrates the process from service description acquisition, service matching to service execution. With our matching system, users are able to specify their concern toward certain domain specific constraints by matching accuracy settings and acquire substitute services that approximately fit their needs.
Subjects
網路服務
近似媒合
描述邏輯
知識本體
知識本體語言
規則
語意網
語意網法則語言
Web Services
Approximate Matching
Description Logic
Ontology
OWL
Rules
Semantic Web
SWRL
Type
other
File(s)
Loading...
Thumbnail Image
Name

ntu-96-R94725047-1.pdf

Size

23.31 KB

Format

Adobe PDF

Checksum

(MD5):ee4ea49f22979f6a000d1b6a9acfbca5

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science