Learn More
Current approaches for service discovery are based on semantic knowledge, such as ontologies and service behavior (described as process model). However, these approaches still remain with a high selectivity rate, resulting in a large number of services oering similar functionalities and behavior. One way to improve the selectivity rate and to provide the(More)
—One of the fundamental problems in graph databases is similarity search for graphs of interest. Existing approaches dealing with this problem rely on a single similarity measure between graph structures. In this paper, we suggest an alternative approach allowing for searching similar graphs to a graph query where similarity between graphs is rather modeled(More)
—Current approaches for service discovery are based on semantic knowledge, such as ontologies and service behavior (described as a process model). However, these approaches have high selectivity rate, resulting in a large number of services offering similar functionalities and behavior. One way to improve the selectivity rate is to cope with user(More)
  • 1