Please use this identifier to cite or link to this item:
|Title:||A Graph-Based Recommendation Algorithm on Quaternion Algebra||Authors:||Kurt, Zuhal
Gerek, Ömer Nezih
|Issue Date:||2022||Publisher:||Springer||Abstract:||This study presents a novel Quaternion-based link prediction method to be used in different recommendation systems. The method performs Quaternion algebra-based computations while making use of expressive and wide-ranged learning properties of the Hamilton products. The proposed key capabilities rely on link prediction to boost performance in top-N recommendation tasks. According to the achieved experimental results, the proposed method allows for highly improved performance according to three quality measurements: (i) hits rate, (ii) coverage, and (iii) novelty; when applied to two datasets, namely the Movielens and Hetrec datasets. To assess the flexibility level of the proposed algorithm in terms of incorporating alternative sources of information, further wide-scale tests are carried out on three subsets of the Amazon dataset. Hence, the effectiveness of Quaternion algebra in graph-based recommendation algorithms is verified. The algorithms suggested here are further enhanced using similarity and dissimilarity factors between users and items, as well as ‘like’ and ‘dislike’ relationships between users and items. It is observed that this approach is adaptable by incorporating different information sources and can successfully overcome the drawbacks of conventional graph-based recommender systems. It is argued that the proposed novel idea of Quaternion-based link prediction method stands as a superior alternative to existing methods. © 2022, The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd.||URI:||https://doi.org/10.1007/s42979-022-01171-4
|Appears in Collections:||Scopus İndeksli Yayınlar Koleksiyonu|
Show full item record
checked on Oct 3, 2022
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.