Knowledge and Information Systems Human-Computer Interaction
Navigating scalability to enhance service discovery and recommendations with graph-based embedding models
Abstract
Semantic web service discovery faces scalability challenges associated with increasing repository size, heterogeneous ontology structures, and the computational overhead of semantic matching and ranking. This work presents a clustering-assisted knowledge graph embedding (KGE) framework for semantic web service discovery and recommendation. An integrated knowledge graph semantic web service (KGSWS) repository was constructed from 48 OWLS-TC v4 ontologies containing 1083 semantic web services. In Phase 1, TransE, ComplEx, and DistMult were optimized over KGSWS to learn semantic representations through link prediction evaluation. Among the evaluated models, TransE achieved the best embedding quality with MRR of 0.5792 and Hits@10 value of 0.6716. In Phase 2, the learned representations were evaluated using different clustering techniques to support candidate search-space reduction prior to service ranking. In Phase 3, recommendation performance was evaluated using 38 benchmark queries in terms of Precision@10, Recall@10, NDCG@10, and MAP@10. The TransE + K-Means configuration obtained average values of 0.9579, 0.7207, 0.9667, and 0.9873, respectively. Differences among the evaluated configurations were further examined using the Friedman test followed by Dunn–Bonferroni post hoc analysis. For the evaluated repository settings, the scalability analysis obtained a search-space reduction of 82.73%, a query-processing speedup of 3.61×, and a latency reduction of 72.27% for the complete repository. The memory analysis indicated a 54.66% reduction in storage for the embedding representation relative to the serialized ontology representation under the adopted storage calculation. Quantitative comparison against ontology-based semantic matching showed improvements of 13.75% in Precision@10, 19.84% in Recall@10, 11.80% in NDCG@10, and 18.72% in MAP@10. Therefore, the evaluated results indicate that combining KGE-based semantic representations with clustering-assisted candidate selection can reduce the service search space while maintaining retrieval and ranking performance under the benchmark and experimental settings considered in this study.