Application of PageRank Algorithm in Linked Data
Yasemin Gültepe Kemal Akyol Abdulkadir Karaci
AbstractThe main purpose of the semantic web is to develop standards and technologies that will enable well-defined and linked information and services to be easily computer-readable and computer-understandable in the web environment. Linked data is one of the approaches used to acquire meaningful integrity by gathering data-related data collections by creating semantic links between the web pages that make up the content of the semantic web. Linked data is based on RDF (Resource Description Framework) technology. RDF is a data model that provides space-independent formal semantics with respect to chart resources. In a linked data application, the most important decision point is how to access the linked data. Linked data crawler is a program that explores linked data in web by tracking RDF links. In this work, DBLP (Database Systems and Logic Programming) data set is used as a source of Linked Data. DBLP gradually expanded toward all fields of computer science. An example will be presented related to pageRank sorting of RDF resources in the DBLP dataset. As a result; the search area has shrunk and search results have improved.