14
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Comparing Neural and Attractiveness-based Visual Features for Artwork Recommendation

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Advances in image processing and computer vision in the latest years have brought about the use of visual features in artwork recommendation. Recent works have shown that visual features obtained from pre-trained deep neural networks (DNNs) perform very well for recommending digital art. Other recent works have shown that explicit visual features (EVF) based on attractiveness can perform well in preference prediction tasks, but no previous work has compared DNN features versus specific attractiveness-based visual features (e.g. brightness, texture) in terms of recommendation performance. In this work, we study and compare the performance of DNN and EVF features for the purpose of physical artwork recommendation using transaction data from UGallery, an online store of physical paintings. In addition, we perform an exploratory analysis to understand if DNN embedded features have some relation with certain EVF. Our results show that DNN features outperform EVF, that certain EVF features are more suited for physical artwork recommendation and, finally, we show evidence that certain neurons in the DNN might be partially encoding visual features such as brightness, providing an opportunity for explaining recommendations based on visual neural models.

          Related collections

          Most cited references5

          • Record: found
          • Abstract: not found
          • Conference Proceedings: not found

          Performance of recommender algorithms on top-n recommendation tasks

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            A shortest augmenting path algorithm for dense and sparse linear assignment problems

              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              Image-Based Recommendations on Styles and Substitutes

                Bookmark

                Author and article information

                Journal
                2017-06-22
                Article
                1706.07515
                623f900f-8c11-4fa4-a370-4e47cd2a70d8

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                submitted to DLRS 2017 workshop, co-located at RecSys 2017
                cs.IR cs.AI cs.CV cs.DL

                Computer vision & Pattern recognition,Information & Library science,Artificial intelligence

                Comments

                Comment on this article