Please wait a minute...
Advanced Search
数据分析与知识发现  2018, Vol. 2 Issue (7): 63-71     https://doi.org/10.11925/infotech.2096-3467.2018.0179
  研究论文 本期目录 | 过刊浏览 | 高级检索 |
基于不确定近邻的旅游产品协同过滤推荐算法研究*
赵雅楠1(), 王育清2
1同济大学经济与管理学院 上海 200092
2上海理工大学经济与管理学院 上海 200093
Research on Collaborative Filtering Traveling Products Recommendation Algorithm Based on IUNCF
Zhao Ya’nan1(), Wang Yuqing2
1School of Economics and Management, Tongji University, Shanghai 200092, China
2School of Economics and Management, University of Shanghai for Science and Technology, Shanghai 200093, China
全文: PDF (1378 KB)   HTML ( 2
输出: BibTeX | EndNote (RIS)      
摘要 

目的】解决传统协同推荐技术在智慧旅游产业运用中的数据稀疏性、冷启动等问题。【方法】结合基于用户和基于内容的协同推荐技术, 对用户进行K-means聚类后动态分类筛选, 为推荐类型分配权重, 提出基于不确定近邻的旅游产品协同过滤推荐算法IUNCF。【结果】基于不同相似性阈值和推荐数目对真实旅游数据进行算法检验, 实验结果表明, IUNCF算法的MAE值和F指标分别达到0.243和0.764, IUNCF可提高旅游产品推荐的准确度和有效性。【局限】IUNCF算法应针对现阶段消费低频性等特点进一步优化, 并扩展运用范围。【结论】IUNCF算法在对用户精准推荐智慧旅游产品领域具有较高价值。

服务
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章
赵雅楠
王育清
关键词 旅游推荐不确定近邻相似性阈值协同推荐    
Abstract

[Objective] This paper tries to address the challenges facing Smart Tourism industry, such as data sparseness and cold start, with the help of collaborative recommendation technology. [Methods] First, we clustered users with the K-means algorithm and then filtered and classified them dynamically based on the combination of collaborative recommendation technology. Then, we assigned weight to the recommended types and proposed a new algorithm based on Improved Uncertain Neighbors Collaborative Filtering (IUNCF). Finally, we examined the proposed algorithm with real world tourism data of different similarity thresholds and recommended numbers. [Results] The MAE value and F-measure reached 0.243 and 0.764, which showed the effectiveness of IUNCF in accuracy and reliability. [Limitations] The IUNCF algorithm needs to be further optimized to deal with the low frequency consumption issue. We could also extend the application of this new model. [Conclusions] The proposed IUNCF algorithm could precisely recommend smart tourism products to the consumers.

Key wordsTravel Recommendations    Uncertain Neighbors    Similarity Threshold    Collaborative Recommendation
收稿日期: 2018-02-11      出版日期: 2018-08-15
ZTFLH:  TP393  
基金资助:*本文系同济大学研究生教育研究与改革项目“大数据时代背景下基于翻转课堂的教学改革研究——以公共政策为例”(项目编号: 1200104162)的研究成果之一
引用本文:   
赵雅楠, 王育清. 基于不确定近邻的旅游产品协同过滤推荐算法研究*[J]. 数据分析与知识发现, 2018, 2(7): 63-71.
Zhao Ya’nan,Wang Yuqing. Research on Collaborative Filtering Traveling Products Recommendation Algorithm Based on IUNCF. Data Analysis and Knowledge Discovery, 2018, 2(7): 63-71.
链接本文:  
https://manu44.magtech.com.cn/Jwk_infotech_wk3/CN/10.11925/infotech.2096-3467.2018.0179      或      https://manu44.magtech.com.cn/Jwk_infotech_wk3/CN/Y2018/V2/I7/63
  IUNCF算法过程及框架
I1 I2 I3 I4 I5
u 4 5 2 3 4
v 5 4
  对于用户u, 用户v没有推荐能力
I1 I2 I3 I4 I5
u 4 5 2 0 4
v 4 5 2 1 4
  对于用户u, 用户v没有推荐能力
I1 I2 I3 I4 I5
u 4 3 2 0 4
v 4 3 2 5 4
  对于用户u, 用户v有推荐能力
  原始实验数据格式
  相似性阈值对MAE的影响
  TOP-N取值的不同对F值的影响
阈值
指标
0.4 0.5 0.6 0.7 0.8 0.85 0.9 0.95
准确率 0.2743 0.2765 0.2832 0.2779 0.3276 0.3335 0.3452 0.3585
召回率 0.2284 0.2304 0.2357 0.2266 0.2972 0.3031 0.3189 0.3377
F值 0.6865 0.6912 0.7093 0.7185 0.7299 0.7413 0.7527 0.7641
  IUNCF算法下不同相似性阈值的各项指标(Top-N=20)
阈值
指标
0.4 0.5 0.6 0.7 0.8 0.85 0.9 0.95
准确率 0.2524 0.2635 0.2678 0.2702 0.2779 0.2837 0.2894 0.2952
召回率 0.2027 0.2183 0.2257 0.2239 0.2360 0.2436 0.2461 0.2519
F值 0.6687 0.6646 0.6583 0.6812 0.6760 0.6791 0.7026 0.7128
  IUNCF算法下不同相似性阈值的各项指标(Top-N=30)
  IUNCF与KCF推荐结果MAE值比较
  IUNCF与KCF推荐结果的F值比较
[1] 中国国家旅游局. 中国旅游经济蓝皮书(No.10)[M]. 北京: 中国旅游出版社, 2017.
[1] (China Tourism Institute.China Tourism Economy Blue Book No.10[M]. Beijing: China Tourism Press, 2017.)
[2] 中国国家旅游局. 2015年中国旅游经济运行分析与2016年发展预测[M]. 北京: 中国旅游出版社, 2016.
[2] (China Tourism Institute.China Tourism Economy Analysis and Forecast of Development in 2016[M]. Beijing: China Tourism Press, 2016.)
[3] Nanopoulos A, Rafailidis D, Symeonidis P, et al.Musicbox: Personalized Music Recommendation Based on Cubic Analysis of Social Tags[J]. IEEE Transactions on Audio, Speech, and Language Processing, 2010, 18(2): 407-412.
doi: 10.1109/TASL.2009.2033973
[4] Harper F M, Konstan J A.The Movielens Datasets: History and Context[J]. ACM Transactions on Interactive Intelligent Systems, 2016, 5(4): 19.
doi: 10.1145/2827872
[5] Adomavicius G, Tuzhilin A.Toward the Next Generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions[J]. IEEE Transactions on Knowledge & Data Engineering, 2005, 17(6): 734-749.
[6] Dzyabura D, Hauser J R.Recommending Products When Consumers Learn Their Preferences[J]. Social Science Electronic Publishing, 2017, 55: 45-57.
doi: 10.2139/ssrn.2202904
[7] Jia Z, Yang Y, Gao W, et al.User-based Collaborative Filtering for Tourist Attraction Recommendations[C]// Proceedings of the 2015 IEEE International Conference on Computational Intelligence & Communication Technology. 2015: 22-25.
[8] Pirasteh P, Jung J J, Hwang D.Item-based Collaborative Filtering with Attribute Correlation: A Case Study on Movie Recommendation[A]//Intelligent Information and Database Systems[M]. Springer, 2014: 245-252.
[9] Sahoo N, Singh P V, Mukhopadhyay T.A Hidden Markov Model for Collaborative Filtering[J]. MIS Quarterly, 2012, 1329-1356.
doi: 10.2139/ssrn.1700585
[10] Ziani A, Azizi N, Schwab D, et al.Recommender System Through Sentiment Analysis[C]//Proceedings of the 2nd International Conference on Automatic Control, Telecommunications and Signals. 2017.
[11] Dakhel G M, Mahdavi M.A New Collaborative Filtering Algorithm Using K-means Clustering and Neighbors’ Voting[C]// Proceedings of the 11th International Conference on Hybrid Intelligent Systems. IEEE, 2011: 179-184.
[12] 李涛, 王建东, 叶飞跃, 等. 一种基于用户聚类的协同过滤推荐算法[J]. 系统工程与电子技术, 2007, 29(7): 1178-1182.
[12] (Li Tao, Wang Jiandong, Ye Feiyue, et al.A Collaborative Filtering Recommendation Algorithm Based on User Clustering[J]. Systems Engineering and Electronics, 2007, 29(7): 1178-1182.)
[13] 赵伟, 林楠, 韩英, 等. 一种改进的K-means聚类的协同过滤算法[J]. 安徽大学学报: 自然科学版, 2016, 40(2): 32-36.
doi: 10.3969/j.issn.1000-2162.2016.02.006
[13] (Zhao Wei, Lin Nan, Han Ying, et al.User-based Collaborative Filtering Recommendation Algorithm Based on Improved K-means Clustering[J]. Journal of Anhui University: Natural Science Edition, 2016, 40(2): 32-36.)
doi: 10.3969/j.issn.1000-2162.2016.02.006
[14] Sarwar B, Karypis G, Konstan J, et al.Item-based Collaborative Filtering Recommendation Algorithms[C]// Proceedings of the 10th International Conference on World Wide Web. ACM, 2001: 285-295.
[15] 邓华平. 基于项目聚类和评分的时间加权协同过滤算法[J]. 计算机应用研究, 2015, 32(7): 1966-1969.
[15] (Deng Huaping.Time-Weighted Collaborative Filtering Algorithm Based on Item Clustering and Scoring[J]. Application Research of Computers, 2015, 32(7): 1966-1969.)
[16] 王晓耘, 钱璐, 黄时友. 基于粗糙用户聚类的协同过滤推荐模型[J]. 现代图书情报技术, 2015(1): 45-51.
[16] (Wang Xiaoyun, Qian Lu, Huang Shiyou.Collaborative Filtering Recommendation Model Based on Rough User Clustering[J]. New Technology of Library and Information Service, 2015(1): 45-51.)
[17] Nilashi M, Bin Ibrahim O, Ithnin N, et al.A Multi-criteria Collaborative Filtering Recommender System for the Tourism Domain Using Expectation Maximization (EM) and PCA-ANFIS[J]. Electronic Commerce Research and Applications, 2015, 14(6): 542-562.
[18] 黄创光, 印鉴, 汪静, 等. 不确定近邻的协同过滤推荐算法[J]. 计算机学报, 2010, 33(8): 1369-1377.
doi: 10.3724/SP.J.1016.2010.01369
[18] (Huang Chuangguang, Yin Jian, Wang Jing, et al.Collaborative Filtering Recommendation Algorithm for Uncertain Neighbors[J]. Journal of Computer, 2010, 33(8): 1369-1377.)
doi: 10.3724/SP.J.1016.2010.01369
[19] 范波, 程久军. 用户间多相似度协同过滤推荐算法[J]. 计算机科学, 2012, 39(1): 23-26.
doi: 10.3969/j.issn.1002-137X.2012.01.005
[19] (Fan Bo, Cheng Jiujun.Collaborative Filtering Recommendation Algorithm for Multiple Similarity Among Users[J]. Computer Science, 2012, 39(1): 23-26.)
doi: 10.3969/j.issn.1002-137X.2012.01.005
[20] 郑志高, 刘京, 王平, 等. 时间加权不确定近邻协同过滤算法[J]. 计算机科学, 2014, 41(8): 7-12.
doi: 10.11896/j.issn.1002-137X.2014.08.002
[20] (Zheng Zhigao, Liu Jing, Wang Ping, et al.Time Weighted Uncertain Nearest Neighbor Collaborative Filtering Algorithm[J]. Computer Science, 2014, 41(8): 7-12.)
doi: 10.11896/j.issn.1002-137X.2014.08.002
[1] 张琪, 章颖华. 情境感知的科技文献协同推荐方法研究[J]. 现代图书情报技术, 2012, 28(2): 10-17.
[2] 陈祖琴,葛继科,郑宏. 基于本体构建的协同推荐研究[J]. 现代图书情报技术, 2008, 24(9): 53-57.
[3] 颜端武,罗胜阳,成晓 . 协同推荐中基于用户-文档矩阵的用户聚类研究*[J]. 现代图书情报技术, 2007, 2(3): 25-28.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
版权所有 © 2015 《数据分析与知识发现》编辑部
地址:北京市海淀区中关村北四环西路33号 邮编:100190
电话/传真:(010)82626611-6626,82624938
E-mail:jishu@mail.las.ac.cn