Cristian Gatu

Learn More
An efficient branch-and-bound algorithm for computing the best-subset regression models is proposed. The algorithm avoids the computation of the whole regression tree that generates all possible subset models. It is formally shown that if the branch-and-bound test holds, then the current subtree together with its right-hand side subtrees are cut. This(More)
A regression graph to enumerate and evaluate all possible subset regression models is introduced. The graph is a generalization of a regression tree. All the spanning trees of the graph are minimum spanning trees and provide an optimal computational procedure for generating all possible submodels. Each minimum spanning tree has a different structure and(More)
Riassunto: An efficient branch-and-bound algorithm for computing the best-subset regression models is proposed. The algorithm avoids the computation of the whole regression tree that generates all possible subset models. It is formally shown that if the branch-and-bound test holds, then the current subtree together with its right-hand side subtrees are cut.(More)
The journal of Computational Statistics and Data Analysis (CSDA) regularly publishes papers with a strong algorithmic and software component. Some recent CSDA related articles can be found in Bustos and Frery (2006), Hammill and Preisser (2006), Keeling and Pavur (2007), Novikov and Oberman (2007), Rosenthal (2007) and Tomasi and Bro (2006). This is the(More)