IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v3y2018i3idhcseit1833463.html

Recommending Fashion Pattern Clothes Based on Collaborative Filtering and Recurrent Neural Network - A Maximum Likelihood Classification Approach

Author

Listed:
  • S. Shiva Shankar
  • B. Priyadharshini

Abstract

Fashion accoutrements recommendation system is often problematic area in which pattern clothes configuration with images is challenging and it needs creativity as well. Combining items like jewelry, bag, pants, cap, dress, shoes with appearance. In fashion websites, popular or high-quality fashion clothes in India are designed by fashion experts and followed by large spectators. Recurrent neural network has been proposed in this paper. The center of the proposed motorized configuration system is to score fashion pattern clothes candidates based on the appearances and metadata. We propose to influence pattern clothes popularity on fashion-oriented websites to supervise the fashion acceptance score component. The fashion acceptance score part is a avant-garded multiple modal multiple occurrence deep learning system that evaluates instance artistic and set compatibility simultaneously. In order to coach and assess the proposed configuration system, we have collected a large-scale fashion pattern clothes dataset with 208K clothes and 668K fashion items from Fancy data. Although the fashion pattern clothes fashion acceptance score and configuration is rather challenging, we have achieved an AUC of 90% for the fashion acceptance score component, and an accuracy of 83% for a constrained configuration task.

Suggested Citation

  • S. Shiva Shankar & B. Priyadharshini, 2018. "Recommending Fashion Pattern Clothes Based on Collaborative Filtering and Recurrent Neural Network - A Maximum Likelihood Classification Approach," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 3(3), pages 1164-1172, April.
  • Handle: RePEc:jbh:ijsrcs:v3:y2018:i3:id:hcseit1833463
    Note: Article URL: https://ijsrcseit.com/CSEIT1833463
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT1833463
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT1833463.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v3:y2018:i3:id:hcseit1833463. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.