Recommendation system using collaborative deep learning
[ppt] A Comparison of SAWSDL Based Semantic Web Service Discovery Algorithms
1. A COMPARISON OF SAWSDL BASED SEMANTIC WEB SERVICE DISCOVERY ALGORITHMS By Shiva SandeepGarlapati Graduate Student Dept. of Computer Science University of Georgia
11. Semantic Web Services Extensions to the web services description by adding semantic annotations, which make the web services more machine-understandable and allows machines to perform automated discovery, compositions of web services.
25. SAWSDL-MX2 (SVM based matching)[1] Klusch, Patrick Kapahnke and Ingo Zinnikus: Hybrid Adaptive Web Service Selection with SAWSDL-MX and WSDL Analyzer. The 6th Annual European Semantic Web Conference (ESWC 2009)
43. N-Gram algorithm for syntactic similarity[2] Jorge Cardoso, John Miller, SavithaEmani: Web Service Discovery using Annotated WSDL, Reasoning Web Fourth International Summer School 2008 Published BY Springer 2008.
44. TVERSKY (Common ontology) p(C) is the defined as the set of properties of the concept C in the ontology
53. N-Gram algorithm for syntactic similarity[3] KunalVerma, et al. "Allowing the Use of Multiple Ontologies for Discovery of Web Services in Federated Registry Environment," Technical Report #UGA-CS-LSDIS-TR-07-011, Department of Computer Science, University of Georgia, Athens, Georgia (February 2007) pp. 1-27.
79. MWSDI calculates the concept similarity as a weighted average of coverage, property and syntatic similarity which is a more detailed approach compared to Tversky
80. MWSDI has deeper hierarchy of comparison since it use Hungarian algorithm at every level of concept match, which make it slow
93. N-Gram Similarity n-gram is a subsequence of n items from a given sequence N-GramSim(R.G,S.G) = Where R.G is the set of N-Grams for the unfolded Concept expression of R