方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 集成先验算法 (Ensemble Apriori Algorithm)× | Bagging（Bootstrap Aggregating）× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1994 (Apriori base); ensemble extensions 2000s–2010s | 1996 |
| 提出者≠ | Agrawal, R. & Srikant, R. (Apriori base); ensemble extension by multiple researchers | Breiman, L. |
| 类型≠ | Ensemble / Frequent Pattern Mining | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) |
| 开创性文献≠ | 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 ↗ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ |
| 别名≠ | Ensemble Apriori, Ensemble Association Rule Mining, EAR mining, Distributed Apriori Ensemble | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor |
| 相关 | 5 | 5 |
| 摘要≠ | The Ensemble Apriori Algorithm applies ensemble principles to the classic Apriori frequent-pattern miner by running multiple Apriori instances on different data partitions or parameter settings and merging their rule sets. This approach improves coverage, reduces sensitivity to the minimum-support threshold, and scales association rule mining to larger transactional datasets. | Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner. |
| ScholarGate数据集 ↗ |
|
|