Providing a model to estimate the probability of the complexity of software projects

Function Point Analysis (FPA) is most used technique for estimating the size of a computerized business information system which was developed by Allan Albrecht. Various studies proposed new methods to extent FPA algorithm; mainly they tried to make it more precise but they are based on the similari...

Full description

Saved in:
Bibliographic Details
Main Authors: Marzoughi, Foad, Farhangian, Mohammad Mehdi, Sim, Alex Tze Hiang
Format: Article
Published: Recent Science 2010
Subjects:
Online Access:http://eprints.utm.my/id/eprint/38178/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.38178
record_format eprints
spelling my.utm.381782017-10-25T03:33:32Z http://eprints.utm.my/id/eprint/38178/ Providing a model to estimate the probability of the complexity of software projects Marzoughi, Foad Farhangian, Mohammad Mehdi Sim, Alex Tze Hiang QA75 Electronic computers. Computer science Function Point Analysis (FPA) is most used technique for estimating the size of a computerized business information system which was developed by Allan Albrecht. Various studies proposed new methods to extent FPA algorithm; mainly they tried to make it more precise but they are based on the similarity of previous projects so this paper is proposed. This paper, presents a statistical simulation method that can be applied for each generic project. The proposed method is a new method to assess estimation of size and effort of software projects by a stochastic and Markov chain approach. Based on Metropolis-hasting simulation algorithm, we formulate a Probabilistic Function Point Analysis (PFPA). Moreover, A Bayesian belief network approach is used for determination of complexity of system. It determines the function weights utilizing Markov chain theory to support estimating the effort of software projects. As a case study, this new method is applied in online publication domain. This method can increase the chance of implementation of generic projects on time. Recent Science 2010 Article PeerReviewed Marzoughi, Foad and Farhangian, Mohammad Mehdi and Sim, Alex Tze Hiang (2010) Providing a model to estimate the probability of the complexity of software projects. International Journal of Computer and Network Security (IJCNS) , 2 (10). pp. 203-206. ISSN 0975-8283
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Marzoughi, Foad
Farhangian, Mohammad Mehdi
Sim, Alex Tze Hiang
Providing a model to estimate the probability of the complexity of software projects
description Function Point Analysis (FPA) is most used technique for estimating the size of a computerized business information system which was developed by Allan Albrecht. Various studies proposed new methods to extent FPA algorithm; mainly they tried to make it more precise but they are based on the similarity of previous projects so this paper is proposed. This paper, presents a statistical simulation method that can be applied for each generic project. The proposed method is a new method to assess estimation of size and effort of software projects by a stochastic and Markov chain approach. Based on Metropolis-hasting simulation algorithm, we formulate a Probabilistic Function Point Analysis (PFPA). Moreover, A Bayesian belief network approach is used for determination of complexity of system. It determines the function weights utilizing Markov chain theory to support estimating the effort of software projects. As a case study, this new method is applied in online publication domain. This method can increase the chance of implementation of generic projects on time.
format Article
author Marzoughi, Foad
Farhangian, Mohammad Mehdi
Sim, Alex Tze Hiang
author_facet Marzoughi, Foad
Farhangian, Mohammad Mehdi
Sim, Alex Tze Hiang
author_sort Marzoughi, Foad
title Providing a model to estimate the probability of the complexity of software projects
title_short Providing a model to estimate the probability of the complexity of software projects
title_full Providing a model to estimate the probability of the complexity of software projects
title_fullStr Providing a model to estimate the probability of the complexity of software projects
title_full_unstemmed Providing a model to estimate the probability of the complexity of software projects
title_sort providing a model to estimate the probability of the complexity of software projects
publisher Recent Science
publishDate 2010
url http://eprints.utm.my/id/eprint/38178/
_version_ 1643650223199748096
score 13.211869