Ontology-based grid service discovery algorithm with bipartite graph
Jiang Zhong · Computer Engineering and Applications Journal · 2008
To improve the recall,precision,and efficiency of grid services discovery,based on ontology technology and rough sets theory,an algorithm OGSDA-BG is designed.The property sets of request service and advertise service act as the vertex sets of bipartite graph.The edge sets is made up of the lines between properties matched,and the matching degree is the weight of edges.So the problem of grid service discovery becomes the optimal complete match.Experiment indicates that the recall and precision of algorithm OGSDA-BG improved 10%~50%.Although the efficiency decreased about 10%,it can be accepted.