Algorithmic Optimization Method for Effort Estimation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F16%3A43875364" target="_blank" >RIV/70883521:28140/16:43875364 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1134/S0361768816030087" target="_blank" >http://dx.doi.org/10.1134/S0361768816030087</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1134/S0361768816030087" target="_blank" >10.1134/S0361768816030087</a>
Alternative languages
Result language
angličtina
Original language name
Algorithmic Optimization Method for Effort Estimation
Original language description
This paper presents an improvement of an effort estimation method that can be used to predict the level of effort for software development projects. A new estimation approach based on a two-phase algorithm is used. In the first phase, we apply a calculation based on use case points (UCPs). In the second phase, we add correction values ( ) obtained via least squares regression. This approach employs historical project data to refine the estimate. By applying the least squares regression approach, the algorithm filters out estimation errors caused by human factors and company practice.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Programming and Computer Software
ISSN
0361-7688
e-ISSN
—
Volume of the periodical
42
Issue of the periodical within the volume
3
Country of publishing house
RU - RUSSIAN FEDERATION
Number of pages
6
Pages from-to
161-166
UT code for WoS article
000376603900005
EID of the result in the Scopus database
—