One of the most suited techniques for comparing results obtained from computational intelligence algorithms is the statistical hypothesis testing. This method can be used to contrast if the difference between the algorithm with the best results and other algorithms is actually significant. In this paper, we present STAC (Statistical Tests for Algorithms Comparison), a new platform for statistical analysis to verify the results obtained from computational intelligence algorithms. STAC consists of three different layers for performing statistical tests: a Python library, a set of web services and a web client. We show several use cases, in which both non-expert and expert users interact with the web client and use the web services in different programming languages.
11 February 2015 in IEEE Transactions on Services Computing
In this paper we present a theoretical analysis of graph-based service composition in terms of its dependency with service discovery. Driven by this analysis we define a composition framework by means of integration with fine-grained I/O service discovery that enables the generation of a graph-based composition which contains the set of services that are semantically relevant for an input-output request. The proposed framework also includes an optimal composition search algorithm to extract the best composition from the graph minimising the length and the number of services, and different graph optimisations to improve the scalability of the system. A practical implementation used for the empirical analysis is also provided. This analysis proves the scalability and flexibility of our proposal and provides insights on how integrated composition systems can be designed in order to achieve good performance in real scenarios for the web.
Service Oriented Architectures and web service technology are becoming popular in recent years. As more web services can be used over the Internet, the need to find efficient algorithms for web services composition that can deal with large amounts of services becomes important. These algorithms must deal with different issues like performance, semantics or user restrictions. In this paper we present an A* algorithm which solves the problem of semantic input-output message structure matching for web service composition. Given are quest, a service dependency graph with a subset of the original services from an external repository is dynamically generated. Then, the A* search algorithm is used to find a minimal composition that satisfies the user request. Moreover, in order to improve the performance, a set of dynamic optimization techniques has been implemented over the search process. A full experimental validation with eight different public repositories has been done showing a good performance as in all tests as the algorithm finds a valid solution with minimal number of services and execution path.