LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A Fast Deep AutoEncoder for high-dimensional and sparse matrices in recommender systems

Photo from wikipedia

Abstract A latent factor analysis (LFA)-based model has outstanding performance in extracting desired patterns from High-dimensional and Sparse (HiDS) data for building a recommender systems. However, they mostly fail in… Click to show full abstract

Abstract A latent factor analysis (LFA)-based model has outstanding performance in extracting desired patterns from High-dimensional and Sparse (HiDS) data for building a recommender systems. However, they mostly fail in acquiring non-linear features from an HiDS matrix. An AutoEncoder (AE)-based model can address this issue efficiently, but it requires filling unknown data of an HiDS matrix with pre-assumptions that leads to the following limitations: a) prefilling unknown data of an HiDS matrix might skew its known data distribution to generate ridiculous recommendations; and b) incorporating a deep AE-style structure to improve its representative learning ability. Experimental results on three HiDS matrices from real recommender systems show that an FDAE-based model significantly outperforms state-of-the-art recommenders in terms of recommendation accuracy. Meanwhile, its computational efficiency is comparable with the most efficient recommenders with the help of parallelization.

Keywords: dimensional sparse; high dimensional; autoencoder; recommender systems; based model

Journal Title: Neurocomputing
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.