Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Simulated annealing: theory and applications
Simulated annealing: theory and applications
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
Scheduling problems and traveling salesman: the genetic edge recombination
Proceedings of the third international conference on Genetic algorithms
A simulated annealing algorithm for the clustering problem
Pattern Recognition
Graphics gems II
Computational experience on four algorithms for the hard clustering problem
Pattern Recognition Letters
ACM Computing Surveys (CSUR)
Graphics Gems
A Maximum Variance Cluster Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Distribution-Based Clustering Algorithm for Mining in Large Spatial Databases
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Efficient and Effective Clustering Methods for Spatial Data Mining
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
DASFAA '01 Proceedings of the 7th International Conference on Database Systems for Advanced Applications
Spatial Clustering for Data Mining with Genetic Algorithms
Spatial Clustering for Data Mining with Genetic Algorithms
Bidirectional Hierarchical Clustering for Web Mining
WI '03 Proceedings of the 2003 IEEE/WIC International Conference on Web Intelligence
Voting Multi-Dimensional Data with Deviations for Web Services under Group Testing
ICDCSW '05 Proceedings of the Fourth International Workshop on Assurance in Distributed Systems and Networks (ADSN) (ICDCSW'05) - Volume 01
Adaptive Testing, Oracle Generation, and Test Case Ranking for Web Services
COMPSAC '05 Proceedings of the 29th Annual International Computer Software and Applications Conference - Volume 01
Service research challenges and solutions for the future internet
| Hi-index | 0.00 |
This paper proposes a stochastic voting for testing a large number of Web Services (WS) under group testing. In the future, a large number of WS will be available and they need to be tested and evaluated in real time. While numerous test input generation techniques are available to generate test inputs, the oracle or the expected output of these test input is often difficult to obtain. One way to obtain the oracle in this case is to give the same input to multiple WS and to establish the oracle by a majority voting. This is based on the assumption that faulty WS often will not produce consistent results, and thus if a majority can be reached, the oracle can be established statistically. However, even correct WS may still produce slightly different outputs, and thus the majority-voting scheme must be carefully designed to distinguish correct but slightly variant output from truly incorrect output. This paper proposes a hierarchical classification based on simulated annealing and multi-dimensional Chisquare statistical techniques to analyze data to see if a majority can be reached. The algorithm is evaluated by a comprehensive simulated data as well as actual data. The data show that the proposed algorithm is effective even in a difficult situation where clusters of WS produce clusters of output.