{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:45:44Z","timestamp":1740181544076,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s42979-022-01171-4","type":"journal-article","created":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T13:04:22Z","timestamp":1653138262000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Graph-Based Recommendation Algorithm on Quaternion Algebra"],"prefix":"10.1007","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1740-6982","authenticated-orcid":false,"given":"Zuhal","family":"Kurt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8183-1356","authenticated-orcid":false,"given":"\u00d6mer Nezih","family":"Gerek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3467-9915","authenticated-orcid":false,"given":"Alper","family":"Bilge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2252-2128","authenticated-orcid":false,"given":"Kemal","family":"\u00d6zkan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,21]]},"reference":[{"key":"1171_CR1","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-35236-2_21","volume-title":"AMT 12 international conference on active media technology","author":"X Yuan","year":"2012","unstructured":"Yuan X, Huang JJ. An adaptive method for the tag-rating-based recommender system. In: AMT 12 international conference on active media technology. Berlin: Springer; 2012. p. 206\u201314."},{"key":"1171_CR2","doi-asserted-by":"crossref","unstructured":"Zhang Y, Ai Q, Chen X, Croft WB. Joint representation learning for top-n recommendation with heterogeneous information sources. In: CIKM\u201917, 26th Conference on Information and Knowledge Management, ACM, 2017, pp. 1449\u201358.","DOI":"10.1145\/3132847.3132892"},{"key":"1171_CR3","first-page":"280","volume-title":"Lecture notes on data engineering and communications technologies (trends in data engineering methods for intelligent systems)","author":"Z Kurt","year":"2020","unstructured":"Kurt Z, Gerek ON, Bilge A, \u00d6zkan K. A multi source graph-based hybrid recommendation algorithm. In: Lecture notes on data engineering and communications technologies (trends in data engineering methods for intelligent systems). Berlin: Springer; 2020. p. 280\u201391."},{"key":"1171_CR4","doi-asserted-by":"crossref","unstructured":"Zhang S, Yao L, Tran LV, Zhang A, Tay Y. Quaternion collaborative filtering for recommendation. 2019. arXiv preprint, arXiv:1906.02594.","DOI":"10.24963\/ijcai.2019\/599"},{"key":"1171_CR5","doi-asserted-by":"crossref","unstructured":"Hayashi K, Shimbo M. On the equivalence of holographic and complex embeddings for link prediction. 2017. arXiv preprint, arXiv:1702.05563.","DOI":"10.18653\/v1\/P17-2088"},{"key":"1171_CR6","unstructured":"Danihelk I, Wayne G, Uria B, Kalchbrenner N, Graves A. Associative long short-term memory. 2016. arXiv preprint, arXiv:1602.03032."},{"key":"1171_CR7","unstructured":"Trouillon T, Welbl J, Riedel S, Gaussier \u00c9, Bouchard G. Complex embeddings for simple link prediction. In: ICML\u201916, International Conference on Machine Learning, 2016."},{"key":"1171_CR8","doi-asserted-by":"crossref","unstructured":"Tay Y, Luu AT, Hui SC. Hermitian co-attention networks for text matching in asymmetrical domains. In: IJCAI\u201918, 27th International Joint Conference on Artificial Intelligence, 2018, pp. 4425\u201331.","DOI":"10.24963\/ijcai.2018\/615"},{"key":"1171_CR9","unstructured":"Trabelsi C, Bilaniuk O, Zhang Y, Serdyuk D, Subramanian S, Santos JF, Pal CJ. Deep complex networks. 2017. arXiv preprint, arXiv: 170509792."},{"key":"1171_CR10","doi-asserted-by":"crossref","unstructured":"Witten B, Shragge J. Quaternion-based signal processing. In: SEG technical program expanded abstracts, Society of Exploration Geophysicists, 2006, pp. 2862\u201366.","DOI":"10.1190\/1.2370120"},{"key":"1171_CR11","doi-asserted-by":"crossref","unstructured":"Parcollet T, Morchid M, Linar\u00e8s G. Quaternion convolutional neural networks for heterogeneous image processing. In: ICASSP\u201919, International Conference on Acoustics, Speech and Signal Processing, IEEE, 2019, pp. 8514\u201318.","DOI":"10.1109\/ICASSP.2019.8682495"},{"key":"1171_CR12","doi-asserted-by":"crossref","unstructured":"Gaudet CJ, Maida AS. Deep quaternion networks. In: IJCNN\u201918, International Joint Conference on Neural Networks, IEEE, 2019, pp. 1\u20138.","DOI":"10.1109\/IJCNN.2018.8489651"},{"key":"1171_CR13","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.ins.2017.09.057","volume":"423","author":"AB Greenblatt","year":"2018","unstructured":"Greenblatt AB, Agaian SS. Introducing quaternion multi-valued neural networks with numerical examples. Inf Sci. 2018;423:326\u201342.","journal-title":"Inf Sci"},{"key":"1171_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.neucom.2016.09.060","volume":"221","author":"LS Saoud","year":"2017","unstructured":"Saoud LS, Ghorbani R, Rahmoune F. Cognitive quaternion valued neural network and some applications. Neurocomputing. 2017;221:85\u201393.","journal-title":"Neurocomputing"},{"key":"1171_CR15","doi-asserted-by":"crossref","unstructured":"Du Y, Xu C, Tao D. Privileged matrix factorization for collaborative filtering. In: IJCAI\u201917, 26th International Joint Conference on Artificial Intelligence, Melbourne, Australia August 19\u201325, 2017, pp. 1610\u201316.","DOI":"10.24963\/ijcai.2017\/223"},{"key":"1171_CR16","doi-asserted-by":"crossref","unstructured":"Wang Z, Tan Y, Zhang M. Graph-based recommendation on social networks. In: 12th International Asia-Pacific Web Conference, IEEE, 2010, pp. 116\u2013122.","DOI":"10.1109\/APWeb.2010.60"},{"issue":"6","key":"1171_CR17","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/TKDE.2005.99","volume":"17","author":"G Adomavicius","year":"2005","unstructured":"Adomavicius G, Tuzhilin A. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans Knowl Data Eng. 2005;17(6):734\u201349.","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1171_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/963770.963772","volume":"22","author":"JL Herlocker","year":"2004","unstructured":"Herlocker JL, Konstan JA, Terveen LG, Riedl JT. Evaluating collaborative filtering recommender systems. ACM Trans Inf Syst. 2004;22(1):5\u201353.","journal-title":"ACM Trans Inf Syst"},{"key":"1171_CR19","doi-asserted-by":"crossref","unstructured":"McNee SM, Riedl J, Konstan JA. Being accurate is not enough: how accuracy metrics have hurt recommender systems. In: CHI'06, Conference on Human Factors in Computing Systems, Montreal, Canada, 2006, pp. 1097\u2013101.","DOI":"10.1145\/1125451.1125659"},{"issue":"1","key":"1171_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1921591.1921593","volume":"5","author":"F Cacheda","year":"2011","unstructured":"Cacheda F, Carneiro V, Fern\u00e1ndez D, Formoso V. Comparison of collaborative filtering algorithms: Limitations of current techniques and proposals for scalable, high-performance recommender systems. ACM Trans Web. 2011;5(1):1\u201333.","journal-title":"ACM Trans Web"},{"issue":"6","key":"1171_CR21","doi-asserted-by":"publisher","first-page":"62","DOI":"10.5755\/j01.eie.25.6.24828","volume":"25","author":"Z Kurt","year":"2019","unstructured":"Kurt Z, Ozkan K, Bilge A, Gerek ON. A similarity-inclusive link prediction based recommender system approach. Elektronika IR Elektrotechnika. 2019;25(6):62\u20139.","journal-title":"Elektronika IR Elektrotechnika"},{"key":"1171_CR22","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.knosys.2015.02.013","volume":"81","author":"F Xie","year":"2015","unstructured":"Xie F, Chen Z, Shang J, Feng X, Li J. A link prediction approach for item recommendation with complex number. Knowl-Based Syst. 2015;81:148\u201358.","journal-title":"Knowl-Based Syst"},{"key":"1171_CR23","first-page":"4","volume":"11","author":"A Mishchenko","year":"2000","unstructured":"Mishchenko A, Solovyov Y. Quaternions. Quantum. 2000;11:4\u20137.","journal-title":"Quantum"},{"key":"1171_CR24","doi-asserted-by":"crossref","unstructured":"Kunegis J, Gr\u00f6ner G, Gottron T. Online dating recommender systems: the split-complex number approach. In: RSWeb\u201912, 4th ACM Recsys Workshop on Recommender Systems and the Social Web, ACM 2012, pp. 37\u201344.","DOI":"10.1145\/2365934.2365942"},{"key":"1171_CR25","first-page":"143","volume":"2","author":"F Harary","year":"1955","unstructured":"Harary F. On the notion of balance of a signed graph. Mich Math J. 1955;2:143\u20136.","journal-title":"Mich Math J"},{"issue":"4","key":"1171_CR26","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/BF02476926","volume":"29","author":"F Harary","year":"1967","unstructured":"Harary F, Palmer EM. On the number of balanced signed graphs. Bull Math Biophys. 1967;29(4):759\u201365.","journal-title":"Bull Math Biophys"},{"key":"1171_CR27","first-page":"842","volume":"1","author":"Z Kurt","year":"2021","unstructured":"Kurt Z, Gerek \u00d6N, Bilge A, \u00d6zkan K. Similarity-inclusive link prediction with Quaternions. Int Conf Enterp Inf Syst. 2021;1:842\u201354.","journal-title":"Int Conf Enterp Inf Syst"},{"key":"1171_CR28","first-page":"163","volume-title":"ISTA\u201917, 2nd international symposium on intelligent systems technologies and applications","author":"P Bedi","year":"2017","unstructured":"Bedi P, Gautam A, Bansal S, Bhatia D. Weighted bipartite graph model for recommender system using entropy based similarity measure. In: ISTA\u201917, 2nd international symposium on intelligent systems technologies and applications. Cham: Springer; 2017. p. 163\u201373."},{"key":"1171_CR29","unstructured":"http:\/\/jmcauley.ucsd.edu\/data\/amazon\/. Accessed 18 May 2022."},{"issue":"1","key":"1171_CR30","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2926720","volume":"7","author":"M Kaminskas","year":"2017","unstructured":"Kaminskas M, Bridge D. Diversity, serendipity, novelty, and coverage: a survey and empirical analysis of beyond-accuracy objectives in recommender systems. ACM Trans Interact Intell Syst. 2017;7(1):2.","journal-title":"ACM Trans Interact Intell Syst"},{"key":"1171_CR31","unstructured":"http:\/\/grouplens.org\/datasets\/movielens\/100k\/. Accessed 18 May 2022."},{"key":"1171_CR32","unstructured":"https:\/\/grouplens.org\/datasets\/hetrec-2011\/. Accessed 18 May 2022."},{"key":"1171_CR33","doi-asserted-by":"crossref","unstructured":"Huang Z, Chung W, Ong TH, Chen H. A graph-based recommender system for digital library. In: JCDL\u201902, 2nd ACM\/IEEE-CS joint Conference on Digital libraries, ACM, Oregon, USA, 2002, pp. 65\u201373.","DOI":"10.1145\/544220.544231"},{"key":"1171_CR34","unstructured":"Quaternion toolbox for Matlab, http:\/\/qtfm.sourceforge.net\/. Accessed 18 May 2022."},{"key":"1171_CR35","volume-title":"Fundamentals of matrix analysis with applications","author":"EB Saff","year":"2015","unstructured":"Saff EB, Snider AD. Fundamentals of matrix analysis with applications. New Jersey: John Wiley & Sons; 2015."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01171-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01171-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01171-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T18:06:18Z","timestamp":1727287578000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01171-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,21]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1171"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01171-4","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2022,5,21]]},"assertion":[{"value":"16 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"299"}}