Human resource recommendation algorithm based on improved frequent itemset mining

被引:10
|
作者
Zhaoshan, Liu [1 ]
Yiming, Ma [2 ]
Huihua, Zheng [2 ]
Dege, Liu [3 ]
Jing, Liu [1 ]
机构
[1] Taishan Univ, Sch Econ & Management, Tai An 271000, Shandong, Peoples R China
[2] Nueva Ecija Univ Sci & Technol, Grad Sch, Cabanatuan 3100, Philippines
[3] Guangzhou Univ, Sch Management, Guangzhou 510006, Peoples R China
关键词
Improved frequent itemset; Human resource; Recommendation algorithm; Data loss; PMF model; Implicit feature;
D O I
10.1016/j.future.2021.08.017
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
There are large personalized differences among human resources, and the resource recommendation process easily encounters the problem of data loss, resulting in a short length of the final recommended resource and less information about the actual human resources included. To solve this problem, this research proposes a human resource recommendation algorithm based on improved frequent itemset mining. The dataset containing single items is called, the human resource is mined to improve frequent itemset, the positive matrix factorization (PMF) model is used to process the implicit features in human resource, and the similarity parameters of the human resource dataset are calculated. The algorithm of collaborative filtering is used to divide the recommendation mechanism, and the loss of data generated during the recommendation is controlled, thereby completing the construction of the human resource recommendation algorithm. The hardware and software environment for algorithm operation were constructed. The human resource dataset was arranged. Tests were conducted using the recommendation algorithm based on neural network, recommendation algorithm based on item weight ranking and the proposed recommendation algorithm. The test results showed that the proposed recommendation algorithm recommended the longest length of resources and the most information contained within the resources. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码:284 / 288
页数:5
相关论文
共 50 条
  • [31] Pruning Optimization in Frequent Itemset Mining Algorithm Based on Bit Combination
    Lu, Jun
    Zhou, Kailong
    Guo, Zhicong
    [J]. BASIC & CLINICAL PHARMACOLOGY & TOXICOLOGY, 2020, 126 : 115 - 116
  • [32] PFIMD: a parallel MapReduce-based algorithm for frequent itemset mining
    Mao Yimin
    Geng Junhao
    Deborah Simon Mwakapesa
    Yaser Ahangari Nanehkaran
    Zhang Chi
    Deng Xiaoheng
    Chen Zhigang
    [J]. Multimedia Systems, 2021, 27 : 709 - 722
  • [33] An efficient algorithm for frequent itemset mining on data streams
    Xie Zhi-Jun
    Chen Hong
    Li, Cuiping
    [J]. ADVANCES IN DATA MINING: APPLICATIONS IN MEDICINE, WEB MINING, MARKETING, IMAGE AND SIGNAL MINING, 2006, 4065 : 474 - 491
  • [34] Novel algorithm for frequent itemset mining in data warehouses
    Xu L.-J.
    Xie K.-L.
    [J]. Journal of Zhejiang University-SCIENCE A, 2006, 7 (2): : 216 - 224
  • [35] YAFIM: A Parallel Frequent Itemset Mining Algorithm with Spark
    Qiu, Hongjian
    Gu, Rong
    Yuan, Chunfeng
    Huang, Yihua
    [J]. PROCEEDINGS OF 2014 IEEE INTERNATIONAL PARALLEL & DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2014, : 1664 - 1671
  • [36] A New Parallel Algorithm for the Frequent Itemset Mining Problem
    Craus, Mitica
    [J]. PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED COMPUTING, 2008, : 165 - 170
  • [37] A novel algorithm for frequent itemset mining in data warehouses
    徐利军
    谢康林
    [J]. Journal of Zhejiang University-Science A(Applied Physics & Engineering), 2006, (02) : 216 - 224
  • [38] PartEclat: an improved Eclat-based frequent itemset mining algorithm on spark clusters using partition technique
    Raj, Shashi
    Ramesh, Dharavath
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2022, 25 (06): : 4463 - 4480
  • [39] PartEclat: an improved Eclat-based frequent itemset mining algorithm on spark clusters using partition technique
    Shashi Raj
    Dharavath Ramesh
    [J]. Cluster Computing, 2022, 25 : 4463 - 4480
  • [40] A distributed algorithm of density-based subspace frequent closed itemset mining
    Fu, Huaiguo
    Foghlu, Micheal O.
    [J]. HPCC 2008: 10TH IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, PROCEEDINGS, 2008, : 750 - 755