Machine learningMachine learning
在线FP增长 (Online FP-growth)
Online FP-growth 是一种 FP-growth 算法的增量式扩展，它在不从头重建完整 FP-tree 的情况下，从连续到达的事务流中挖掘频繁项集。它在有新事务到达时更新现有的紧凑树结构，使其适用于无法进行完整数据库扫描的实时和高吞吐量数据环境。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Cheung, W. & Zaiane, O. R. (2004). Incremental Mining of Frequent Patterns Without Candidate Generation or Support Thr esholding. In Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), pp. 111–118. IEEE. link ↗
- Lee, G., Yun, U. & Ryu, K. H. (2014). Sliding window based weighted maximal frequent pattern mining over data streams. Expert Systems with Applications, 41(2), 694–708. DOI: 10.1016/j.eswa.2013.07.094 ↗
如何引用本页
ScholarGate. (2026, June 3). Online Frequent Pattern Growth (Incremental FP-tree Mining). ScholarGate. https://scholargate.app/zh/machine-learning/online-fp-growth
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →