JOURNAL ARTICLE

Research on application of data mining based on FP-growth algorithm for digital library

Abstract

In the field of the library, there is a huge amount of data from readers' borrowing records every day. We can find an interesting network from the relationship of books by doing data mining works on these records, especially on the analysis of association rules, which can help us to find the needs of readers more clearly. FP-growth (frequent pattern growth) uses an extended prefix-tree (FP-tree) structure to store the database in a compressed form. FP-growth adopts a divide-and-conquer approach to decompose both the mining tasks and the databases. In this paper, we use FP-growth algorithm to analyze the association rule of library circulation records. The results can make great sense to help to improve the quality of library collections.

Keywords:
Computer science Association rule learning Prefix Data mining Field (mathematics) Trie Digital library Library circulation Tree (set theory) Quality (philosophy) Divide and conquer algorithms Information retrieval Algorithm Data structure Data science Database World Wide Web Mathematics Programming language

Metrics

7
Cited By
0.00
FWCI (Field Weighted Citation Impact)
4
Refs
0.17
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Data Mining Algorithms and Applications
Physical Sciences →  Computer Science →  Information Systems
Rough Sets and Fuzzy Logic
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Imbalanced Data Classification Techniques
Physical Sciences →  Computer Science →  Artificial Intelligence
© 2026 ScienceGate Book Chapters — All rights reserved.