A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique
Abstract Personalized recommender systems are the most effective way to solve the problem of information overload. The majority of traditional personalized recommender systems employ the collaborative filtering (CF) approach. CF leverages users’ behaviors to infer a target user’s preference for a pa...
Ausführliche Beschreibung
Autor*in: |
Xiao, Yingyuan [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2018 |
---|
Schlagwörter: |
---|
Anmerkung: |
© Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
---|
Übergeordnetes Werk: |
Enthalten in: Soft computing - Springer Berlin Heidelberg, 1997, 22(2018), 20 vom: 07. Aug., Seite 6785-6796 |
---|---|
Übergeordnetes Werk: |
volume:22 ; year:2018 ; number:20 ; day:07 ; month:08 ; pages:6785-6796 |
Links: |
---|
DOI / URN: |
10.1007/s00500-018-3406-4 |
---|
Katalog-ID: |
OLC2034892976 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | OLC2034892976 | ||
003 | DE-627 | ||
005 | 20230502111855.0 | ||
007 | tu | ||
008 | 200820s2018 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1007/s00500-018-3406-4 |2 doi | |
035 | |a (DE-627)OLC2034892976 | ||
035 | |a (DE-He213)s00500-018-3406-4-p | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |q VZ |
082 | 0 | 4 | |a 004 |q VZ |
084 | |a 11 |2 ssgn | ||
100 | 1 | |a Xiao, Yingyuan |e verfasserin |4 aut | |
245 | 1 | 0 | |a A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique |
264 | 1 | |c 2018 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
338 | |a Band |b nc |2 rdacarrier | ||
500 | |a © Springer-Verlag GmbH Germany, part of Springer Nature 2018 | ||
520 | |a Abstract Personalized recommender systems are the most effective way to solve the problem of information overload. The majority of traditional personalized recommender systems employ the collaborative filtering (CF) approach. CF leverages users’ behaviors to infer a target user’s preference for a particular item, while ignores the fact that users interact with the system within a particular context, such as a particular time interval or location. In this paper, we propose a novel time-sensitive personalized recommendation method called TSPR for movie recommendation. Specifically, we first define and construct a new user–context rating matrix based on the original user–movie rating matrix and then propose a novel context-dependent similarity measurement by mining the implicit relationship among users from the user–context rating matrix. Further, we build a context-dependent similarity matrix based on the context-dependent similarity measurement. Finally, we incorporate the context-dependent similarity matrix into the probabilistic matrix factorization model. The experimental results show that TSPR performs much better than the state-of-the-art recommendation methods. | ||
650 | 4 | |a Personalized recommendation | |
650 | 4 | |a Matrix factorization | |
650 | 4 | |a Context-dependent similarity measurement | |
650 | 4 | |a Context | |
700 | 1 | |a Wang, Gaowei |4 aut | |
700 | 1 | |a Hsu, Ching-Hsien |4 aut | |
700 | 1 | |a Wang, Hongya |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Soft computing |d Springer Berlin Heidelberg, 1997 |g 22(2018), 20 vom: 07. Aug., Seite 6785-6796 |w (DE-627)231970536 |w (DE-600)1387526-7 |w (DE-576)060238259 |x 1432-7643 |7 nnns |
773 | 1 | 8 | |g volume:22 |g year:2018 |g number:20 |g day:07 |g month:08 |g pages:6785-6796 |
856 | 4 | 1 | |u https://doi.org/10.1007/s00500-018-3406-4 |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-MAT | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_267 | ||
912 | |a GBV_ILN_2018 | ||
912 | |a GBV_ILN_4277 | ||
951 | |a AR | ||
952 | |d 22 |j 2018 |e 20 |b 07 |c 08 |h 6785-6796 |
author_variant |
y x yx g w gw c h h chh h w hw |
---|---|
matchkey_str |
article:14327643:2018----::tmsniieesnlzdeomnainehdaeopoaiitca |
hierarchy_sort_str |
2018 |
publishDate |
2018 |
allfields |
10.1007/s00500-018-3406-4 doi (DE-627)OLC2034892976 (DE-He213)s00500-018-3406-4-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Xiao, Yingyuan verfasserin aut A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Personalized recommender systems are the most effective way to solve the problem of information overload. The majority of traditional personalized recommender systems employ the collaborative filtering (CF) approach. CF leverages users’ behaviors to infer a target user’s preference for a particular item, while ignores the fact that users interact with the system within a particular context, such as a particular time interval or location. In this paper, we propose a novel time-sensitive personalized recommendation method called TSPR for movie recommendation. Specifically, we first define and construct a new user–context rating matrix based on the original user–movie rating matrix and then propose a novel context-dependent similarity measurement by mining the implicit relationship among users from the user–context rating matrix. Further, we build a context-dependent similarity matrix based on the context-dependent similarity measurement. Finally, we incorporate the context-dependent similarity matrix into the probabilistic matrix factorization model. The experimental results show that TSPR performs much better than the state-of-the-art recommendation methods. Personalized recommendation Matrix factorization Context-dependent similarity measurement Context Wang, Gaowei aut Hsu, Ching-Hsien aut Wang, Hongya aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 22(2018), 20 vom: 07. Aug., Seite 6785-6796 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:22 year:2018 number:20 day:07 month:08 pages:6785-6796 https://doi.org/10.1007/s00500-018-3406-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 22 2018 20 07 08 6785-6796 |
spelling |
10.1007/s00500-018-3406-4 doi (DE-627)OLC2034892976 (DE-He213)s00500-018-3406-4-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Xiao, Yingyuan verfasserin aut A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Personalized recommender systems are the most effective way to solve the problem of information overload. The majority of traditional personalized recommender systems employ the collaborative filtering (CF) approach. CF leverages users’ behaviors to infer a target user’s preference for a particular item, while ignores the fact that users interact with the system within a particular context, such as a particular time interval or location. In this paper, we propose a novel time-sensitive personalized recommendation method called TSPR for movie recommendation. Specifically, we first define and construct a new user–context rating matrix based on the original user–movie rating matrix and then propose a novel context-dependent similarity measurement by mining the implicit relationship among users from the user–context rating matrix. Further, we build a context-dependent similarity matrix based on the context-dependent similarity measurement. Finally, we incorporate the context-dependent similarity matrix into the probabilistic matrix factorization model. The experimental results show that TSPR performs much better than the state-of-the-art recommendation methods. Personalized recommendation Matrix factorization Context-dependent similarity measurement Context Wang, Gaowei aut Hsu, Ching-Hsien aut Wang, Hongya aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 22(2018), 20 vom: 07. Aug., Seite 6785-6796 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:22 year:2018 number:20 day:07 month:08 pages:6785-6796 https://doi.org/10.1007/s00500-018-3406-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 22 2018 20 07 08 6785-6796 |
allfields_unstemmed |
10.1007/s00500-018-3406-4 doi (DE-627)OLC2034892976 (DE-He213)s00500-018-3406-4-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Xiao, Yingyuan verfasserin aut A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Personalized recommender systems are the most effective way to solve the problem of information overload. The majority of traditional personalized recommender systems employ the collaborative filtering (CF) approach. CF leverages users’ behaviors to infer a target user’s preference for a particular item, while ignores the fact that users interact with the system within a particular context, such as a particular time interval or location. In this paper, we propose a novel time-sensitive personalized recommendation method called TSPR for movie recommendation. Specifically, we first define and construct a new user–context rating matrix based on the original user–movie rating matrix and then propose a novel context-dependent similarity measurement by mining the implicit relationship among users from the user–context rating matrix. Further, we build a context-dependent similarity matrix based on the context-dependent similarity measurement. Finally, we incorporate the context-dependent similarity matrix into the probabilistic matrix factorization model. The experimental results show that TSPR performs much better than the state-of-the-art recommendation methods. Personalized recommendation Matrix factorization Context-dependent similarity measurement Context Wang, Gaowei aut Hsu, Ching-Hsien aut Wang, Hongya aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 22(2018), 20 vom: 07. Aug., Seite 6785-6796 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:22 year:2018 number:20 day:07 month:08 pages:6785-6796 https://doi.org/10.1007/s00500-018-3406-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 22 2018 20 07 08 6785-6796 |
allfieldsGer |
10.1007/s00500-018-3406-4 doi (DE-627)OLC2034892976 (DE-He213)s00500-018-3406-4-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Xiao, Yingyuan verfasserin aut A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Personalized recommender systems are the most effective way to solve the problem of information overload. The majority of traditional personalized recommender systems employ the collaborative filtering (CF) approach. CF leverages users’ behaviors to infer a target user’s preference for a particular item, while ignores the fact that users interact with the system within a particular context, such as a particular time interval or location. In this paper, we propose a novel time-sensitive personalized recommendation method called TSPR for movie recommendation. Specifically, we first define and construct a new user–context rating matrix based on the original user–movie rating matrix and then propose a novel context-dependent similarity measurement by mining the implicit relationship among users from the user–context rating matrix. Further, we build a context-dependent similarity matrix based on the context-dependent similarity measurement. Finally, we incorporate the context-dependent similarity matrix into the probabilistic matrix factorization model. The experimental results show that TSPR performs much better than the state-of-the-art recommendation methods. Personalized recommendation Matrix factorization Context-dependent similarity measurement Context Wang, Gaowei aut Hsu, Ching-Hsien aut Wang, Hongya aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 22(2018), 20 vom: 07. Aug., Seite 6785-6796 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:22 year:2018 number:20 day:07 month:08 pages:6785-6796 https://doi.org/10.1007/s00500-018-3406-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 22 2018 20 07 08 6785-6796 |
allfieldsSound |
10.1007/s00500-018-3406-4 doi (DE-627)OLC2034892976 (DE-He213)s00500-018-3406-4-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Xiao, Yingyuan verfasserin aut A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Personalized recommender systems are the most effective way to solve the problem of information overload. The majority of traditional personalized recommender systems employ the collaborative filtering (CF) approach. CF leverages users’ behaviors to infer a target user’s preference for a particular item, while ignores the fact that users interact with the system within a particular context, such as a particular time interval or location. In this paper, we propose a novel time-sensitive personalized recommendation method called TSPR for movie recommendation. Specifically, we first define and construct a new user–context rating matrix based on the original user–movie rating matrix and then propose a novel context-dependent similarity measurement by mining the implicit relationship among users from the user–context rating matrix. Further, we build a context-dependent similarity matrix based on the context-dependent similarity measurement. Finally, we incorporate the context-dependent similarity matrix into the probabilistic matrix factorization model. The experimental results show that TSPR performs much better than the state-of-the-art recommendation methods. Personalized recommendation Matrix factorization Context-dependent similarity measurement Context Wang, Gaowei aut Hsu, Ching-Hsien aut Wang, Hongya aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 22(2018), 20 vom: 07. Aug., Seite 6785-6796 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:22 year:2018 number:20 day:07 month:08 pages:6785-6796 https://doi.org/10.1007/s00500-018-3406-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 22 2018 20 07 08 6785-6796 |
language |
English |
source |
Enthalten in Soft computing 22(2018), 20 vom: 07. Aug., Seite 6785-6796 volume:22 year:2018 number:20 day:07 month:08 pages:6785-6796 |
sourceStr |
Enthalten in Soft computing 22(2018), 20 vom: 07. Aug., Seite 6785-6796 volume:22 year:2018 number:20 day:07 month:08 pages:6785-6796 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Personalized recommendation Matrix factorization Context-dependent similarity measurement Context |
dewey-raw |
004 |
isfreeaccess_bool |
false |
container_title |
Soft computing |
authorswithroles_txt_mv |
Xiao, Yingyuan @@aut@@ Wang, Gaowei @@aut@@ Hsu, Ching-Hsien @@aut@@ Wang, Hongya @@aut@@ |
publishDateDaySort_date |
2018-08-07T00:00:00Z |
hierarchy_top_id |
231970536 |
dewey-sort |
14 |
id |
OLC2034892976 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2034892976</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502111855.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2018 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-018-3406-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2034892976</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00500-018-3406-4-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Xiao, Yingyuan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag GmbH Germany, part of Springer Nature 2018</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Personalized recommender systems are the most effective way to solve the problem of information overload. The majority of traditional personalized recommender systems employ the collaborative filtering (CF) approach. CF leverages users’ behaviors to infer a target user’s preference for a particular item, while ignores the fact that users interact with the system within a particular context, such as a particular time interval or location. In this paper, we propose a novel time-sensitive personalized recommendation method called TSPR for movie recommendation. Specifically, we first define and construct a new user–context rating matrix based on the original user–movie rating matrix and then propose a novel context-dependent similarity measurement by mining the implicit relationship among users from the user–context rating matrix. Further, we build a context-dependent similarity matrix based on the context-dependent similarity measurement. Finally, we incorporate the context-dependent similarity matrix into the probabilistic matrix factorization model. The experimental results show that TSPR performs much better than the state-of-the-art recommendation methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Personalized recommendation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matrix factorization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Context-dependent similarity measurement</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Context</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Gaowei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hsu, Ching-Hsien</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Hongya</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft computing</subfield><subfield code="d">Springer Berlin Heidelberg, 1997</subfield><subfield code="g">22(2018), 20 vom: 07. Aug., Seite 6785-6796</subfield><subfield code="w">(DE-627)231970536</subfield><subfield code="w">(DE-600)1387526-7</subfield><subfield code="w">(DE-576)060238259</subfield><subfield code="x">1432-7643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:22</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:20</subfield><subfield code="g">day:07</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:6785-6796</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00500-018-3406-4</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">22</subfield><subfield code="j">2018</subfield><subfield code="e">20</subfield><subfield code="b">07</subfield><subfield code="c">08</subfield><subfield code="h">6785-6796</subfield></datafield></record></collection>
|
author |
Xiao, Yingyuan |
spellingShingle |
Xiao, Yingyuan ddc 004 ssgn 11 misc Personalized recommendation misc Matrix factorization misc Context-dependent similarity measurement misc Context A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique |
authorStr |
Xiao, Yingyuan |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)231970536 |
format |
Article |
dewey-ones |
004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut aut aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
1432-7643 |
topic_title |
004 VZ 11 ssgn A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique Personalized recommendation Matrix factorization Context-dependent similarity measurement Context |
topic |
ddc 004 ssgn 11 misc Personalized recommendation misc Matrix factorization misc Context-dependent similarity measurement misc Context |
topic_unstemmed |
ddc 004 ssgn 11 misc Personalized recommendation misc Matrix factorization misc Context-dependent similarity measurement misc Context |
topic_browse |
ddc 004 ssgn 11 misc Personalized recommendation misc Matrix factorization misc Context-dependent similarity measurement misc Context |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
hierarchy_parent_title |
Soft computing |
hierarchy_parent_id |
231970536 |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Soft computing |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 |
title |
A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique |
ctrlnum |
(DE-627)OLC2034892976 (DE-He213)s00500-018-3406-4-p |
title_full |
A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique |
author_sort |
Xiao, Yingyuan |
journal |
Soft computing |
journalStr |
Soft computing |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2018 |
contenttype_str_mv |
txt |
container_start_page |
6785 |
author_browse |
Xiao, Yingyuan Wang, Gaowei Hsu, Ching-Hsien Wang, Hongya |
container_volume |
22 |
class |
004 VZ 11 ssgn |
format_se |
Aufsätze |
author-letter |
Xiao, Yingyuan |
doi_str_mv |
10.1007/s00500-018-3406-4 |
dewey-full |
004 |
title_sort |
a time-sensitive personalized recommendation method based on probabilistic matrix factorization technique |
title_auth |
A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique |
abstract |
Abstract Personalized recommender systems are the most effective way to solve the problem of information overload. The majority of traditional personalized recommender systems employ the collaborative filtering (CF) approach. CF leverages users’ behaviors to infer a target user’s preference for a particular item, while ignores the fact that users interact with the system within a particular context, such as a particular time interval or location. In this paper, we propose a novel time-sensitive personalized recommendation method called TSPR for movie recommendation. Specifically, we first define and construct a new user–context rating matrix based on the original user–movie rating matrix and then propose a novel context-dependent similarity measurement by mining the implicit relationship among users from the user–context rating matrix. Further, we build a context-dependent similarity matrix based on the context-dependent similarity measurement. Finally, we incorporate the context-dependent similarity matrix into the probabilistic matrix factorization model. The experimental results show that TSPR performs much better than the state-of-the-art recommendation methods. © Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
abstractGer |
Abstract Personalized recommender systems are the most effective way to solve the problem of information overload. The majority of traditional personalized recommender systems employ the collaborative filtering (CF) approach. CF leverages users’ behaviors to infer a target user’s preference for a particular item, while ignores the fact that users interact with the system within a particular context, such as a particular time interval or location. In this paper, we propose a novel time-sensitive personalized recommendation method called TSPR for movie recommendation. Specifically, we first define and construct a new user–context rating matrix based on the original user–movie rating matrix and then propose a novel context-dependent similarity measurement by mining the implicit relationship among users from the user–context rating matrix. Further, we build a context-dependent similarity matrix based on the context-dependent similarity measurement. Finally, we incorporate the context-dependent similarity matrix into the probabilistic matrix factorization model. The experimental results show that TSPR performs much better than the state-of-the-art recommendation methods. © Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
abstract_unstemmed |
Abstract Personalized recommender systems are the most effective way to solve the problem of information overload. The majority of traditional personalized recommender systems employ the collaborative filtering (CF) approach. CF leverages users’ behaviors to infer a target user’s preference for a particular item, while ignores the fact that users interact with the system within a particular context, such as a particular time interval or location. In this paper, we propose a novel time-sensitive personalized recommendation method called TSPR for movie recommendation. Specifically, we first define and construct a new user–context rating matrix based on the original user–movie rating matrix and then propose a novel context-dependent similarity measurement by mining the implicit relationship among users from the user–context rating matrix. Further, we build a context-dependent similarity matrix based on the context-dependent similarity measurement. Finally, we incorporate the context-dependent similarity matrix into the probabilistic matrix factorization model. The experimental results show that TSPR performs much better than the state-of-the-art recommendation methods. © Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 |
container_issue |
20 |
title_short |
A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique |
url |
https://doi.org/10.1007/s00500-018-3406-4 |
remote_bool |
false |
author2 |
Wang, Gaowei Hsu, Ching-Hsien Wang, Hongya |
author2Str |
Wang, Gaowei Hsu, Ching-Hsien Wang, Hongya |
ppnlink |
231970536 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s00500-018-3406-4 |
up_date |
2024-07-03T22:53:41.819Z |
_version_ |
1803600235714314240 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2034892976</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502111855.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2018 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-018-3406-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2034892976</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00500-018-3406-4-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Xiao, Yingyuan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A time-sensitive personalized recommendation method based on probabilistic matrix factorization technique</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag GmbH Germany, part of Springer Nature 2018</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Personalized recommender systems are the most effective way to solve the problem of information overload. The majority of traditional personalized recommender systems employ the collaborative filtering (CF) approach. CF leverages users’ behaviors to infer a target user’s preference for a particular item, while ignores the fact that users interact with the system within a particular context, such as a particular time interval or location. In this paper, we propose a novel time-sensitive personalized recommendation method called TSPR for movie recommendation. Specifically, we first define and construct a new user–context rating matrix based on the original user–movie rating matrix and then propose a novel context-dependent similarity measurement by mining the implicit relationship among users from the user–context rating matrix. Further, we build a context-dependent similarity matrix based on the context-dependent similarity measurement. Finally, we incorporate the context-dependent similarity matrix into the probabilistic matrix factorization model. The experimental results show that TSPR performs much better than the state-of-the-art recommendation methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Personalized recommendation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matrix factorization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Context-dependent similarity measurement</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Context</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Gaowei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hsu, Ching-Hsien</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Hongya</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft computing</subfield><subfield code="d">Springer Berlin Heidelberg, 1997</subfield><subfield code="g">22(2018), 20 vom: 07. Aug., Seite 6785-6796</subfield><subfield code="w">(DE-627)231970536</subfield><subfield code="w">(DE-600)1387526-7</subfield><subfield code="w">(DE-576)060238259</subfield><subfield code="x">1432-7643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:22</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:20</subfield><subfield code="g">day:07</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:6785-6796</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00500-018-3406-4</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">22</subfield><subfield code="j">2018</subfield><subfield code="e">20</subfield><subfield code="b">07</subfield><subfield code="c">08</subfield><subfield code="h">6785-6796</subfield></datafield></record></collection>
|
score |
7.400193 |