\textsc{Treant}: training evasion-aware decision trees (Q2212514): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Random forests / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3327527 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Greedy function approximation: A gradient boosting machine. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constructing optimal binary decision trees is NP-complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithm 733: TOMP–Fortran modules for optimal control calculations / rank | |||
Normal rank | |||
Latest revision as of 02:42, 24 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \textsc{Treant}: training evasion-aware decision trees |
scientific article |
Statements
\textsc{Treant}: training evasion-aware decision trees (English)
0 references
23 November 2020
0 references
adversarial machine learning
0 references
robust learning
0 references
decision tree ensembles
0 references
