Abstract This paper presents an approach for determining the most appropriate technique for cost estimation of innovative high value manufacturing products depending on the amount of prior data available. Case study data from the United States Scheduled Annual Summary Reports for the Joint Strike Fighter (1997-2010) is used to exemplify how, depending on the attributes of a priori data certain techniques for cost estimation are more suitable than others. The data attribute focused on is the computational complexity involved in identifying whether or not there are patterns suited for propagation. Computational complexity is calculated based upon established mathematical principles for pattern recognition which argue that at least 42 data sets are required for the application of standard regression analysis techniques. The paper proposes that below this threshold a generic dependency model and starting conditions should be used and iteratively adapted to the context. In the special case of having less than four datasets available it is suggested that no contemporary cost estimating techniques other than analogy or expert opinion are currently applicable and alternate techniques must be explored if more quantitative results are desired. By applying the mathematical principles of complexity groups the paper argues that when less than four consecutive datasets are available the principles of topological data analysis should be applied. The preconditions being that the cost variance of at least three cost variance types for one to three time discrete continuous intervals is available so that it can be quantified based upon its geometrical attributes, visualised as an n-dimensional point cloud and then evaluated based upon the symmetrical properties of the evolving shape. Further work is suggested to validate the provided decision-trees in cost estimation practice.
[1]
Eve Mitleton-Kelly,et al.
Complex systems and evolutionary perspectives on organisations: the application of complexity theory to organisations
,
2003
.
[2]
Herbert Edelsbrunner,et al.
Topological persistence and simplification
,
2000,
Proceedings 41st Annual Symposium on Foundations of Computer Science.
[3]
Gunnar E. Carlsson,et al.
Topology and data
,
2009
.
[4]
Tony Robbin,et al.
Topology and the Visualization of Space
,
2014,
Symmetry.
[5]
John Ahmet Erkoyuncu,et al.
A framework for geometric quantification and forecasting of cost uncertainty for aerospace innovations
,
2016
.
[6]
Sterling K. Berberian,et al.
Introduction to Hilbert Space
,
1977
.
[7]
Luis Tenorio,et al.
Prior information and uncertainty in inverse problems
,
2001
.
[8]
G. Ossimitz,et al.
The Basics of System Dynamics : Discrete vs . Continuous Modelling of Time 1
,
2008
.
[9]
R. Ghrist.
Barcodes: The persistent topology of data
,
2007
.
[10]
Jay Wright Forrester,et al.
Principles of systems : text and workbook, chapters 1 through 10
,
1968
.
[11]
Jean-Paul Delahaye,et al.
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
,
2012,
PloS one.
[12]
Peter Bubenik,et al.
A statistical approach to persistent homology
,
2006,
math/0607634.
[13]
Afra Zomorodian,et al.
Computing Persistent Homology
,
2004,
SCG '04.
[15]
G. Carlsson,et al.
Data Analysis using Computational Topology and Geometric Statistics
,
2009
.
[16]
John Ahmet Erkoyuncu,et al.
Uncertainty quantification metrics for whole product life cycle cost estimates in aerospace innovation
,
2015
.