Vertaile menetelmiä
Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.
| Sääntöinduktio (RIPPER)× | Päätöspuu× | |
|---|---|---|
| Tieteenala | Koneoppiminen | Koneoppiminen |
| Menetelmäperhe | Machine learning | Machine learning |
| Syntyvuosi≠ | 1995 | 1984 |
| Kehittäjä≠ | William W. Cohen | Breiman, Friedman, Olshen & Stone |
| Tyyppi≠ | Supervised rule learning algorithm | Recursive partitioning (if-then rules) |
| Alkuperäislähde≠ | Cohen, W. W. (1995). Fast effective rule induction. Proceedings of the 12th International Conference on Machine Learning, 115–123. DOI ↗ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ |
| Rinnakkaisnimet≠ | RIPPER, Propositional Rule Learning, Kural Tümevarımı, Inductive Rule Learning | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree |
| Liittyvät≠ | 2 | 5 |
| Tiivistelmä≠ | Rule Induction, and specifically the RIPPER (Repeated Incremental Pruning to Produce Error Reduction) algorithm, is a supervised machine learning method that learns a compact set of IF-THEN classification rules from labeled training data. Introduced by William W. Cohen in 1995, RIPPER applies a separate-and-conquer strategy combined with minimum description length (MDL) pruning to generate rules that are both accurate and interpretable, making it a landmark algorithm in the field of inductive rule learning. | A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf. |
| ScholarGateAineisto ↗ |
|
|