【摘要】：隨著大數(shù)據(jù)時(shí)代的到來(lái)，Web服務(wù)技術(shù)得以進(jìn)一步發(fā)展。穩(wěn)定易用的Web服務(wù)大量涌現(xiàn)，如何將單一的、功能有限的Web服務(wù)組合起來(lái)為用戶提供綜合、滿足個(gè)性化需求的組合服務(wù)成為了當(dāng)前的研究熱點(diǎn)。本文以服務(wù)類(lèi)為對(duì)象，服務(wù)關(guān)系為支撐，通過(guò)挖掘服務(wù)類(lèi)之間的語(yǔ)義關(guān)系來(lái)實(shí)現(xiàn)Web服務(wù)的自動(dòng)服務(wù)組合。 1、研究Web服務(wù)的語(yǔ)義關(guān)系挖掘。定義Web服務(wù)之間的語(yǔ)義關(guān)系，通過(guò)服務(wù)聚類(lèi)完成服務(wù)庫(kù)的服務(wù)類(lèi)劃分。以Web服務(wù)的QoS屬性為篩選標(biāo)準(zhǔn)，通過(guò)原子服務(wù)篩選以及服務(wù)QoS維度偏好的索引建立完成服務(wù)類(lèi)的優(yōu)化。以服務(wù)類(lèi)為基礎(chǔ)，提升服務(wù)關(guān)系挖掘的粒度，提出服務(wù)類(lèi)的語(yǔ)義關(guān)系挖掘算法，，為自動(dòng)服務(wù)組合方法提供語(yǔ)義關(guān)系支持。 2、研究Web服務(wù)的自動(dòng)服務(wù)組合方法。自上而下將服務(wù)組合過(guò)程分為服務(wù)類(lèi)的組合以及服務(wù)的綁定兩個(gè)階段。服務(wù)類(lèi)的組合階段使用規(guī)劃算法完成語(yǔ)義關(guān)系圖的構(gòu)建，將服務(wù)組合映射為最短路徑問(wèn)題來(lái)求解服務(wù)類(lèi)的組合方案。在組合方案的服務(wù)類(lèi)節(jié)點(diǎn)上提出個(gè)性化的服務(wù)選擇方法完成服務(wù)的綁定。 3、研究Web服務(wù)的服務(wù)選擇方法。為滿足用戶的個(gè)性化需求，提出基于偏好推薦和QoS的服務(wù)選擇算法。通過(guò)計(jì)算服務(wù)請(qǐng)求者和歷史評(píng)價(jià)用戶之間的評(píng)價(jià)偏好相似度來(lái)獲取推薦用戶，計(jì)算推薦用戶相應(yīng)候選服務(wù)的服務(wù)推薦度，并結(jié)合服務(wù)請(qǐng)求者的QoS維度偏好計(jì)算候選服務(wù)的綜合效用值，完成個(gè)性化的Web服務(wù)選擇。 通過(guò)實(shí)驗(yàn)方法，分別對(duì)服務(wù)類(lèi)語(yǔ)義關(guān)系挖掘、服務(wù)組合和服務(wù)選擇的算法進(jìn)行驗(yàn)證，結(jié)果分析表明本文設(shè)計(jì)的算法是可行和有效的。研究成果能有效解決服務(wù)網(wǎng)絡(luò)中原子服務(wù)及其相互之間的語(yǔ)義關(guān)系海量增長(zhǎng)的問(wèn)題，并提供個(gè)性化和優(yōu)質(zhì)的組合服務(wù)，進(jìn)一步提高服務(wù)請(qǐng)求的用戶滿意度。
[Abstract]:With the arrival of big data, Web service technology has been further developed. A large number of stable and easy-to-use Web services have emerged. How to combine the single and limited Web services to provide comprehensive services for users to meet the needs of personalized composition has become a hot research topic. This paper takes the service class as the object, the service relation as the support, by mining the semantic relation between the service classes to realize the automatic service composition of the Web service. 1. The semantic relation mining of Web services is studied. The semantic relationship between Web services is defined and the service cluster is used to partition the service class of the service library. With the QoS attribute of Web service as the filter criterion, the optimization of service class is accomplished by atomic service filtering and the index of service QoS dimension preference. Based on the service class, the granularity of the service relationship mining is improved, and the semantic relation mining algorithm of the service class is proposed, which provides the semantic relationship support for the automatic service composition method. 2. The automatic service composition method of Web service is studied. The process of service composition is divided into two stages: service class composition and service binding. In the composition phase of the service class, a programming algorithm is used to complete the construction of the semantic relational graph, and the service composition is mapped to the shortest path problem to solve the composition scheme of the service class. A personalized service selection method is proposed on the service class node of the composition scheme to complete the service binding. 3. The service selection method of Web service is studied. A service selection algorithm based on preference recommendation and QoS is proposed to meet the individual needs of users. By calculating the similarity of evaluation preference between the service requester and the historical evaluation user, the recommended user is obtained, and the service recommendation degree of the corresponding candidate service of the recommended user is calculated. Combined with the QoS dimension preference of the service requester, the comprehensive utility value of candidate service is calculated to complete the personalized Web service selection. The algorithms of service class semantic relation mining, service composition and service selection are verified by the experimental method. The results show that the proposed algorithm is feasible and effective. The research results can effectively solve the problem of massive growth of atomic services and their semantic relationships in service networks, and provide personalized and high-quality composite services to further improve the user satisfaction of service requests.
【學(xué)位授予單位】：上海大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TP393.09;TP391.1

【參考文獻(xiàn)】

相關(guān)期刊論文 前9條

1 孫萍;蔣昌俊;;利用服務(wù)聚類(lèi)優(yōu)化面向過(guò)程模型的語(yǔ)義Web服務(wù)發(fā)現(xiàn)[J];計(jì)算機(jī)學(xué)報(bào);2008年08期

2 胡建強(qiáng);李涓子;廖桂平;;一種基于多維服務(wù)質(zhì)量的局部最優(yōu)服務(wù)選擇模型[J];計(jì)算機(jī)學(xué)報(bào);2010年03期

3 陳彥萍;張建科;孫家澤;鄭慶華;李增智;;一種基于混合智能優(yōu)化的服務(wù)選擇模型[J];計(jì)算機(jī)學(xué)報(bào);2010年11期

4 徐萌;陳俊亮;彭泳;梅翔;;基于服務(wù)關(guān)系本體的服務(wù)生成[J];軟件學(xué)報(bào);2008年03期

5 李研;周明輝;李瑞超;曹東剛;梅宏;;一種考慮QoS數(shù)據(jù)可信性的服務(wù)選擇方法[J];軟件學(xué)報(bào);2008年10期

6 許海玲;吳瀟;李曉東;閻保平;;互聯(lián)網(wǎng)推薦系統(tǒng)比較研究[J];軟件學(xué)報(bào);2009年02期

7 朱銳;王懷民;馮大為;;基于偏好推薦的可信服務(wù)選擇[J];軟件學(xué)報(bào);2011年05期

8 王尚廣;孫其博;楊放春;;基于全局QoS約束分解的Web服務(wù)動(dòng)態(tài)選擇[J];軟件學(xué)報(bào);2011年07期

9 孟祥武;胡勛;王立才;張玉潔;;移動(dòng)推薦系統(tǒng)及其應(yīng)用[J];軟件學(xué)報(bào);2013年01期

相關(guān)博士學(xué)位論文 前1條

1 胡佳;語(yǔ)義Web服務(wù)自動(dòng)組合及驗(yàn)證的研究[D];天津大學(xué);2010年

本文編號(hào)：2401235