Design and implementation of a user interest recommender algorithm based on improved FP-growth

PENG Hao; DIAN Song-yi

Chinese

您当前的位置：

首页 >

文章列表页 >

Design and implementation of a user interest recommender algorithm based on improved FP-growth

更新时间：2026-09-04

- Design and implementation of a user interest recommender algorithm based on improved FP-growth
- Vol. 37, Issue 2, Pages: 8-13(2020)
- 作者机构：
  
  四川大学电气信息学院,四川,成都,610065
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2020
- 稿件说明：
移动端阅览
彭浩, 佃松宜. 基于改进FP-growth的用户兴趣推荐算法的设计与实现[J]. 微电子学与计算机, 2020, 37(2): 8-13.

PENG Hao, DIAN Song-yi. Design and implementation of a user interest recommender algorithm based on improved FP-growth[J]. 2020, 37(2): 8-13.
彭浩, 佃松宜. 基于改进FP-growth的用户兴趣推荐算法的设计与实现[J]. 微电子学与计算机, 2020, 37(2): 8-13. DOI：

PENG Hao, DIAN Song-yi. Design and implementation of a user interest recommender algorithm based on improved FP-growth[J]. 2020, 37(2): 8-13. DOI：

摘要

针对一类只有用户浏览频次数据且没有项目评分的推荐系统，提出一种基于FP-Growth(频繁模式增长)改进的关联规则挖掘算法，实现用户兴趣推荐.针对传统的FP-growth进行如下改进：首先，归一化用户浏览频率，以反映用户的兴趣，并添加遗忘因子来跟踪用户兴趣迁移.其次，采用动态支持度过滤非兴趣项目，以提高推荐结果的准确性.此外，在FP-tree中引入项目活跃度作为冷启动问题的可行方案.最后收集762个用户在企业操作系统(EOS)区块链中访问智能合约的记录来测试改进的算法.实验结果表明，该算法在用户兴趣推荐方面表现令人满意.

Abstract

In this paper

a novel algorithm of mining association rules based on improved FP-growth which focuses on precise user interest recommendation

is proposed for the system without user ratings but a large amount of browsing data. The improvements based on traditional FP-growth can be particularized in the following: First of all

the frequency of user browsing is normalized and multiplied by forgetting function in order to reflect the current interest of users. Besides

dynamic support is adopted to filter out non-interest items and enhance the recommending accuracy. Moreover

activity of item (AOI) is employed as a feasible scheme in the FP-tree to solve the cold start problem. Then

the improved algorithm is verified by the browsing data of the smart contracts in the Enterprise Operation System (EOS) blockchain. The experimental results show that the improved algorithm performs satisfactory in the user interest recommendation.

关键词

Keywords

references

HAN J, PEI J, YIN Y. Mining Frequent Patterns Without Candidate Generation[C]// Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 2000: 16-18.

ESMAEILI L, NASIRI M, MINAEI-BIDGOLI B. Personalizing Group Recommendation to Social Network Users[C]// Web Information Systems and Mining - International Conference, WISM 2011, Taiyuan, China, September 2011: 24-25.

AHMED C F, TANBEER S K, JEONG B S, et al. Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases[J].IEEE Transactions on Knowledge and Data Engineering, 2009, 21(12):1708-1721. DOI: 1708

HAN J, PEI J, YIN Y. Mining Frequent Patterns Without Candidate Generation[C]// Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 2000: 16-18.

SHARIFI Z, REZGHI M, NASIRI M. A new algorithm for solving data sparsity problem based-on Non negative matrix factorization in recommender systems[C]// International Econference on Computer % Knowledge Engineering. IEEE, 2014: 56-61.

HAN Y, XIA K. Data Preprocessing Method Based on User Characteristic of Interests for Web Log Mining[C]// Fourth International Conference on Instrumentation % Measurement. IEEE, 2014: 876-872.

YU H F, HSIEH C J, SI S, et al. Scalable Coordinate Descent Approaches to Parallel Matrix Factorization for Recommender Systems[C]// 2012 IEEE 12th International Conference on Data Mining. IEEE Computer Society, 2012: 765-774.

REN Y, LI G, ZHANG J, et al. Lazy Collaborative Filtering for Data Sets With Missing Values[J]. IEEE Transactions on Cybernetics, 2013, 43(6):1822-1834. DOI: 1822

MINAEI-BIDGOLI B, ESMAEILI L, NASIRI M. Comparison of group recommendation techniques in social networks[C]// International Econference on Computer % Knowledge Engineering. IEEE, 2013: 236-241.

GRAHNE G, ZHU J. Fast Algorithms for Frequent Itemset Mining Using FP-Trees[J]. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(10):1347-1362. DOI: 1347

HAN J, PEI J, YIN Y, et al. Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach[J]. Data Mining and Knowledge Discovery, 2004, 8(1):53-87. DOI: 53

贡佳炜, 单明辉, 陈君, 等.声望模型中一种动态选择遗忘因子的方法[J].计算机工程与应用, 2009(17):23-25. DOI: 23

许海玲, 吴潇, 李晓东, 等.互联网推荐系统比较研究[J].软件学报, 2009, 20(2):350-362. DOI: 350

SEGATORI A, BECHINI A, DUCANGE P, et al. A Distributed Fuzzy Associative Classifier for Big Data[J]. IEEE Transactions on Cybernetics, 2017:1-14. DOI: 1

YE H, ZHANG Q, BAI X. A new collaborative filtering algorithm based on modified matrix factorization[J]. 2017 IEEE 2nd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC), Chongqing, 2017:147-151. DOI: 147

ZHANG C, YANG M, LV J, et al. An Improved Hybrid Collaborative Filtering Algorithm Based on Tags and Time Factor[J]. Big Data Mining and Analytics, 2018, 1(2):48-56. DOI: 48

YIN H, ZHOU X, CUI B, et al. Adapting to User Interest Drift for POI Recommendation[J]. IEEE Transactions on Knowledge and Data Engineering, 2016:1-1. DOI: 1

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Implementation and verification of a dual-chain power gating strategy for low power design

A high-efficiency charge pump for ultra-low voltage boost systems

Steganography model guided by attention mechanism and improved dense convolution

Lightweight countermeasures against Spectre attacks on the branch prediction unit

Simulation on the DC characteristics of double heterojunction p-GaN HEMT with AlN/GaN hybrid buffer layer

Related Author

No data

Related Institution

No data

AI问答

Postal code：100079
Tel：（010）53879206 Email：tmw@bjxintong.com.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09082226号-64 京公网安备11010602201714号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