Proximity matrix completion and ranking ant colony optimization technique in semantic web

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The semantic web consists of a large number of data that is difficult to retrieve the answer for the user queries. An existing method in the query processing in the semantic web has three main limitations namely, query flexibility, query relevancy or lack of ranking method and high query cost. In this study, Proximity Matrix Completion technique (PMC) is applied to impute the missing data in the dataset that helps to increase the query flexibility and Ranking Ant Colony Optimization (RACO) technique is used to select the relevant features from the dataset and arrange them to increase relevancy. The result shows that the PMC-RACO method has a higher performance compared to the exiting method in semantic web. The mean precision value of the PMC-RACO method in sports data is 87%, while the existing method has the precision value of 83%.

Cite

CITATION STYLE

APA

Jose, R. T., & Poulose, S. L. (2019). Proximity matrix completion and ranking ant colony optimization technique in semantic web. International Journal of Recent Technology and Engineering, 8(3), 797–802. https://doi.org/10.35940/ijrte.C4021.098319

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free