Re: implementation note for scapegoat tree
- From: "user923005" <dcorbit@xxxxxxxxx>
- Date: 28 Mar 2007 16:35:40 -0700
On Mar 28, 3:59 pm, "user923005" <dcor...@xxxxxxxxx> wrote:
On Mar 28, 3:10 pm, Ben Pfaff <b...@xxxxxxxxxxxxxxx> wrote:Here, 'polynomial degree N' might sound like a polynomial of degree
"user923005" <dcor...@xxxxxxxxx> writes:You're still working on PSPP?
Here are some things I would find interesting (if they are not already
present):
Generic Levenberg Marquardt fitting of families of functions to trend
data (specifically, polynomial degree N, exponential(N), log(N),
N*log(N), 2^N, N!, N^N) and linear combinations thereof.
comensurate with the size of the data.
Of course that is not what I meant. Only rarely would I want a
polynomial of degree higher than 5.
Most of the time, it would be of degree 1 (linear) for linear
regression.
.
- References:
- implementation note for scapegoat tree
- From: Ben Pfaff
- Re: implementation note for scapegoat tree
- From: user923005
- Re: implementation note for scapegoat tree
- From: Ben Pfaff
- Re: implementation note for scapegoat tree
- From: user923005
- implementation note for scapegoat tree
- Prev by Date: Re: implementation note for scapegoat tree
- Next by Date: Re: implementation note for scapegoat tree
- Previous by thread: Re: implementation note for scapegoat tree
- Next by thread: Re: implementation note for scapegoat tree
- Index(es):