Web Service Discovery Algorithm Research Articles

Case-based Matching Algorithm for Dynamic Web Service Discovery

Case-based Matching Algorithm for Dynamic Web Service Discovery

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.

A bio-inspired, incremental clustering algorithm for semantics-based web service discovery

Web service discovery is a challenging task due to the widespread availability of published services on the web. In this paper, a service crawler-based web service discovery framework is proposed, that employs information retrieval techniques to effectively retrieve available, published service descriptions. Their functional semantics is extracted for similarity computation and tag generation using natural language processing techniques. The framework is inherently dynamic in nature as new service descriptions may be continually added during periodic crawler runs or existing ones may be removed if service is unavailable. To deal with these issues, a dynamic, incremental clustering approach based on bird flocking behaviour is proposed. Experimental results show that semantic analysis and automatic tagging captured the services' functional semantics in a meaningful way. The algorithm effectively handled the dynamic requirements of the proposed framework by eliminating cluster recomputation overhead and achieved a speed-up factor of 61.8% when compared to hierarchical clustering.

A provenance-based approach to semantic web service description and discovery

Web services have become common, if not essential, in the areas of business-to-business integration, distributed computing, and enterprise application integration. Yet the XML-based standards for web service descriptions encode only a syntactic representation of the service input and output. The actual meaning of these terms, their formal definitions, and their relationships to other concepts are not represented. This poses challenges for leveraging web services in the development of software capabilities. As the number of services grows and the specificity of users' needs increases, the ability to find an appropriate service for a specific application is strained. In order to overcome this challenge, semantic web services were proposed. For the discovery of web services, semantic web services use ontologies to find matches between user requirements and service capabilities. The computational reasoning afforded by ontologies enables users to find categorizations that weren't explicitly defined. However, there are a number of methodological variants on semantic web service discovery. Based on e-Science, an analog to e-Business, one methodology advocates deep and detailed semantic description of a web service's inputs and outputs. Yet, this methodology predates recent advances in semantic web and provenance research, and it is unclear the extent to which it applies outside of e-Science. We explore this question through a within-subjects experiment and we extend this methodology with current research in provenance, semantic web, and web service standards, developing and empirically evaluating an integrated approach to web service description and discovery. Implications for more advanced web service discovery algorithms and user interfaces are also presented.

The Extended Algorithm of the Bipartite Graph Matching Semantic Web Service Discovery

In previous work, the ontology-based algorithm of bipartite graph matching semantic web service discovery was presented. But in these algorithms, the problem of finding augment path was not resolved very well. It will affect the recall rate and precision rate of web service discovery. In order to resolve these problems, this paper proposes an ontology-based bipartite graph matching semantic web service discovery algorithm, which extends the optimal bipartite graph matching algorithm. It uses the slack function to find the augment path in the equivalent sub graph. The algorithm also contributes to the improvement of the recall rate and precision rate of the service discovery.

A Service Publishing and Service Location Algorithm for Internet of Things

The designation idea and the hierarchy model for the WSDS based on double hierarchy topology have been described. In order to support QoS-based Web services publish and discovery, the QoS broker mechanism is introduced into the traditional Web service discovery model. On the basis of these, according to the characteristics of QoS requirements of different users, a QoS-based Web service discovery algorithm is proposed. Put forward dynamic tuple model, give two-phase service location algorithm adapting double hierarchy topology network, and then compare and test with the correlative work of UDDI. Hierarchy model is introduced to defining dynamic tuple model in the data-level for resolving the heterogeneity between diversified data source and data modal. The unified publish and query API customized to implement unified accessing mode in the abstract level. The scalability, agility and robustness of the WSDS are assured by a double hierarchy topology structure. The experiment result indicate, double hierarchy topology system has obvious self-organization and well scalability, and adopt to the independence of web service, dynamic change and strong distributing, at one time, two-phase service location algorithm has well abilities of service location.

Research on Web Information Retrieval based on Vector Space Model

Existing methods and technologies for Web services discovery mainly consist of two models: service matching based on grammar and based on semantics. With keywords service matching method, we introduce text information retrieval technology with vectors and concept lattice theory. Then a web service discovery algorithm using eigenvectors is put forward. It orders the Web services by correlation among the services in Web service subset. The services which have bigger correlation will get anterior places. According to this algorithm a Web service discovery system based on eigenvectors is designed. We give description to key modules of the system. At last the improved algorithm is compared to methods based on full-text retrieval and pure similarity retrieval. The results show it has better performance in accuracy and response.

A New Matchmaking Algorithm Based on Multi-Level Matching Mechanism Combined with Fuzzy Set

The lack of semantic parts, increasing the number of Web services in the Web, and syntactic-based search operation are the main problems of current Web service technologies, these factors make difficult for clients to find a required web service. This paper shows a matchmaking algorithm to discover Semantic Web Services that are satisfying client requirements. It depends on two factors that distinguish it from any conventional Web service discovery algorithm; the first one is using semantic matching technique to overcome shortcoming of keyword matching techniques, the second one is tying Quality of Service (QoS) metrics of Web Service (WS) with fuzzy words that are used in user’s request. At least fifty percent average gain in search relevancy is obtained when our matchmaking algorithm is applied to WSs that are actually matching the chosen fuzzy semantic theme.

A New Web Service Discovery Algorithm Based on Similarity Degree

To discover requested web services in Internet, this paper proposes a new web service discovery algorithm based on ontology. It uses tree-form data structure to describe the web services and give all the nodes a weight value by certain strategy, then compute the semantic similarity between the web services requested and the services registered. To validate the feasibility and effectiveness of the algorithm, the paper constructs a self-developed prototype system to show how well it works. The experiments prove that this algorithm has high recall rate and precision than other methods.

