Caitlin A. Owen

Dr. Caitlin A. Owen


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 May 2015 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
PWPeter A. Whigham
Peter A. Whigham
COCaitlin A. Owen
Caitlin A. Owen
SMStephen G. Macdonell
Stephen G. Macdonell
Software effort estimation (SEE) is a core activity in all software processes and development lifecycles. A range of increasingly complex methods has been considered in the past 30 years for the prediction of effort, often with mixed and contradictory results. The comparative assessment of effort prediction methods has therefore become a common approach when considering how best to predict effort over a range of project types. Unfortunately, these assessments use a variety of sampling methods and error measurements, making comparison with other work difficult. This article proposes an automatically transformed linear model (ATLM) as a suitable baseline model for comparison against SEE methods. ATLM is simple yet performs well over a range of different project types. In addition, ATLM may be used with mixed numeric and categorical data and requires no parameter tuning. It is also deterministic, meaning that results obtained are amenable to replication. These and other arguments for using ATLM as a baseline model are presented, and a reference implementation described and made available. We suggest that ATLM should be used as a baseline of effort prediction quality for all future model comparisons in SEE.

1 November 2020 in Science of Computer Programming
Verified
Journal Article
Closed access
SMSarah Meldrum
Sarah Meldrum
SLSherlock A. Licorish
Sherlock A. Licorish
COCaitlin A. Owen
Caitlin A. Owen
BSBastin Tony Roy Savarimuthu
Bastin Tony Roy Savarimuthu

11 July 2015
Verified
Conference Paper
Open access
PWPeter A. Whigham
Peter A. Whigham
GDGrant Dick
Grant Dick
JMJames Maclaurin
James Maclaurin
COCaitlin A. Owen
Caitlin A. Owen
Grammatical Evolution (GE) has a long history in evolutionary computation. Central to the behaviour of GE is the use of a linear representation and grammar to map individuals from search spaces into problem spaces. This genotype to phenotype mapping is often argued as a distinguishing property of GE relative to other techniques, such as context-free grammar genetic programming (CFG-GP). Since its initial description, GE research has attempted to incorporate information from the grammar into crossover, mutation, and individual initialisation, blurring the distinction between genotype and phenotype and creating GE variants closer to CFG-GP. This is argued to provide GE with the \"best of both worlds\", allowing degrees of grammatical bias to be introduced into operators to best suit the given problem. This paper examines the behaviour of three grammar-based search methods on several problems from previous GE research. It is shown that, unlike CFG-GP, the performance of \"pure\" GE on the examined problems closely resembles that of random search. The results suggest that further work is required to determine the cases where the \"best of both worlds\" of GE are required over a straight CFG-GP approach.

4 November 2020 in Journal of the Operational Research Society
Verified
Journal Article
Closed access
DODorian Owen
Dorian Owen
COCaitlin A. Owen
Caitlin A. Owen
Measurement of the degree of competitive balance, how evenly teams are matched, is central to the analysis of professional sports leagues. A common problem with within-season competitive balance measures, however, is their sensitivity to the number of teams and the number of matches played by each team, i.e. season length. This paper uses simulation methods to examine the effects of changes in season length on the distributions of several widely used variants of the Herfindahl-Hirschman index applied to wins in a season. Accounting for both the lower and upper bounds of the index improves its robustness to variation in the numbers of teams or games played per season, but does not completely remove overestimation of imbalance associated with shorter season lengths. Overall, McGee’s balance measure significantly mitigates the dependence on the number of matches and, of the measures considered, is recommended as the most robust to variation in season length.

17 March 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
COCaitlin A. Owen
Caitlin A. Owen
GDGrant Dick
Grant Dick
PWPeter A. Whigham
Peter A. Whigham
Genetic programming (GP) is a common method for performing symbolic regression that relies on the use of ephemeral random constants in order to adequately scale predictions. Suitable values for these constants must be drawn from appropriate, but typically unknown, distributions for the problem being modelled. While rarely used with GP, Z-score standardisation of feature and response spaces often significantly improves the predictive performance of GP by removing scale issues and reducing error due to bias. However, in some cases it is also associated with erratic error due to variance. This paper demonstrates that this variance component increases in the presence of gaps at the boundaries of the training data explanatory variable intervals. An initial solution to this problem is proposed that augments training data with pseudo instances located at the boundaries of the intervals. When applied to benchmark problems, particularly with small training samples, this solution reduces error due to variance and therefore total error. Augmentation is shown to also stabilise error in larger problems, however results suggest that standardised GP works well on such problems with little need for training data augmentation.

2 July 2018
Verified
Conference Paper
Open access
PDF file
GDGrant Dick
Grant Dick
COCaitlin A. Owen
Caitlin A. Owen
PWPeter A. Whigham
Peter A. Whigham