{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:29:00Z","timestamp":1767706140627},"reference-count":0,"publisher":"National Library of Serbia","issue":"4","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>Extracting the semantic relatedness of terms is an important topic in several\n   areas, including data mining, information retrieval and web recommendation.\n   This paper presents an approach for computing the semantic relatedness of\n   terns in RDF graphs based on the notion of proximity. It proposes a formal\n   definition of proximity in terms of the set paths connecting two concept\n   nodes, and an algorithm for finding this set and computing proximity with a\n   given error margin. This algorithm was implemented on a tool called Shakti\n   that extracts relevant ontological data for a given domain from DBpedia - a\n   community effort to extract structured data from the Wikipedia. To validate\n   the proposed approach Shakti was used to recommend web pages on a Portuguese\n   social site related to alternative music and the results of that experiment\n   are also reported.<\/jats:p>","DOI":"10.2298\/csis121130060l","type":"journal-article","created":{"date-parts":[[2013,7,8]],"date-time":"2013-07-08T13:50:49Z","timestamp":1373291449000},"page":"1727-1746","source":"Crossref","is-referenced-by-count":11,"title":["Using proximity to compute semantic relatedness in RDF graphs"],"prefix":"10.2298","volume":"10","author":[{"suffix":"Paulo","given":"Jos\u00e9","family":"Leal","sequence":"first","affiliation":[{"name":"CRACS & INESC-Porto LA, Faculty of Sciences, University of Porto Porto, Portugal"}]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:31:11Z","timestamp":1685349071000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141300060L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013]]}},"URL":"https:\/\/doi.org\/10.2298\/csis121130060l","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}