ScholarGate
Assistente

Confronta i metodi

Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.

Regole di Associazione d'Insieme×Algoritmo Apriori×Regole di associazione×Bagging (Bootstrap Aggregating)×Boosting×
CampoApprendimento automaticoApprendimento automaticoApprendimento automaticoApprendimento automaticoApprendimento automatico
FamigliaMachine learningMachine learningMachine learningMachine learningMachine learning
Anno di originelate 1990s–2000s1994199319961990–1997
IdeatoreVarious (applied ensemble philosophy from Breiman and others to association rule mining)Agrawal, R. & Srikant, R.Agrawal, R., Imielinski, T., & Swami, A.Breiman, L.Schapire, R. E.; Freund, Y.
TipoEnsemble meta-learning over association rule learnersFrequent itemset and association rule mining algorithmUnsupervised pattern discoveryEnsemble meta-algorithm (variance reduction via bootstrap aggregation)Sequential ensemble (iterative reweighting)
Fonte seminaleDomingos, P. (1999). MetaCost: A general method for making classifiers cost-sensitive. Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 155–164. link ↗Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 487–499. link ↗Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216. DOI ↗Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗
AliasEnsemble ARM, aggregated association rules, combined frequent-pattern mining, multi-run association rule learningApriori, frequent itemset mining, ARL-Apriori, Apriori association miningmarket basket analysis, association rule mining, frequent itemset mining, affinity analysisBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Correlati65456
SintesiEnsemble Association Rules applies ensemble learning principles to association rule mining: multiple rule sets are discovered from different data subsamples or with varied parameters, then merged and weighted to produce a more stable and complete set of co-occurrence patterns. The approach reduces sensitivity to support and confidence threshold choices and improves robustness on noisy transactional data.The Apriori algorithm, introduced by Agrawal and Srikant in 1994, is the foundational method for discovering frequent itemsets and association rules in transactional databases. It uses a breadth-first, level-wise search guided by the anti-monotone property of support to efficiently enumerate all item combinations that co-occur above a user-set minimum threshold, then extracts interpretable if-then rules from those patterns.Association rule learning is an unsupervised technique that discovers co-occurrence patterns — 'if X then Y' implications — within large transactional datasets. Originally formalized by Agrawal, Imielinski, and Swami (1993) for supermarket basket analysis, it is now widely applied in e-commerce recommendation, health informatics, bioinformatics, and behavioral research.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.Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.
ScholarGateInsieme di dati
  1. v1
  2. 2 Fonti
  3. PUBLISHED
  1. v1
  2. 2 Fonti
  3. PUBLISHED
  1. v1
  2. 2 Fonti
  3. PUBLISHED
  1. v1
  2. 3 Fonti
  3. PUBLISHED
  1. v1
  2. 2 Fonti
  3. PUBLISHED

Vai alla ricerca Scarica le diapositive

ScholarGateConfronta i metodi: Ensemble Association Rules · Apriori Algorithm · Association Rules · Bagging · Boosting. Consultato il 2026-06-15 da https://scholargate.app/it/compare