【摘要】：隨著近些年來網(wǎng)絡上Web服務數(shù)量的爆發(fā)增長,如何從海量的服務里匹配到最佳的服務從而達到Web服務復用和Web服務組合的目的,成為了業(yè)界研究的熱點。傳統(tǒng)的解決方案因為缺乏語義層面的匹配機制,其結果無論是從查全率還是查準率來說都比較不理想,另一方面,部分研究在語義網(wǎng)技術的推動下使用Web服務的語義描述來提高機器的理解能力,但是依然存在部分Web服務因為沒有相關語義描述從而造成無法查找的情況。搜索日志是大量的查詢點擊行為產生的數(shù)據(jù),意味著查詢串與目標串之間的潛在語義聯(lián)系可以通過文本處理等手段進行挖掘,本文嘗試借助搜索日志來解決上述問題。具體包括:通過CRF算法和相關統(tǒng)計手段對搜索日志進行新詞挖掘得到新詞詞典,然后對查詢串進行新詞識別實現(xiàn)查詢串的預處理;提出基于搜索日志的新詞語義相似度計算算法來建立新詞之間的語義距離評價標準,從而實現(xiàn)服務查詢的語義擴展;提出一種Web服務形式化描述模型的構建算法,對Web服務進行建模從而能夠和處理過的查詢串進行匹配來完成整個流程的最后一步。其中,新詞能夠被用來對查詢串進行查詢優(yōu)化和語義擴展,從而使得加入了語義層面的匹配算法相比于傳統(tǒng)服務匹配,匹配質量也有了顯著提高。另一方面,對不同的Web服務類型分別進行相應的處理,得到了服務的形式化描述模型,對匹配系統(tǒng)而言屏蔽了Web服務類型的差異,為后續(xù)服務查詢匹配提供了方便。最后本文設計并實現(xiàn)了基于新詞發(fā)現(xiàn)的服務匹配算法,該算法在傳統(tǒng)算法的基礎上完成了基于語義的服務匹配,同時也改善了服務匹配的質量和效果。
[Abstract]:With the increase of the number of Web services on the network in recent years, how to match the best services from a large number of services to achieve the purpose of Web service reuse and Web service composition has become a hot topic in the industry. Because of the lack of semantic matching mechanism in traditional solutions, the results are not ideal in terms of recall or recall, on the other hand, Part of the research uses the semantic description of Web services to improve the understanding ability of the machine, but there are still some Web services because there is no related semantic description to make it impossible to find. Search log is a large amount of data generated by query click behavior, which means that the potential semantic relationship between query string and target string can be mined through text processing. This paper attempts to solve the above problem by means of search log. The details include: using CRF algorithm and related statistical means to mine the new words in search log to obtain the neologism dictionary, and then to realize the preprocessing of the query string by the new word recognition of the query string; A semantic similarity calculation algorithm based on search log is proposed to establish the semantic distance evaluation standard between new words, so as to realize the semantic extension of service query, and a formal description model of Web services construction algorithm is proposed. The Web service is modeled to match the processed query string to complete the final step of the process. Among them, neologisms can be used for query optimization and semantic extension of query strings, so the matching quality of the matching algorithm with semantic level is significantly improved compared with traditional service matching. On the other hand, the different types of Web services are dealt with respectively, and the formal description model of the services is obtained, which shields the differences of the types of Web services for the matching system, and provides convenience for the subsequent service query matching. Finally, this paper designs and implements a service matching algorithm based on neologism discovery, which completes the service matching based on semantics based on the traditional algorithm, and also improves the quality and effect of service matching.
【學位授予單位】：北京郵電大學
【學位級別】：碩士
【學位授予年份】：2016
【分類號】：TP391.1;TP393.09

【參考文獻】

相關期刊論文 前6條

1 孫海霞;錢慶;成穎;;基于本體的語義相似度計算方法研究綜述[J];現(xiàn)代圖書情報技術;2010年01期

2 趙文峰;陳俊亮;;一種基于簡單語義的分布式Web Service查找方法[J];計算機科學;2008年02期

3 余淼;楊丹;趙俊芹;;垂直搜索引擎的關鍵技術研究[J];軟件導刊;2007年23期

4 劉傳昌;陳俊亮;;目標Web服務描述本體和服務發(fā)現(xiàn)模型[J];計算機工程;2007年18期

5 許斌;;基于領域的Web服務查找方法[J];計算機工程;2006年20期

6 岳昆,王曉玲,周傲英;Web服務核心支撐技術:研究綜述[J];軟件學報;2004年03期

相關碩士學位論文 前2條

1 傅偉;基于語義的Web服務發(fā)現(xiàn)的研究與實現(xiàn)[D];北京郵電大學;2015年

2 王志強;基于條件隨機域的中文命名實體識別研究[D];南京理工大學;2006年

，

本文編號：2135532