Exploration of Learning Service Discovery Algorithm based on Ontology

Xuhong Peng

Abstract


To study the learning service discovery algorithm based on ontology, the introduction of bipartite graph theory is focused on. Based on the undergraduate technology, a learning service discovery algorithm based on the basic bipartite graph theory (eLSDA-BG) is proposed. The algorithm mainly converts the problem of learning service match into the optimal complete match problem of bipartite graphs. Through the optimal complete match problem, the learning service match is realized and the learning service discovery is finally reached. The eLSDA-BG algorithm is compared with the greedy algorithm, the UDDI (Universal Description, Discovery, and Integration) algorithm, and OWL-S (Web Ontology Language for Service) algorithm. The comparison of results shows that the eLSDA-BG algorithm proposed can improve recall ratio, accuracy rate and efficiency of learning service discovery in situation of certain sample size.

Keywords


bipartite graph; learning services; ontology

Full Text:

PDF


Copyright (c) 2018 Xuhong Peng


International Journal of Emerging Technologies in Learning. ISSN: 1863-0383
Creative Commons License SPARC Europe Seal
Indexing:
Web of Science ESCI logo Engineering Information logo INSPEC logo DBLP logo ELSEVIER Scopus logo EDiTLib logo EBSCO logo Ulrich's logo Google Scholar logo Microsoft® Academic SearchDOAJ logo