Displaying 4 results from an estimated 4 matches for "treedepth".
Did you mean:
tree_depth
2009 Jun 17
1
gbm for cost-sensitive binary classification?
...I think I miss sth here. Anyone has similar experience and can advise me how to implement cost-sensitive classification with gbm.
model.gbm <- gbm.fit(tr[,1:DIM],tr.y,offset = NULL,misc = NULL,distribution = "bernoulli",w = tr.w,var.monotone = NULL,n.trees = NTREE,interaction.depth = TREEDEPTH,n.minobsinnode = 10,shrinkage = 0.05,bag.fraction = BAGRATIO,train.fraction = 1.0,keep.data = TRUE,verbose = TRUE,var.names = NULL,response.name = NULL);
or
model.gbm <- gbm(tr.y ~ .,distribution = "bernoulli",data=data.frame(cbind(tr[,1:DIM],tr.y)),weights = tr.w,var.monotone=NULL...
2010 Nov 18
0
[LLVMdev] Writing a backend for the ZPU
...h were just stack slots in the
stack frame. This allowed the reload and register allocation to
do it's thing. What kind pre-stackifier register file do I define
for the ZPU?
- In GCC I wrote a piece of C that recursively unrolled
intermediate representation to machine code instructions.
So any treedepth was fine as long as it consisted of
operations that were supported by the instruction set. I'm can't
get a handle on how to translate this hack to llvm so far.
A typical ZPU machine code add might look something like this:
a = a + b + 123;
=>
loadsp 16 # push value at memory lo...
2010 Nov 19
0
[LLVMdev] Fw: Writing a backend for the ZPU
...> allowed the reload and register allocation
> to
do it's thing. What
> kind pre-stackifier register file do I define
for
> the ZPU?
-
> In GCC I wrote a piece of C that recursively
> unrolled
intermediate
> representation to machine code instructions.
So any
> treedepth was
> fine as long as it consisted of
operations that were supported
> by
> the instruction set. I'm can't
get a handle on how to translate this hack
>
> to llvm so far.
A typical ZPU machine code add might look
> something
> like this:
a = a + b +
> 123;...
2010 Feb 03
0
mboost: how to implement cost-sensitive boosting family
...ckboost(tr[,1:DIM], tr.y, family=CSAdaExp,
weights=NULL, control=boost_control(mstop=MSTOP,
nu=0.1,savedata=TRUE,save_ensembless=TRUE,trace=TRUE),
tree_controls=ctree_control(teststat = "max",testtype =
"Teststatistic",mincriterion = 0,minsplit = 2000, minbucket =
700,maxdepth = TREEDEPTH));
--------------------------------
regards,
Yuchun Tang, Ph.D.
Principal Engineer, Lead
McAfee, Inc.
4501 North Point Parkway
Suite 300
Alpharetta, GA 30022
Main: 770.776.2685
www.mcafee.com
www.trustedsource.org
www.linkedin.com/in/yuchuntang