Matevž Kunaver (Author), Arpad Bürmen (Author), Iztok Fajfar (Author)

Abstract

Nowadays, recommender systems are vital in lessening the information overload by filtering out unnecessary information, thus increasing comfort and quality of life. Matrix factorization (MF) is a well-known recommender system algorithm that offers good results but requires a certain level of system knowledge and some effort on part of the user before use. In this article, we proposed an improvement using grammatical evolution (GE) to automatically initialize and optimize the algorithm and some of its settings. This enables the algorithm to produce optimal results without requiring any prior or in-depth knowledge, thus making it possible for an average user to use the system without going through a lengthy initialization phase. We tested the approach on several well-known datasets. We found our results to be comparable to those of others while requiring a lot less set-up. Finally, we also found out that our approach can detect the occurrence of over-saturation in large datasets.

Keywords

matrična faktorizacija;genetsko programiranje;slovnična evolucija;priporočilni sistemi;meta-optimizacija;matrix factorization;genetic programming;grammatical evolution;recommender systems;meta-optimization;

Data

Language: English
Year of publishing:
Typology: 1.01 - Original Scientific Article
Organization: UL FE - Faculty of Electrical Engineering
UDC: 004
COBISS: 103328771 Link will open in a new window
ISSN: 2227-7390
Views: 88
Downloads: 52
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: Slovenian
Secondary title: Elektronski vir
Secondary keywords: matrična faktorizacija;genetsko programiranje;slovnična evolucija;priporočilni sistemi;metaoptimizacija;
Type (COBISS): Article
Pages: str. 1-22
Volume: ǂiss. ǂ7
Issue: 1139
Chronology: Apr.-1 2022
DOI: 10.3390/math10071139
ID: 15347661