Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Peter Stewart Hearty

dblp:01/3795 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 4 · 2 first-authorSecurity and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Empirical software engineering · 86% Software maintenance and evolution · 14%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Empirical software engineering
agile software development
0.112009
Predicting Project Velocity in XP Using a Learning Dynamic Bayesian Network Model · IEEE Trans. Software Eng. 2009
Empirical software engineering › agile software development
extreme programming
0.112009
Predicting Project Velocity in XP Using a Learning Dynamic Bayesian Network Model · IEEE Trans. Software Eng. 2009
Empirical software engineering
software effort estimation
0.112009
Predicting Project Velocity in XP Using a Learning Dynamic Bayesian Network Model · IEEE Trans. Software Eng. 2009
Empirical software engineering › software project management
software risk analysis
0.112005
Automated population of causal models for improved software risk assessment · ASE 2005
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
bayesian network
0.012009
Predicting Project Velocity in XP Using a Learning Dynamic Bayesian Network Model · IEEE Trans. Software Eng. 2009
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › bayesian network
dynamic bayesian network
0.012009
Predicting Project Velocity in XP Using a Learning Dynamic Bayesian Network Model · IEEE Trans. Software Eng. 2009

Methods — techniques the papers use, named apart from their topics

learning from project data · 0.2dynamic bayesian network · 0.2bayesian network · 0.1
YearPublicationVenuePosition
2009 Predicting Project Velocity in XP Using a Learning Dynamic Bayesian Network Model
abstract
Bayesian networks, which can combine sparse data, prior assumptions and expert judgment into a single causal model, have already been used to build software effort prediction models. We present such a model of an extreme programming environment and show how it can learn from project data in order to make quantitative effort predictions and risk assessments without requiring any additional metrics collection program. The model's predictions are validated against a real world industrial project, with which they are in good agreement.
Peter Stewart Hearty, Norman E. Fenton, David Marquez, Martin Neil
IEEE Trans. Software Eng.1
2008 On the effectiveness of early life cycle defect prediction with Bayesian Nets
Norman E. Fenton, Martin Neil, William Marsh 0001, Peter Stewart Hearty, Lukasz Radlinski, Paul Krause
Empir. Softw. Eng.4
2007 Predicting software defects in varying development lifecycles using Bayesian nets
Norman E. Fenton, Martin Neil, William Marsh 0001, Peter Stewart Hearty, David Marquez, Paul Krause, Rajat Mishra
Inf. Softw. Technol.4
2006 Modeling Dependable Systems using Hybrid Bayesian Networks
abstract
A hybrid Bayesian network (BN) is one that incorporates both discrete and continuous nodes. In our extensive applications of BNs for system dependability assessment the models are invariably hybrid and the need for efficient and accurate computation is paramount. We apply a new iterative algorithm that efficiently combines dynamic discretisation with robust propagation algorithms on junction tree structures to perform inference in hybrid BNs. We illustrate its use on two example dependability problems: reliability estimation and diagnosis of a faulty sensor in a temporal system. Dynamic discretisation can be used as an alternative to analytical or Monte Carlo methods with high precision and can be applied to a wide range of dependability problems.
Martin Neil, Manesh Tailor, Norman E. Fenton, David Marquez, Peter Stewart Hearty
ARES5
2005 Automated population of causal models for improved software risk assessment
abstract
Recent work in applying causal modeling (Bayesian networks) to software engineering has resulted in improved decision support systems for software project managers. Once the causal models are built there are commercial tools that can run them. However, data to populate the models is typically entered manually and this is an impediment to their more widespread use. Hence, here we present a prototype tool for automatically extracting a range of relevant software metrics from popular project management and CASE tools. This information is used to populate Bayesian networks with the aim of providing better real world predictions of the risks associated with software costs, timescales and reliability.
Peter Stewart Hearty, Norman E. Fenton, Martin Neil, Patrick Cates
ASE1