Abstract
The match probability of automatic grid service composition is improved by Low Match Degree Service Composition Method (LMDSCM) based on semantic illation, similarity degree and graph search. With the concept aggregate similarity degree based on domain ontology defined, it is used to the calculating of service composition match degree and building of service composition graph. The optimization of service composition is transformed to shortest path problem. Finally, comparison between efficiency and satisfaction shows that LMDSCM has higher satisfaction degree than other method and is easy to produce best service composition project.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
