ScholarGate
助手
Machine learningMachine learning

集成先验算法 (Ensemble Apriori Algorithm)

集成先验算法 (Ensemble Apriori Algorithm) 将集成学习的原理应用于经典的先验 (Apriori) 频繁项集挖掘器,通过在不同的数据分区或参数设置上运行多个先验实例并合并它们的规则集来实现。这种方法提高了覆盖率,降低了对最小支持度阈值的敏感性,并将关联规则挖掘扩展到更大的事务数据集。

在 MethodMind 中打开即将推出视频即将推出Download slides

阅读完整方法

仅限会员

使用免费账户登录即可阅读本节。

登录

Method map

The neighbourhood of related methods — select a node to explore.

来源

  1. Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 1215, 487–499. link
  2. Apriori algorithm. Wikipedia. link

如何引用本页

ScholarGate. (2026, June 3). Ensemble Apriori Algorithm (Ensemble-Based Frequent Pattern and Association Rule Mining). ScholarGate. https://scholargate.app/zh/machine-learning/ensemble-apriori-algorithm

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
ScholarGateEnsemble Apriori Algorithm (Ensemble Apriori Algorithm (Ensemble-Based Frequent Pattern and Association Rule Mining)). 于 2026-06-15 检索自 https://scholargate.app/zh/machine-learning/ensemble-apriori-algorithm · 数据集: https://doi.org/10.5281/zenodo.20539026