Semantic Distance Spreading Across Entities in Linked Open Data†
AbstractRecommender systems can utilize Linked Open Data (LOD) to overcome some challenges, such as the item cold start problem, as well as the problem of explaining the recommendation. There are several techniques in exploiting LOD in recommender systems; one approach, called Linked Data Semantic Distance (LDSD), considers nearby resources to be recommended by calculating a semantic distance between resources. The LDSD approach, however, has some drawbacks such as its inability to measure the semantic distance resources that are not directly linked to each other. In this paper, we first propose another variation of the LDSD approach, called wtLDSD, by extending indirect distance calculations to include the effect of multiple links of differing properties within LOD, while prioritizing link properties. Next, we introduce an approach that broadens the coverage of LDSD-based approaches beyond resources that are more than two links apart. Our experimental results show that approaches we propose improve the accuracy of the LOD-based recommendations over our baselines. Furthermore, the results show that the propagation of semantic distance calculation to reflect resources further away in the LOD graph extends the coverage of LOD-based recommender systems. View Full-Text
Share & Cite This Article
Alfarhood, S.; Gauch, S.; Labille, K. Semantic Distance Spreading Across Entities in Linked Open Data. Information 2019, 10, 15.
Alfarhood S, Gauch S, Labille K. Semantic Distance Spreading Across Entities in Linked Open Data. Information. 2019; 10(1):15.Chicago/Turabian Style
Alfarhood, Sultan; Gauch, Susan; Labille, Kevin. 2019. "Semantic Distance Spreading Across Entities in Linked Open Data." Information 10, no. 1: 15.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.