JOURNAL ARTICLE

The Research and Improvement Based on FP-Growth Data Mining Algorithm

Abstract

In order to improve the availability in space domain and raise time efficiency of the algorithm, increasing more FP-array to decrease the traversing of FP-tree in this paper.It has put forward to applying the node switching strategy to generate more packed FP-tree.It has come up with increasing more FP-array to decrease the traversing of FP-tree.The space of storing FP-tree would be reduced, it could avoid allocating more other space and improve the utilization factor of the space.The solution indicates that the efficiency of time and space of improved FP-Growth algorithm is higher than that of classical FP-Growth algorithm and TFP-growth algorithm.What is new and original in this paper is it applies node switching strategy to generate more packed FP-tree and increasing more FP-array to decrease the traversing of FP-tree.

Keywords:
Computer science Data mining Algorithm design Algorithm

Metrics

1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
6
Refs
0.24
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

Related Documents

BOOK-CHAPTER

Application and Research of FP Growth Algorithm in Data Mining

Yingmei Shang

Lecture notes on data engineering and communications technologies Year: 2022 Pages: 1035-1040
JOURNAL ARTICLE

FP-GROWTH ALGORITHM BASED INCREMENTAL ASSOCIATION RULE MINING ALGORITHM FOR BIG DATA

V. Jeya Ramya

Journal:   International Journal of Advanced Research in Computer Science Year: 2018 Vol: 9 (2)Pages: 386-389
© 2026 ScienceGate Book Chapters — All rights reserved.