Please use this identifier to cite or link to this item: http://ktisis.cut.ac.cy/handle/10488/6743
Title: A graph approach to generate all possible regression submodels
Authors: Gatu, Cristian 
Yanev, Petko I. 
Kontoghiorghes, Erricos John 
Keywords: Regression analysis;Algorithms;Branch-and-bound algorithm;Computer simulation;Set theory
Issue Date: 2007
Publisher: Elsevier
Source: Computational Statistics and Data Analysis, 2007, Volume 52, Issue 2, Pages 799-815
Abstract: 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 characteristics. An adaptation of a branch-and-bound algorithm which computes the best-subset models using the regression graph framework is proposed. Experimental results and comparison with an existing method based on a regression tree are presented and discussed.
URI: http://ktisis.cut.ac.cy/handle/10488/6743
ISSN: 01679473
DOI: http://dx.doi.org/10.1016/j.csda.2007.02.018
Rights: © 2007 Elsevier B.V. All rights reserved.
Type: Article
Appears in Collections:Άρθρα/Articles

Show full item record

SCOPUSTM   
Citations 20

17
checked on Nov 16, 2017

Page view(s) 50

30
Last Week
1
Last month
2
checked on Nov 20, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.