Abstract:To solve the low efficiency problem of grid service discovery, based on ontology technology, the theory of decision table, and knowledge representation system of rough sets, the paper put forward an optimized service discovery algorithm that considered the weight of the service properties. By rule extraction of the service invocation history and the calculation of the service properties weight, two main phases of the service discovery algorithm: information pre-processing and rough set service matching could be achieved. This article also gave theoretical analysis and experimental verification on both precision rate and recall rate. The results show that the proposed algorithm can provide higher precision and recall rate; besides, the ranking results of the candidate services are more preferable.
OWL-S: Semantic markup for Web service [EB/OL]. [2011-04-22]. http://www.w3.org/Submission/OWL-S.
[3]
SEINIVASAN N, PAOLUCCI M, SYCARA K. Semantic Web service discovery in the OWL-S IDE [C]// Proceedings of the 39th Annual Hawaii International Conference on System Sciences. Washington, DC: IEEE Computer Society, 2006: 109b.
HUANG RUNCAI, ZHUANG YIWEN, CAO QIYING. Research on rough sets based service matchmaking algorithm for pervasive computing [C]// IEEE International Symposium on Information Science and Engineering. Washington, DC: IEEE Computer Society, 2008: 43-47.
[9]
YU LIAN, LUO SHAN, GLENSTRUP A. Rough sets based context-aware service discovery framework [C]// IEEE International Conference on Service Science. Washington, DC: IEEE Computer Society, 2010: 167-172.
[10]
BATRA S, BAWA S. Review of machine learning approaches to semantic Web service discovery [J]. Journal of Advances in Information Technology, 2010, 1(8): 146-151.
[11]
CACERES C, FERNANDEZ A, OSSOWSKI S. Agent-based se-mantic service discovery for healthcare: An organizational approach [J]. IEEE Intelligent Systems, 2006, 21(6): 11-20.