General factorization framework for context-aware recommendations

Context-aware recommendation algorithms focus on refining recommendations by considering additional information, available to the system. This topic has gained a lot of attention recently. Among others, several factorization methods were proposed to solve the problem, although most of them assume ex...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Data mining and knowledge discovery 2016-03, Vol.30 (2), p.342-371
Hauptverfasser: Hidasi, Balázs, Tikk, Domonkos
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 371
container_issue 2
container_start_page 342
container_title Data mining and knowledge discovery
container_volume 30
creator Hidasi, Balázs
Tikk, Domonkos
description Context-aware recommendation algorithms focus on refining recommendations by considering additional information, available to the system. This topic has gained a lot of attention recently. Among others, several factorization methods were proposed to solve the problem, although most of them assume explicit feedback which strongly limits their real-world applicability. While these algorithms apply various loss functions and optimization strategies, the preference modeling under context is less explored due to the lack of tools allowing for easy experimentation with various models. As context dimensions are introduced beyond users and items, the space of possible preference models and the importance of proper modeling largely increases. In this paper we propose a general factorization framework (GFF), a single flexible algorithm that takes the preference model as an input and computes latent feature matrices for the input dimensions. GFF allows us to easily experiment with various linear models on any context-aware recommendation task, be it explicit or implicit feedback based. The scaling properties makes it usable under real life circumstances as well. We demonstrate the framework’s potential by exploring various preference models on a 4-dimensional context-aware problem with contexts that are available for almost any real life datasets. We show in our experiments—performed on five real life, implicit feedback datasets—that proper preference modelling significantly increases recommendation accuracy, and previously unused models outperform the traditional ones. Novel models in GFF also outperform state-of-the-art factorization algorithms. We also extend the method to be fully compliant to the Multidimensional Dataspace Model, one of the most extensive data models of context-enriched data. Extended GFF allows the seamless incorporation of information into the factorization framework beyond context, like item metadata, social networks, session information, etc. Preliminary experiments show great potential of this capability.
doi_str_mv 10.1007/s10618-015-0417-y
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1793242887</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3947248481</sourcerecordid><originalsourceid>FETCH-LOGICAL-c419t-6bf03f3c609b627083c5252b35f2d8311bf327d37d436c421568a79db17b8c083</originalsourceid><addsrcrecordid>eNp1kEtLAzEUhYMoWB8_wN2AGzfRm2TymGUpWoWCGwV3IZNJZOrMpCZTav31ptaFCK7uWXzncPkQuiBwTQDkTSIgiMJAOIaSSLw9QBPCJcOSi5fDnJkqMVcEjtFJSksA4JTBBE3nbnDRdIU3dgyx_TRjG4bCR9O7TYhvhQ-xsGEY3ceIzcZEV0RnQ9-7oflG0xk68qZL7vznnqLnu9un2T1ePM4fZtMFtiWpRixqD8wzK6CqBZWgmOWU05pxTxvFCKk9o7JhsimZsCUlXCgjq6YmslY246foar-7iuF97dKo-zZZ13VmcGGdNJEVoyVVSmb08g-6DOs45O8yJUoQ2ZDIFNlTNoaUovN6FdvexK0moHdS9V6qzlL1Tqre5g7dd1Jmh1cXfy3_W_oC7A95cg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1764064176</pqid></control><display><type>article</type><title>General factorization framework for context-aware recommendations</title><source>SpringerLink Journals - AutoHoldings</source><creator>Hidasi, Balázs ; Tikk, Domonkos</creator><creatorcontrib>Hidasi, Balázs ; Tikk, Domonkos</creatorcontrib><description>Context-aware recommendation algorithms focus on refining recommendations by considering additional information, available to the system. This topic has gained a lot of attention recently. Among others, several factorization methods were proposed to solve the problem, although most of them assume explicit feedback which strongly limits their real-world applicability. While these algorithms apply various loss functions and optimization strategies, the preference modeling under context is less explored due to the lack of tools allowing for easy experimentation with various models. As context dimensions are introduced beyond users and items, the space of possible preference models and the importance of proper modeling largely increases. In this paper we propose a general factorization framework (GFF), a single flexible algorithm that takes the preference model as an input and computes latent feature matrices for the input dimensions. GFF allows us to easily experiment with various linear models on any context-aware recommendation task, be it explicit or implicit feedback based. The scaling properties makes it usable under real life circumstances as well. We demonstrate the framework’s potential by exploring various preference models on a 4-dimensional context-aware problem with contexts that are available for almost any real life datasets. We show in our experiments—performed on five real life, implicit feedback datasets—that proper preference modelling significantly increases recommendation accuracy, and previously unused models outperform the traditional ones. Novel models in GFF also outperform state-of-the-art factorization algorithms. We also extend the method to be fully compliant to the Multidimensional Dataspace Model, one of the most extensive data models of context-enriched data. Extended GFF allows the seamless incorporation of information into the factorization framework beyond context, like item metadata, social networks, session information, etc. Preliminary experiments show great potential of this capability.</description><identifier>ISSN: 1384-5810</identifier><identifier>EISSN: 1573-756X</identifier><identifier>DOI: 10.1007/s10618-015-0417-y</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Ambient intelligence ; Artificial Intelligence ; Chemistry and Earth Sciences ; Collaboration ; Computer Science ; Data mining ; Data Mining and Knowledge Discovery ; Experiments ; Factorization ; Feedback ; Information Storage and Retrieval ; Mathematical analysis ; Optimization ; Physics ; Preferences ; Recommendations ; Recommender systems ; Social networks ; State of the art ; Statistics for Engineering</subject><ispartof>Data mining and knowledge discovery, 2016-03, Vol.30 (2), p.342-371</ispartof><rights>The Author(s) 2015</rights><rights>The Author(s) 2016</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c419t-6bf03f3c609b627083c5252b35f2d8311bf327d37d436c421568a79db17b8c083</citedby><cites>FETCH-LOGICAL-c419t-6bf03f3c609b627083c5252b35f2d8311bf327d37d436c421568a79db17b8c083</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10618-015-0417-y$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10618-015-0417-y$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27922,27923,41486,42555,51317</link.rule.ids></links><search><creatorcontrib>Hidasi, Balázs</creatorcontrib><creatorcontrib>Tikk, Domonkos</creatorcontrib><title>General factorization framework for context-aware recommendations</title><title>Data mining and knowledge discovery</title><addtitle>Data Min Knowl Disc</addtitle><description>Context-aware recommendation algorithms focus on refining recommendations by considering additional information, available to the system. This topic has gained a lot of attention recently. Among others, several factorization methods were proposed to solve the problem, although most of them assume explicit feedback which strongly limits their real-world applicability. While these algorithms apply various loss functions and optimization strategies, the preference modeling under context is less explored due to the lack of tools allowing for easy experimentation with various models. As context dimensions are introduced beyond users and items, the space of possible preference models and the importance of proper modeling largely increases. In this paper we propose a general factorization framework (GFF), a single flexible algorithm that takes the preference model as an input and computes latent feature matrices for the input dimensions. GFF allows us to easily experiment with various linear models on any context-aware recommendation task, be it explicit or implicit feedback based. The scaling properties makes it usable under real life circumstances as well. We demonstrate the framework’s potential by exploring various preference models on a 4-dimensional context-aware problem with contexts that are available for almost any real life datasets. We show in our experiments—performed on five real life, implicit feedback datasets—that proper preference modelling significantly increases recommendation accuracy, and previously unused models outperform the traditional ones. Novel models in GFF also outperform state-of-the-art factorization algorithms. We also extend the method to be fully compliant to the Multidimensional Dataspace Model, one of the most extensive data models of context-enriched data. Extended GFF allows the seamless incorporation of information into the factorization framework beyond context, like item metadata, social networks, session information, etc. Preliminary experiments show great potential of this capability.</description><subject>Algorithms</subject><subject>Ambient intelligence</subject><subject>Artificial Intelligence</subject><subject>Chemistry and Earth Sciences</subject><subject>Collaboration</subject><subject>Computer Science</subject><subject>Data mining</subject><subject>Data Mining and Knowledge Discovery</subject><subject>Experiments</subject><subject>Factorization</subject><subject>Feedback</subject><subject>Information Storage and Retrieval</subject><subject>Mathematical analysis</subject><subject>Optimization</subject><subject>Physics</subject><subject>Preferences</subject><subject>Recommendations</subject><subject>Recommender systems</subject><subject>Social networks</subject><subject>State of the art</subject><subject>Statistics for Engineering</subject><issn>1384-5810</issn><issn>1573-756X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp1kEtLAzEUhYMoWB8_wN2AGzfRm2TymGUpWoWCGwV3IZNJZOrMpCZTav31ptaFCK7uWXzncPkQuiBwTQDkTSIgiMJAOIaSSLw9QBPCJcOSi5fDnJkqMVcEjtFJSksA4JTBBE3nbnDRdIU3dgyx_TRjG4bCR9O7TYhvhQ-xsGEY3ceIzcZEV0RnQ9-7oflG0xk68qZL7vznnqLnu9un2T1ePM4fZtMFtiWpRixqD8wzK6CqBZWgmOWU05pxTxvFCKk9o7JhsimZsCUlXCgjq6YmslY246foar-7iuF97dKo-zZZ13VmcGGdNJEVoyVVSmb08g-6DOs45O8yJUoQ2ZDIFNlTNoaUovN6FdvexK0moHdS9V6qzlL1Tqre5g7dd1Jmh1cXfy3_W_oC7A95cg</recordid><startdate>20160301</startdate><enddate>20160301</enddate><creator>Hidasi, Balázs</creator><creator>Tikk, Domonkos</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20160301</creationdate><title>General factorization framework for context-aware recommendations</title><author>Hidasi, Balázs ; Tikk, Domonkos</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c419t-6bf03f3c609b627083c5252b35f2d8311bf327d37d436c421568a79db17b8c083</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Ambient intelligence</topic><topic>Artificial Intelligence</topic><topic>Chemistry and Earth Sciences</topic><topic>Collaboration</topic><topic>Computer Science</topic><topic>Data mining</topic><topic>Data Mining and Knowledge Discovery</topic><topic>Experiments</topic><topic>Factorization</topic><topic>Feedback</topic><topic>Information Storage and Retrieval</topic><topic>Mathematical analysis</topic><topic>Optimization</topic><topic>Physics</topic><topic>Preferences</topic><topic>Recommendations</topic><topic>Recommender systems</topic><topic>Social networks</topic><topic>State of the art</topic><topic>Statistics for Engineering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hidasi, Balázs</creatorcontrib><creatorcontrib>Tikk, Domonkos</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Research Library</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Data mining and knowledge discovery</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hidasi, Balázs</au><au>Tikk, Domonkos</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>General factorization framework for context-aware recommendations</atitle><jtitle>Data mining and knowledge discovery</jtitle><stitle>Data Min Knowl Disc</stitle><date>2016-03-01</date><risdate>2016</risdate><volume>30</volume><issue>2</issue><spage>342</spage><epage>371</epage><pages>342-371</pages><issn>1384-5810</issn><eissn>1573-756X</eissn><abstract>Context-aware recommendation algorithms focus on refining recommendations by considering additional information, available to the system. This topic has gained a lot of attention recently. Among others, several factorization methods were proposed to solve the problem, although most of them assume explicit feedback which strongly limits their real-world applicability. While these algorithms apply various loss functions and optimization strategies, the preference modeling under context is less explored due to the lack of tools allowing for easy experimentation with various models. As context dimensions are introduced beyond users and items, the space of possible preference models and the importance of proper modeling largely increases. In this paper we propose a general factorization framework (GFF), a single flexible algorithm that takes the preference model as an input and computes latent feature matrices for the input dimensions. GFF allows us to easily experiment with various linear models on any context-aware recommendation task, be it explicit or implicit feedback based. The scaling properties makes it usable under real life circumstances as well. We demonstrate the framework’s potential by exploring various preference models on a 4-dimensional context-aware problem with contexts that are available for almost any real life datasets. We show in our experiments—performed on five real life, implicit feedback datasets—that proper preference modelling significantly increases recommendation accuracy, and previously unused models outperform the traditional ones. Novel models in GFF also outperform state-of-the-art factorization algorithms. We also extend the method to be fully compliant to the Multidimensional Dataspace Model, one of the most extensive data models of context-enriched data. Extended GFF allows the seamless incorporation of information into the factorization framework beyond context, like item metadata, social networks, session information, etc. Preliminary experiments show great potential of this capability.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10618-015-0417-y</doi><tpages>30</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1384-5810
ispartof Data mining and knowledge discovery, 2016-03, Vol.30 (2), p.342-371
issn 1384-5810
1573-756X
language eng
recordid cdi_proquest_miscellaneous_1793242887
source SpringerLink Journals - AutoHoldings
subjects Algorithms
Ambient intelligence
Artificial Intelligence
Chemistry and Earth Sciences
Collaboration
Computer Science
Data mining
Data Mining and Knowledge Discovery
Experiments
Factorization
Feedback
Information Storage and Retrieval
Mathematical analysis
Optimization
Physics
Preferences
Recommendations
Recommender systems
Social networks
State of the art
Statistics for Engineering
title General factorization framework for context-aware recommendations
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T21%3A18%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=General%20factorization%20framework%20for%20context-aware%20recommendations&rft.jtitle=Data%20mining%20and%20knowledge%20discovery&rft.au=Hidasi,%20Bal%C3%A1zs&rft.date=2016-03-01&rft.volume=30&rft.issue=2&rft.spage=342&rft.epage=371&rft.pages=342-371&rft.issn=1384-5810&rft.eissn=1573-756X&rft_id=info:doi/10.1007/s10618-015-0417-y&rft_dat=%3Cproquest_cross%3E3947248481%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1764064176&rft_id=info:pmid/&rfr_iscdi=true