Was hat Sie zu dieser Wunschlistenanfrage inspiriert?
Data-Mining-"Bump-Hunting"-Algorithmus, der kein empirisches Modell erfordert.Vielmehr durchsucht es "geduldig" / inkrementell Hyperboxen mit Eingabefaktoren, die die Antwort maximieren.
Welche Verbesserung wünschen Sie sich?
Von R:
library<SPAN class="">(</SPAN>prim<SPAN class="">)</SPAN>
library<SPAN class="">(</SPAN>MASS<SPAN class="">)</SPAN>
data<SPAN class="">(</SPAN>Boston<SPAN class="">)</SPAN>
x <SPAN class="">\</SPAN><SPAN class=""><-</SPAN> Boston<SPAN class="">\</SPAN><SPAN class="">[</SPAN><SPAN class="">,</SPAN><SPAN class="">5</SPAN><SPAN class="">:</SPAN><SPAN class="">6</SPAN><SPAN class="">\</SPAN><SPAN class="">]</SPAN>
y <SPAN class="">\</SPAN><SPAN class=""><-</SPAN> Boston<SPAN class="">\</SPAN><SPAN class="">[</SPAN><SPAN class="">,</SPAN><SPAN class="">1</SPAN><SPAN class="">\</SPAN><SPAN class="">]</SPAN>
boston.prim <SPAN class="">\</SPAN><SPAN class=""><-</SPAN> prim.box<SPAN class="">(</SPAN>x<SPAN class="">=</SPAN>x<SPAN class="">,</SPAN> y<SPAN class="">=</SPAN>y<SPAN class="">,</SPAN> threshold.type<SPAN class="">=</SPAN><SPAN class="">1</SPAN><SPAN class="">)</SPAN>
Warum ist diese Idee wichtig?
