search for: unprun

Hi, I am currently studying Decision Trees by using rpart package in R. I artificially created a data set which includes the dependant variable (y) and a few independent variables (x1, x2...). The dependant variable y only comprises 0 and 1. 90% of y are 1 and 10% of y are 0. When I apply rpart to it, there is no splitting at all. I am wondering whether this is because of the

...) text(cal.tree, all=TRUE,fheight=1.0,fwidth=1.0) dev.off() cat("\begin{figure}[ht!]") cat("\begin{center}") cat("\includegraphics[width = ", wid, ", height = ", hei, "]{reg_tree-fig3}") cat("\end{center}") cat("\caption{The resulting unpruned regression tree of the california real estate data}") cat("\label{FIG:figthree}") cat("\end{figure}") @ [[alternative HTML version deleted]]

...icult as plot() has many uses. Below is an example. I am using R 2.10.1 and Ubuntu 9.04. Thanks in advance! Sam x <- runif(48, 2, 70) data <- data.frame(x) data$treat1 <- factor(c("ONE", "TWO", "THREE")) data$treat2 <- factor(c("PRUNED", "UNPRUNED")) data$row <- factor(1:12) model <- with(data, aov(x ~ treat1 + treat2 + treat1*treat2 + Error(row))) plot(model) Error in plot.window(...) : need finite 'xlim' values In addition: Warning messages: 1: In min(x) : no non-missing arguments to min; returning Inf 2: In max(x) :...

Hi, all, I am wondering if it is possible to set parameters of 'rpart' and 'tree' such that they will produce the exact same tree? Thanks. Auston Wei Statistical Analyst Department of Biostatistics and Applied Mathematics The University of Texas MD Anderson Cancer Center Tel: 713-563-4281 Email: wwei@mdanderson.org [[alternative HTML version deleted]]

https://bugzilla.samba.org/show_bug.cgi?id=3653 Summary: Silence 'vanished files' messages Product: rsync Version: 2.6.8 Platform: All OS/Version: All Status: NEW Severity: enhancement Priority: P3 Component: core AssignedTo: wayned@samba.org ReportedBy: count-samba@flatline.de

...idatePairs, PairableInsts, ConnectedPairs, > + PairableInstUsers, ChosenPairs, Tree, *J); Fix indentation. (Align CandidatePairs and PairableInstUsers) > + > + // Because we'll keep the child with the largest depth, the largest > + // depth is still the same in the unpruned Tree. > + size_t MaxDepth = Tree.lookup(*J); > + > + DEBUG(dbgs()<< "BBV: found Tree for pair {"<< *J->first<< > + "<-> "<< *J->second<< "} of depth "<< > +...

...nectedPairs, > > + PairableInstUsers, ChosenPairs, Tree, *J); > Fix indentation. (Align CandidatePairs and PairableInstUsers) > > > + > > + // Because we'll keep the child with the largest depth, the largest > > + // depth is still the same in the unpruned Tree. > > + size_t MaxDepth = Tree.lookup(*J); > > + > > + DEBUG(dbgs()<< "BBV: found Tree for pair {"<< *J->first<< > > + "<-> "<< *J->second<< "} of depth "<< &...

On Mon, 2011-11-21 at 21:22 -0600, Hal Finkel wrote: > On Mon, 2011-11-21 at 11:55 -0600, Hal Finkel wrote: > > Tobias, > > > > I've attached an updated patch. It contains a few bug fixes and many > > (refactoring and coding-convention) changes inspired by your comments. > > > > I'm currently trying to fix the bug responsible for causing a compile

...nectedPairs, > > + PairableInstUsers, ChosenPairs, Tree, *J); > Fix indentation. (Align CandidatePairs and PairableInstUsers) > > > + > > + // Because we'll keep the child with the largest depth, the largest > > + // depth is still the same in the unpruned Tree. > > + size_t MaxDepth = Tree.lookup(*J); > > + > > + DEBUG(dbgs()<< "BBV: found Tree for pair {"<< *J->first<< > > + "<-> "<< *J->second<< "} of depth "<< &...

On Mon, 2011-11-21 at 11:55 -0600, Hal Finkel wrote: > Tobias, > > I've attached an updated patch. It contains a few bug fixes and many > (refactoring and coding-convention) changes inspired by your comments. > > I'm currently trying to fix the bug responsible for causing a compile > failure when compiling >