Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/2099
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gatu, Cristian | - |
dc.contributor.author | Yanev, Petko I. | - |
dc.contributor.author | Kontoghiorghes, Erricos John | - |
dc.contributor.other | Κοντογιώργης, Έρρικος Γιάννης | - |
dc.date.accessioned | 2013-01-28T13:17:05Z | en |
dc.date.accessioned | 2013-05-16T08:21:55Z | - |
dc.date.accessioned | 2015-12-02T09:28:53Z | - |
dc.date.available | 2013-01-28T13:17:05Z | en |
dc.date.available | 2013-05-16T08:21:55Z | - |
dc.date.available | 2015-12-02T09:28:53Z | - |
dc.date.issued | 2007-10-15 | - |
dc.identifier.citation | Computational Statistics and Data Analysis, 2007, vol. 52, no. 2, pp. 799-815. | en_US |
dc.identifier.issn | 1679473 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14279/2099 | - |
dc.description.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. | en_US |
dc.format | en_US | |
dc.language.iso | en | en_US |
dc.relation.ispartof | Computational Statistics and Data Analysis | en_US |
dc.rights | © Elsevier | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject | Regression analysis | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Branch-and-bound algorithm | en_US |
dc.subject | Computer simulation | en_US |
dc.subject | Set theory | en_US |
dc.title | A graph approach to generate all possible regression submodels | en_US |
dc.type | Article | en_US |
dc.affiliation | Cyprus University of Technology | en |
dc.collaboration | Université de Neuchâtel | en_US |
dc.collaboration | University of Plovdiv “Paisii Hilendarski,” Bulgaria | en_US |
dc.collaboration | University of Cyprus | en_US |
dc.journals | Subscription | en_US |
dc.country | Greece | en_US |
dc.subject.field | Natural Sciences | en_US |
dc.publication | Peer Reviewed | en_US |
dc.identifier.doi | 10.1016/j.csda.2007.02.018 | en_US |
dc.dept.handle | 123456789/54 | en |
dc.relation.issue | 2 | en_US |
dc.relation.volume | 52 | en_US |
cut.common.academicyear | 2007-2008 | en_US |
dc.identifier.spage | 799 | en_US |
dc.identifier.epage | 815 | en_US |
item.fulltext | No Fulltext | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
crisitem.journal.journalissn | 0167-9473 | - |
crisitem.journal.publisher | Elsevier | - |
crisitem.author.dept | Department of Finance, Accounting and Management Science | - |
crisitem.author.faculty | Faculty of Tourism Management, Hospitality and Entrepreneurship | - |
crisitem.author.orcid | 0000-0001-9704-9510 | - |
crisitem.author.parentorg | Faculty of Management and Economics | - |
Appears in Collections: | Άρθρα/Articles |
CORE Recommender
SCOPUSTM
Citations
23
checked on Nov 9, 2023
WEB OF SCIENCETM
Citations
50
24
Last Week
0
0
Last month
0
0
checked on Oct 29, 2023
Page view(s)
620
Last Week
0
0
Last month
29
29
checked on Mar 13, 2025
Google ScholarTM
Check
Altmetric
This item is licensed under a Creative Commons License