In order to improve the effectiveness of semantic web service discovery, the semantic bias between an interface parameter and an annotation is reduced by extracting semantic restrictions for the annotation from the de...In order to improve the effectiveness of semantic web service discovery, the semantic bias between an interface parameter and an annotation is reduced by extracting semantic restrictions for the annotation from the description context and generating refined semantic annotations, and then the semantics of the web service is refined. These restrictions are dynamically extracted from the parsing tree of the description text, with the guide of the restriction template extracted from the ontology definition. New semantic annotations are then generated by combining the original concept with the restrictions and represented via refined concept expressions. In addition, a novel semantic similarity measure for refined concept expressions is proposed for semantic web service discovery. Experimental results show that the matchmaker based on this method can improve the average precision of discovery and exhibit low computational complexity. Reducing the semantic bias by utilizing restriction information of annotations can refine the semantics of the web service and improve the discovery effectiveness.展开更多
In order to improve the efficiency and quality of service composition,a service composition algorithm based on semantic constraint is proposed.First, a user’s requirements and services from a service repository are c...In order to improve the efficiency and quality of service composition,a service composition algorithm based on semantic constraint is proposed.First, a user’s requirements and services from a service repository are compared with the help of a matching algorithm.The algorithm has two levels and filters out the services which do not match the user’s constraint personality requirements.The mechanism can reduce the searching scope at the beginning of the service composition algorithm.Secondly,satisfactions of those selected services for the user’s personality requirements are computed and those services,which have the greatest satisfaction value to make up the service composition,are used.The algorithm is evaluated analytically and experimentally based on the efficiency of service composition and satisfaction for the user’s personality requirements.展开更多
基金The National Basic Research Program of China (973Program)(No.2005CB321802)Program for New Century Excellent Talents in University (No. NCET-06-0926)the National Natural Science Foundation of China (No.60403050,90612009)
文摘In order to improve the effectiveness of semantic web service discovery, the semantic bias between an interface parameter and an annotation is reduced by extracting semantic restrictions for the annotation from the description context and generating refined semantic annotations, and then the semantics of the web service is refined. These restrictions are dynamically extracted from the parsing tree of the description text, with the guide of the restriction template extracted from the ontology definition. New semantic annotations are then generated by combining the original concept with the restrictions and represented via refined concept expressions. In addition, a novel semantic similarity measure for refined concept expressions is proposed for semantic web service discovery. Experimental results show that the matchmaker based on this method can improve the average precision of discovery and exhibit low computational complexity. Reducing the semantic bias by utilizing restriction information of annotations can refine the semantics of the web service and improve the discovery effectiveness.
基金The National Natural Science Foundation of China(No.60673130)the Natural Science Foundation of Shandong Province(No.Y2006G29,Y2007G24,Y2007G38)
文摘In order to improve the efficiency and quality of service composition,a service composition algorithm based on semantic constraint is proposed.First, a user’s requirements and services from a service repository are compared with the help of a matching algorithm.The algorithm has two levels and filters out the services which do not match the user’s constraint personality requirements.The mechanism can reduce the searching scope at the beginning of the service composition algorithm.Secondly,satisfactions of those selected services for the user’s personality requirements are computed and those services,which have the greatest satisfaction value to make up the service composition,are used.The algorithm is evaluated analytically and experimentally based on the efficiency of service composition and satisfaction for the user’s personality requirements.