Ensemble Association Rules
Ensemble Association Rules anvender ensemble læringsprincipper på association rule mining: flere regelsæt opdages fra forskellige datasubsamples eller med varierende parametre, samles derefter og vægtes for at producere et mere stabilt og komplet sæt af samforekomstmønstre. Tilgangen reducerer følsomhed over for valg af support- og konfidensgrænseværdier og forbedrer robustheden på støjende transaktionsdata.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
Kilder
- Domingos, 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 ↗
- Rymon, R. (1992). Search through systematic set enumeration. Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, 539–550. — foundational work on systematic enumeration used in ensemble aggregation of frequent itemsets. link ↗
Sådan citerer du denne side
ScholarGate. (2026, June 3). Ensemble Association Rule Mining. ScholarGate. https://scholargate.app/da/machine-learning/ensemble-association-rules
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.
- Apriori AlgoritmenMaskinlæring↔ compare
- AssocieringsreglerMaskinlæring↔ compare
- Bagging (Bootstrap Aggregating)Maskinlæring↔ compare
- BoostingMaskinlæring↔ compare
- FP-Growth (Frequent Pattern Growth)Maskinlæring↔ compare
- StemmeensembleMaskinlæring↔ compare
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →