New interest-sensitive and network-sensitive method for user recommendation
A new hybrid approach by incorporatin gusers’ interests and users’ friendships together to recommend new friends for target users is proposed.A variation of PageRank—Topic_Friend_PageRank(TFPR) is proposed,which can consider user interests and user friends at same time.Firstly,proposed method uses l...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2015-02-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015040/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539676186345472 |
|---|---|
| author | Yan-min SHANG Peng ZHANG Ya-nan CAO |
| author_facet | Yan-min SHANG Peng ZHANG Ya-nan CAO |
| author_sort | Yan-min SHANG |
| collection | DOAJ |
| description | A new hybrid approach by incorporatin gusers’ interests and users’ friendships together to recommend new friends for target users is proposed.A variation of PageRank—Topic_Friend_PageRank(TFPR) is proposed,which can consider user interests and user friends at same time.Firstly,proposed method uses latent Dirichlet allocation (LDA) to model users’ interests,and weighted-PageRank algorithm to model users’ friendship network,and then merge these two factors into TFPR.This hybrid method models users’ interests and users’ friendships at the same time,and wedemonstrate the effectiveness of proposed hybrid model by using some social network datasets. |
| format | Article |
| id | doaj-art-a9608dc3679e414a921b405d02f7cab5 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2015-02-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-a9608dc3679e414a921b405d02f7cab52025-01-14T06:45:58ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2015-02-013611712559691730New interest-sensitive and network-sensitive method for user recommendationYan-min SHANGPeng ZHANGYa-nan CAOA new hybrid approach by incorporatin gusers’ interests and users’ friendships together to recommend new friends for target users is proposed.A variation of PageRank—Topic_Friend_PageRank(TFPR) is proposed,which can consider user interests and user friends at same time.Firstly,proposed method uses latent Dirichlet allocation (LDA) to model users’ interests,and weighted-PageRank algorithm to model users’ friendship network,and then merge these two factors into TFPR.This hybrid method models users’ interests and users’ friendships at the same time,and wedemonstrate the effectiveness of proposed hybrid model by using some social network datasets.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015040/social networkfriendshiptopic modelPageRank algorithm |
| spellingShingle | Yan-min SHANG Peng ZHANG Ya-nan CAO New interest-sensitive and network-sensitive method for user recommendation Tongxin xuebao social network friendship topic model PageRank algorithm |
| title | New interest-sensitive and network-sensitive method for user recommendation |
| title_full | New interest-sensitive and network-sensitive method for user recommendation |
| title_fullStr | New interest-sensitive and network-sensitive method for user recommendation |
| title_full_unstemmed | New interest-sensitive and network-sensitive method for user recommendation |
| title_short | New interest-sensitive and network-sensitive method for user recommendation |
| title_sort | new interest sensitive and network sensitive method for user recommendation |
| topic | social network friendship topic model PageRank algorithm |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015040/ |
| work_keys_str_mv | AT yanminshang newinterestsensitiveandnetworksensitivemethodforuserrecommendation AT pengzhang newinterestsensitiveandnetworksensitivemethodforuserrecommendation AT yanancao newinterestsensitiveandnetworksensitivemethodforuserrecommendation |