Computer and Modernization ›› 2020, Vol. 0 ›› Issue (06): 68-.

Previous Articles     Next Articles

Application of Algorithm of Fast Mining Maximal Frequent Itemsets in Library Management

  

  1. (Institute of Physical and Chemical Engineering of Nuclear Industry, Tianjin 300180, China)
  • Received:2019-10-16 Online:2020-06-24 Published:2020-06-28

Abstract: Aiming at the lag of librarys service mode and the contradiction between librarys supply and users demand, this paper uses data mining technology and DS-Eclat algorithm to mine its maximum frequent item set by borrowing records, and to promote the transformation of librarys service mode by finding out the internal association rules in users searching information.By comparing the traditional Eclat algorithm with the DS-Eclat algorithm in this paper, it is shown that the DS-Eclat algorithm can quickly discover the maximum frequent item set, and the maximum frequent item set can promote the development of library personalized service.

Key words: DS-Eclat algorithm, association rule, maximum frequent itemsets, individualization service

CLC Number: