WEB SERVICE DISCOVERY BASED ON COMPUTION OF SEMANTIC SIMILARITY DISTANCE AND QOS NORMALIZATION
Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 2
Abstract
Service discovery is an important activity in services computing paradigm. Omnipresent of internet and proliferation of web services paves unrestricted opportunity to many service providers to create, locate and access the business services. Recommending a pertinent web service to the client requirement is a complex process as numerous functionally similar web services are readily available to meet the demand. Furthermore, the traditional search method doesn’t support the client’s non functional requirements. To alleviate the difficulty, a web service search engine has been introduced. In this paper, the score value calculated from aggregated with the functional computation and non functional computations. For a user request, the list of matched candidate services will be provided. The degree of similarity that can be obtained from Google and the test result shows with high precision and recall than the traditional methods.
Authors and Affiliations
Jeberson Retna Raj , Dr. T. Sasipraba
Keywords
Related Articles
- EP ID EP114218
- DOI -
- Views 121
- Downloads 0
INVESTIGATIONS INTO EFFECTIVENESS OF GAUSSIAN AND NEAREST MEAN CLASSIFIERS FOR SPAM DETECTION
This paper presents the results of investigations into the effectiveness of Gaussian and Nearest Mean Classifiers for SPAM detection. The results are in the form of traces of probability of error and time taken for class...
STUDY OF SDN USING MININET
The traditional architecture of networks has long supported the needs of the data centers. However, with the today’s heavy data usage by users, the need for a shift to virtualizing functions and applying a more modern ap...
AN OPTICAL NEURAL NETWORK MODEL FOR MINING FREQUENT ITEMSETS IN LARGE DATABASES
This paper proposes a model for mining frequent patterns in large databases by implementing Optical Neural Networks. The whole database is scanned only once and stored as a matrix. The frequent patterns are then mined fr...
A VECTOR SPACE MODEL FOR INFORMATION RETRIEVAL: A MATLAB APPROACH
By and large, three classic framework models have been used in the process of retrieving information: Boolean, Vector Space and Probabilistic. Boolean model is a light weight model which matches the query with precise se...