Loading…
Semi-supervised Collaborative Ranking with Push at the Top
Existing collaborative ranking based recommender systems tend to perform best when there is enough observed ratings for each user, and the observed data is uniformly sampled at random. However, when the observed ratings are extremely sparse (e.g. in the case of cold-start item where no rating data i...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 408 |
container_issue | |
container_start_page | 401 |
container_title | |
container_volume | |
creator | Forsati, Rana Barjasteh, Iman Esfahanian, Abdol-Hossein |
description | Existing collaborative ranking based recommender systems tend to perform best when there is enough observed ratings for each user, and the observed data is uniformly sampled at random. However, when the observed ratings are extremely sparse (e.g. in the case of cold-start item where no rating data is available), and are not sampled uniformly at random, existing ranking methods fail to effectively leverage side information to transduct the knowledge from existing ratings to unobserved ones. We propose a semi-supervised collaborative ranking model, dubbed S2COR, to improve the quality of cold-start item recommendation. S2COR mitigates the sparsity issue by leveraging side information about both observed and missing ratings by collaboratively learning the ranking model. This enables it to deal with the case of data missing not at random, but to also effectively incorporate the available side information in transduction. We experimentally evaluated our proposed algorithm on a number of challenging real-world datasets and compared our results against state-of-the-art models for cold-start recommendation. We show significantly higher quality recommendations with our algorithm when compared to other state-of-the-art methods. |
doi_str_mv | 10.1145/3110025.3110144 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>acm_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_9069104</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9069104</ieee_id><sourcerecordid>acm_books_10_1145_3110025_3110144</sourcerecordid><originalsourceid>FETCH-LOGICAL-a162t-32374012f887911aa5382dc75c15a1cd15f8cdf053a7d0e4fa56ff94edbd9ab83</originalsourceid><addsrcrecordid>eNqNkD1PwzAURQ0IiVI6M7B4ZEnwi-0kZkNV-ZAqgaBIbNZLbFPTpInitIh_T6p2YGR4utI7unc4hFwCiwGEvOEAjCUy3iUIcUTOhy_jQikuj8koERmPlIKPk7_gjExC-GJDEfLh-IjcvtnaR2HT2m7rgzV02lQVFk2Hvd9a-orrlV9_0m_fL-nLJiwp9rRfWrpo2gty6rAKdnLIMXm_ny2mj9H8-eFpejePENKkj3jCM8EgcXmeKQBEyfPElJksQSKUBqTLS-OY5JgZZoVDmTqnhDWFUVjkfEyu9rveWqvbztfY_WjFUgVMDDTeUyxrXTTNKmhgeqdIHxTpgyJddN66oXD9zwL_Bc6hYTU</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Semi-supervised Collaborative Ranking with Push at the Top</title><source>IEEE Xplore All Conference Series</source><creator>Forsati, Rana ; Barjasteh, Iman ; Esfahanian, Abdol-Hossein</creator><contributor>Xu, Guandong ; Ferrari, Elena ; Diesner, Jana</contributor><creatorcontrib>Forsati, Rana ; Barjasteh, Iman ; Esfahanian, Abdol-Hossein ; Xu, Guandong ; Ferrari, Elena ; Diesner, Jana</creatorcontrib><description>Existing collaborative ranking based recommender systems tend to perform best when there is enough observed ratings for each user, and the observed data is uniformly sampled at random. However, when the observed ratings are extremely sparse (e.g. in the case of cold-start item where no rating data is available), and are not sampled uniformly at random, existing ranking methods fail to effectively leverage side information to transduct the knowledge from existing ratings to unobserved ones. We propose a semi-supervised collaborative ranking model, dubbed S2COR, to improve the quality of cold-start item recommendation. S2COR mitigates the sparsity issue by leveraging side information about both observed and missing ratings by collaboratively learning the ranking model. This enables it to deal with the case of data missing not at random, but to also effectively incorporate the available side information in transduction. We experimentally evaluated our proposed algorithm on a number of challenging real-world datasets and compared our results against state-of-the-art models for cold-start recommendation. We show significantly higher quality recommendations with our algorithm when compared to other state-of-the-art methods.</description><identifier>ISBN: 1450349935</identifier><identifier>ISBN: 9781450349932</identifier><identifier>EISSN: 2473-991X</identifier><identifier>EISBN: 1450349935</identifier><identifier>EISBN: 9781450349932</identifier><identifier>DOI: 10.1145/3110025.3110144</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Information systems ; Information systems -- Information retrieval ; Information systems -- Information retrieval -- Retrieval tasks and goals ; Information systems -- Information retrieval -- Retrieval tasks and goals -- Document filtering ; Information systems -- Information retrieval -- Retrieval tasks and goals -- Information extraction ; Information systems -- Information systems applications ; Information systems -- Information systems applications -- Data mining</subject><ispartof>2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2017, p.401-408</ispartof><rights>2017 ACM</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9069104$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,23909,23910,25118,27902,54530,54907</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9069104$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><contributor>Xu, Guandong</contributor><contributor>Ferrari, Elena</contributor><contributor>Diesner, Jana</contributor><creatorcontrib>Forsati, Rana</creatorcontrib><creatorcontrib>Barjasteh, Iman</creatorcontrib><creatorcontrib>Esfahanian, Abdol-Hossein</creatorcontrib><title>Semi-supervised Collaborative Ranking with Push at the Top</title><title>2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)</title><addtitle>ASONAM</addtitle><description>Existing collaborative ranking based recommender systems tend to perform best when there is enough observed ratings for each user, and the observed data is uniformly sampled at random. However, when the observed ratings are extremely sparse (e.g. in the case of cold-start item where no rating data is available), and are not sampled uniformly at random, existing ranking methods fail to effectively leverage side information to transduct the knowledge from existing ratings to unobserved ones. We propose a semi-supervised collaborative ranking model, dubbed S2COR, to improve the quality of cold-start item recommendation. S2COR mitigates the sparsity issue by leveraging side information about both observed and missing ratings by collaboratively learning the ranking model. This enables it to deal with the case of data missing not at random, but to also effectively incorporate the available side information in transduction. We experimentally evaluated our proposed algorithm on a number of challenging real-world datasets and compared our results against state-of-the-art models for cold-start recommendation. We show significantly higher quality recommendations with our algorithm when compared to other state-of-the-art methods.</description><subject>Information systems</subject><subject>Information systems -- Information retrieval</subject><subject>Information systems -- Information retrieval -- Retrieval tasks and goals</subject><subject>Information systems -- Information retrieval -- Retrieval tasks and goals -- Document filtering</subject><subject>Information systems -- Information retrieval -- Retrieval tasks and goals -- Information extraction</subject><subject>Information systems -- Information systems applications</subject><subject>Information systems -- Information systems applications -- Data mining</subject><issn>2473-991X</issn><isbn>1450349935</isbn><isbn>9781450349932</isbn><isbn>1450349935</isbn><isbn>9781450349932</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2017</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNqNkD1PwzAURQ0IiVI6M7B4ZEnwi-0kZkNV-ZAqgaBIbNZLbFPTpInitIh_T6p2YGR4utI7unc4hFwCiwGEvOEAjCUy3iUIcUTOhy_jQikuj8koERmPlIKPk7_gjExC-GJDEfLh-IjcvtnaR2HT2m7rgzV02lQVFk2Hvd9a-orrlV9_0m_fL-nLJiwp9rRfWrpo2gty6rAKdnLIMXm_ny2mj9H8-eFpejePENKkj3jCM8EgcXmeKQBEyfPElJksQSKUBqTLS-OY5JgZZoVDmTqnhDWFUVjkfEyu9rveWqvbztfY_WjFUgVMDDTeUyxrXTTNKmhgeqdIHxTpgyJddN66oXD9zwL_Bc6hYTU</recordid><startdate>20170731</startdate><enddate>20170731</enddate><creator>Forsati, Rana</creator><creator>Barjasteh, Iman</creator><creator>Esfahanian, Abdol-Hossein</creator><general>ACM</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>20170731</creationdate><title>Semi-supervised Collaborative Ranking with Push at the Top</title><author>Forsati, Rana ; Barjasteh, Iman ; Esfahanian, Abdol-Hossein</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a162t-32374012f887911aa5382dc75c15a1cd15f8cdf053a7d0e4fa56ff94edbd9ab83</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Information systems</topic><topic>Information systems -- Information retrieval</topic><topic>Information systems -- Information retrieval -- Retrieval tasks and goals</topic><topic>Information systems -- Information retrieval -- Retrieval tasks and goals -- Document filtering</topic><topic>Information systems -- Information retrieval -- Retrieval tasks and goals -- Information extraction</topic><topic>Information systems -- Information systems applications</topic><topic>Information systems -- Information systems applications -- Data mining</topic><toplevel>online_resources</toplevel><creatorcontrib>Forsati, Rana</creatorcontrib><creatorcontrib>Barjasteh, Iman</creatorcontrib><creatorcontrib>Esfahanian, Abdol-Hossein</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Forsati, Rana</au><au>Barjasteh, Iman</au><au>Esfahanian, Abdol-Hossein</au><au>Xu, Guandong</au><au>Ferrari, Elena</au><au>Diesner, Jana</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Semi-supervised Collaborative Ranking with Push at the Top</atitle><btitle>2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)</btitle><stitle>ASONAM</stitle><date>2017-07-31</date><risdate>2017</risdate><spage>401</spage><epage>408</epage><pages>401-408</pages><eissn>2473-991X</eissn><isbn>1450349935</isbn><isbn>9781450349932</isbn><eisbn>1450349935</eisbn><eisbn>9781450349932</eisbn><abstract>Existing collaborative ranking based recommender systems tend to perform best when there is enough observed ratings for each user, and the observed data is uniformly sampled at random. However, when the observed ratings are extremely sparse (e.g. in the case of cold-start item where no rating data is available), and are not sampled uniformly at random, existing ranking methods fail to effectively leverage side information to transduct the knowledge from existing ratings to unobserved ones. We propose a semi-supervised collaborative ranking model, dubbed S2COR, to improve the quality of cold-start item recommendation. S2COR mitigates the sparsity issue by leveraging side information about both observed and missing ratings by collaboratively learning the ranking model. This enables it to deal with the case of data missing not at random, but to also effectively incorporate the available side information in transduction. We experimentally evaluated our proposed algorithm on a number of challenging real-world datasets and compared our results against state-of-the-art models for cold-start recommendation. We show significantly higher quality recommendations with our algorithm when compared to other state-of-the-art methods.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/3110025.3110144</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 1450349935 |
ispartof | 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2017, p.401-408 |
issn | 2473-991X |
language | eng |
recordid | cdi_ieee_primary_9069104 |
source | IEEE Xplore All Conference Series |
subjects | Information systems Information systems -- Information retrieval Information systems -- Information retrieval -- Retrieval tasks and goals Information systems -- Information retrieval -- Retrieval tasks and goals -- Document filtering Information systems -- Information retrieval -- Retrieval tasks and goals -- Information extraction Information systems -- Information systems applications Information systems -- Information systems applications -- Data mining |
title | Semi-supervised Collaborative Ranking with Push at the Top |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T13%3A37%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-acm_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Semi-supervised%20Collaborative%20Ranking%20with%20Push%20at%20the%20Top&rft.btitle=2017%20IEEE/ACM%20International%20Conference%20on%20Advances%20in%20Social%20Networks%20Analysis%20and%20Mining%20(ASONAM)&rft.au=Forsati,%20Rana&rft.date=2017-07-31&rft.spage=401&rft.epage=408&rft.pages=401-408&rft.eissn=2473-991X&rft.isbn=1450349935&rft.isbn_list=9781450349932&rft_id=info:doi/10.1145/3110025.3110144&rft.eisbn=1450349935&rft.eisbn_list=9781450349932&rft_dat=%3Cacm_CHZPO%3Eacm_books_10_1145_3110025_3110144%3C/acm_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-a162t-32374012f887911aa5382dc75c15a1cd15f8cdf053a7d0e4fa56ff94edbd9ab83%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=9069104&rfr_iscdi=true |