The framework of a geospatial semantic web-based spatial decision support system for Digital Earth

While significant progress has been made to implement the Digital Earth vision, current implementation only makes it easy to integrate and share spatial data from distributed sources and has limited capabilities to integrate data and models for simulating social and physical processes. To achieve effectiveness of decision-making using Digital Earth for understanding the Earth and its systems, new infrastructures that provide capabilities of computational simulation are needed. This paper proposed a framework of geospatial semantic web-based interoperable spatial decision support systems (SDSSs) to expand capabilities of the currently implemented infrastructure of Digital Earth. Main technologies applied in the framework such as heterogeneous ontology integration, ontology-based catalog service, and web service composition were introduced. We proposed a partition-refinement algorithm for ontology matching and integration, and an algorithm for web service discovery and composition. The proposed interoperable SDSS enables decision-makers to reuse and integrate geospatial data and geoprocessing resources from heterogeneous sources across the Internet. Based on the proposed framework, a prototype to assist in protective boundary delimitation for Lunan Stone Forest conservation was implemented to demonstrate how ontology-based web services and the services-oriented architecture can contribute to the development of interoperable SDSSs in support of Digital Earth for decision-making.

Research on Web Service-Based Image Processing for Mobile Commerce

The resource limitation of mobile commerce systems cause the problem that the existing image processing software based on the centralized computing mode had difficulty in running in mobile commerce systems. This paper gives a solution for the problem by adopting web service-based image processing approach. The solution reduces the resource consumption of mobile commerce systems by distributing image processing tasks to service providers, service registry centers and service requesters. Furthermore, a web service discovery algorithm called WBSD is presented. Service providers adopt the WBSD to provide efficient services and increase image processing speed. Compared with traditional methods of image processing, Web service-based image processing method has the advantages of loose coupling and component oriented and can take full advantage of the computing resources in heterogeneous network. Thus web service-based image processing approach can effectively solve the resource bottle-neck that traditional image processing software had.

Research on Web service discovery technology based on semantic

Web service description and discovery technologies were researched.Then OWL-S was extended and a Web service discovery algorithm was proposed because the presently available service discovery mechanism has weaker quality of service description,less service classification,narrower match scope and lower efficiency.Web services were described using tree structure,different weights to nodes were given according to certain strategy and services were stored by classification.Web services requests were pretreated and oriented services classifications were located firstly,then the Web services were matched by using certain semantic similarity calculation method based on WordNet or HowNet and using assistant technology.The experiments prove that this algorithm has higher precision and recall than others.

Effective Web Service Composition in Diverse and Large-Scale Service Networks

The main research focus of Web services is to achieve the interoperability between distributed and heterogeneous applications. Therefore, flexible composition of Web services to fulfill the given challenging requirements is one of the most important objectives in this research field. However, until now, service composition has been largely an error-prone and tedious process. Furthermore, as the number of available web services increases, finding the right Web services to satisfy the given goal becomes intractable. In this paper, toward these issues, we propose an AI planning-based framework that enables the automatic composition of Web services, and explore the following issues. First, we formulate the Web-service composition problem in terms of AI planning and network optimization problems to investigate its complexity in detail. Second, we analyze publicly available Web service sets using network analysis techniques. Third, we develop a novel Web-service benchmark tool called WSBen. Fourth, we develop a novel AI planning-based heuristic Web-service composition algorithm named WSPR. Finally, we conduct extensive experiments to verify WSPR against state-of-the-art AI planners. It is our hope that both WSPR and WSBen will provide useful insights for researchers to develop Web-service discovery and composition algorithms, and software.

동적 웹 서비스 조합을 위한 시멘틱 웹 서비스 발견 및 실행 기법

최근에 동적으로, 즉 요구가 있는 즉시 서비스들을 조합하는 동적 웹 서비스 조합은 가장 큰 관심사 중 하나이다. 지금까지 동적 웹 서비스조합에 관한 많은 연구들이 수행되어졌는데 주로 사람이 개입된 반자동 대화식 조합 기법들이 제안되었다. 또한 이들 연구에서 탐색 알고리즘 및 워크플로우 설계 기법들이 부분적으로는 기술되어 있으나. 웹 서비스 조합 자동화를 위한 전반적인 워크플로우 처리과정을 기술한 연구는 아직 없다. 본 논문은 웹 서비스 조합 자동화 기법에 초점을 맞추고 있다. 주된 아이디어는 시멘틱 웹을 실현하기 위한 웹 온톨로지와 비즈니스분야에서 성공적으로 활용되고 있는 워크플로우 기법들을 적용하여 웹 서비스 조합 자동화 시스템을 구현하는 것이다. 본 연구에서는 웹 서비스발견을 위해 매칭 알고리즘이 제안되고, 웹 서비스들 간 상호연결을 지원하기 위해 매칭 알고리즘에 온톨로지 개념이 적용된다. 그리고 웹 서비스 조합 자동화를 지원하기 위한 워크플로우 실행계획이 기술된다. 마지막으로 실 데이터 실험을 통해 제안 시스템의 우수성을 보인다. Recently, one of the most challenging problems is to compose web services dynamically, that is, on demand. A number of researchers have been considerably interested in the dynamic web services composition. However, while most of them focused on the semi-automatic web services composition with a human controller, very little attention was devoted to the full automation of this process. This paper primarily focuses on the automatic web services composition techniques. The main idea is to implement an automatic web services composition system using web ontologies to realize the semantic web and workflow technologies to play a major role in E-businesses. In this paper, we propose a matching algorithm for web service discovery and present an approach based on the use of ontologies to facilitate the interoperability of web services. Finally, we describe a workflow execution plan to support the automatic web services composition, and an experimental study that shows the high performance of our system.