Efficient Versus Accurate Algorithms for Computing a Semantic Logic-Based Similarity Measure-Reference-Cited by-同舟云学术

Efficient Versus Accurate Algorithms for Computing a Semantic Logic-Based Similarity Measure

Published:2018 Issue: Volume: Page:808-820
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Gmati Fatma Ezzahra,Chakhar Salem,Yacoubi Ayadi Nadia,Bahri Afef,Xu Mark

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-92058-0_78

Reference13 articles.

1. Bellur, U., Kulkarni, R.: Improved matchmaking algorithm for semantic Web services based on bipartite graph matching. In: IEEE International Conference on Web Services, Salt Lake City, Utah, USA, 9–13 July 2007, pp. 86–93 (2007)

2. Blake, M.B., Cabral, L., König-Ries, B., Küster, U., Martin, D. (eds.): Semantic Web Services, Advancement through Evaluation. Springer, Heidelberg (2012)

3. Chakhar, S.: Parameterized attribute and service levels semantic matchmaking framework for service composition. In: Fifth International Conference on Advances in Databases, Knowledge, and Data Applications (DBKDA 2013), Seville, Spain, 27 January–1 February 2013, pp. 159–165 (2013)

4. Chen, F., Lu, C., Wu, H., Li, M.: A semantic similarity measure integrating multiple conceptual relationships for web service discovery. Expert Syst. Appl. 67, 19–31 (2017)

5. Doshi, P., Goodwin, R., Akkiraju, R., Roeder, S.: Parameterized semantic matchmaking for workflow composition. IBM Research Report RC23133, IBM Research Division, March 2004

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Self-adaptive mobile web service discovery approach based on modified negative selection algorithm;Neural Computing and Applications;2021-09-20