WEB SERVICE CLASSIFICATION WITH MULTILAYER PERCEPTRON
Journal Title: Indian Journal of Computer Science and Engineering - Year 2016, Vol 7, Issue 3
Abstract
Web services are made of software components for expressing the application information, communicating messages and for interacting with open XML and Internet technologies. Web services are software applications accessible on the web, used for machine to machine interaction using Uniform Resource Identifier (URI) on distributed internet environment.With the explosion of Web Services accessible on the web, automatic categorization of the services to organize the data becomes essential. In this paper we use 3 different classifiers for web service classification. Multilayer perceptron is trained with back propagation and genetic algorithm.
Authors and Affiliations
A. Syed Mustafa , Dr. Y. S. Kumaraswamy
Keywords
Related Articles
- EP ID EP164708
- DOI -
- Views 120
- Downloads 0
Comparison and Analysis of RREQ and RREP for Dynamic Wireless Network
This paper compares and analyzes RREQ and RREP for wireless networks using Zigbee technology for transferring data between dynamically moving nodes. The system is simulated on Ptolemy 2 Visual Sense simulating tool, usin...
Computer Profiling Based Model for Investigation
Computer profiling is used for computer forensic analysis, and proposes and elaborates on a novel model for use in computer profiling, the computer profiling object model. The computer profiling object model is an inform...
SUPER STRONGLY PERFECT NESS OF SOME INTERCONNECTION NETWORKS
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have analyzed the structure of super st...
DETERMINING THE NUMBER OF CLUSTERS FOR A K-MEANS CLUSTERING ALGORTIHM
Clustering is a process used to divide data into a number of groups. All data points have some mathematical parameter according to which grouping can be done. For instance, if we have a number of points on a twodimension...
AN EFFICIENT TEXT CLUSTERING ALGORITHM USING AFFINITY PROPAGATION
The objective is to find among all partitions of the data set, best publishing according to some quality measure. Affinity propagation is a low error, high speed, flexible, and remarkably simple clustering algorithm that...