The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
With the number of registered Web services growing, Identifying desired Web service is crucial for Web users. Current keyword based service search are inefficient in two main aspects: poor scalability and lack of semantics. Firstly ,the users are overwhelmed by the huge number of irrelevant services returned. Secondly
The proliferation of Web services demands for a discovery mechanism to find advertisements that satisfy the requests more accurately. OWL-S provides a capability-based description and logic inference mechanism for semantically matching. UDDI provides a registry of businesses and Web services, but its keyword search
called the Associated Keyword Space(ASKS) which is effective for noisy data and projected clustering result from a three-dimensional (3D) sphere to a two dimensional(2D) spherical surface for 2D visualization. One main issue, which affects to the performance of ASKS algorithm is creating the affinity matrix. We use semantic
as the first factor, then QoS properties being considered as secondary factors. Our approach considers QoS profit values to compute the QoS similarity. In this paper, we apply a spatial clustering technique called the Spherical Associated Keyword Space which is projected clustering result from a three-dimensional sphere
keyword, ontology and information-retrieval-based methods. Problems with these approaches include a shortage of high quality ontologies and a loss of semantic information. In addition, there has been little fine-grained improvement in existing approaches to service clustering. In this paper, we present a new approach to
With an ever-increasing number of Web services being available, finding desired Web service is crucial for service users. Current keyword search and most existing approaches are inefficient in two main aspects: poor scalability and lack of semantics. Firstly, users are overwhelmed by the huge number of irrelevant
as the services management. Existing methods for Web services clustering mostly focus on utilizing directly key features from WSDL documents, e.g., input/output parameters and keywords from description text. Probabilistic topic model Latent Dirichlet Allocation (LDA) is also adopted, which extracts latent topic features
analyzer to pick up information of service and use keywords to find out related services; then we cluster Web services according to the similarity of services; last, we select the appropriate Web service from list of services.
user's request, the user has to construct the request using the keywords that best describe the user's objective and match correctly with the Web Service name or location. Clustering Web services based on function similarities would greatly boost the ability of Web services search engines to retrieve the most relevant Web
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.