img
img
Application of PageRank Algorithm in Linked Data   
Yazarlar (3)
Yasemin Gültepe
Kastamonu Üniversitesi, Türkiye
Doç. Dr. Kemal AKYOL Doç. Dr. Kemal AKYOL
Kastamonu Üniversitesi, Türkiye
Abdulkadir Karacı
Kastamonu Üniversitesi, Türkiye
Devamını Göster
Özet
The 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 spaceindependent 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.
Anahtar Kelimeler
Bildiri Türü Tebliğ/Bildiri
Bildiri Alt Türü Tam Metin Olarak Yayınlanan Tebliğ (Uluslararası Kongre/Sempozyum)
Bildiri Niteliği Alanında Hakemli Uluslararası Kongre/Sempozyum
Bildiri Dili İngilizce
Kongre Adı International Conference on Advanced Technologies, Computer Engineering and Science (ICATCES’18)
Kongre Tarihi 11-05-2018 / 13-05-2018
Basıldığı Ülke Türkiye
Basıldığı Şehir Safranbolu
BM Sürdürülebilir Kalkınma Amaçları
Atıf Sayıları

Paylaş