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

Matthew Davison 0001

dblp:10/580 · also Matt Davison 0001 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2016
0000-0001-7948-4658ORCID · verified

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

Artificial intelligence and machine learning · 2Software engineering, systems software and programming languages · 2Databases, data management, data science and information retrieval · 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
1 paper
Software testing · 77% Software maintenance and evolution · 12% Program analysis · 12%

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

TopicWeightPapersLastEvidence papers
Software testing
test coverage
0.112007
An iterative, multi-level, and scalable approach to comparing execution traces · ESEC/SIGSOFT FSE 2007
Software testing
trace comparison
0.112007
An iterative, multi-level, and scalable approach to comparing execution traces · ESEC/SIGSOFT FSE 2007
Program analysis › dynamic analysis › trace analysis
execution trace analysis
0.012007
An iterative, multi-level, and scalable approach to comparing execution traces · ESEC/SIGSOFT FSE 2007
Software maintenance and evolution
program comprehension
0.012007
An iterative, multi-level, and scalable approach to comparing execution traces · ESEC/SIGSOFT FSE 2007

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

trace compression · 0.1
YearPublicationVenuePosition
2016 Modelling high-frequency FX rate dynamics: A zero-delay multi-dimensional HMM-based approach
Anton Tenyakov, Rogemar S. Mamon, Matthew Davison 0001
Knowl. Based Syst.3
2015 How much effort should be spent to detect fraudulent applications when engaged in classifier-based lending?
abstract
Credit scoring is an automated, objective and consistent tool which helps lenders to provide quick loan decisions. It can replace some of the more mechanical work done by experienced loan officers whose decisions are intuitive but potentially subject to bias. Prospective borrowers may have a strong motivation to fraudulently falsify one or more of the attributes they report on their application form. Applicants learn about the characteristics that are used to build credit scoring models, and may alter the answers on their application form to improve their chance of loan approval. Few automated credit scoring models have considered falsified information from borrowers. We will show that sometimes it is profitable for financial institutions to spend money and effort to identify dishonest customers. We will also find the optimal effort that banks should spend on identifying these liars. Furthermore, we will show that it is possible for liars to eventually adjust their lies to escape from credit checks. The proposed issue will be studied using simulated data and discriminant analysis. This research can help lending financial institutions to reduce risk and maximize profit, and it also shows that it is feasible for customers to lie intelligently so as to evade credit checks and get loans.
Mimi Chong, Cristián Bravo, Matthew Davison 0001
Intell. Data Anal.3
2012 Using entropy measures for comparison of software traces
Andriy V. Miranskyy, Matthew Davison 0001, Mark Reesor, Syed Shariyar Murtaza
Inf. Sci.2
2007 An iterative, multi-level, and scalable approach to comparing execution traces
abstract
In this paper, we overview a new approach to comparing execution traces. Such comparison can be useful for purposes such as improving test coverage and profiling system's users. In our approach, traces are compressed into different levels of compaction and are then compared iteratively from highest to lowest levels, rejecting dissimilar traces in the process and eventually leaving residual, similar traces. These residual traces form an important feedback for improvement or analysis goals. The preliminary results show that the approach is scalable for industrial use.
Andriy V. Miranskyy, Nazim H. Madhavji, Mechelle Gittens, Matthew Davison 0001, Mark Wilding, David Godwin
ESEC/SIGSOFT FSE4
2005 Modelling Assumptions and Requirements in the Context of Project Risk
abstract
Many researchers have emphasized the importance of documenting assumptions (As) underlying software requirements (Rs). However, As and Rs can change with time for reasons such as: (i) an A or R was elicited incorrectly and subsequently needs to be changed; (ii) operational domain changes induce changes in the A and R sets; and (iii) the change in validity of an A, or desirability of an R, respectively, causes the validity of another A or desirability of an R to change. In Section 2, we describe our model and how it works. To put such a model into practice, we need to consider at least two scenarios. One is intra-release cycle-time, where invalidity risk is predicted at the start of the project for times between the inception and completion of the project. This would give us intra-release risk trends. The second scenario is prediction over multiple releases. This would give us a risk trend over a longer period of time. The full paper describes an algorithm to cover both of these scenarios and gives an example (from a banking application) of how the model could apply in practice. Here, we consider only the first scenario due to limitation of space.
Andriy V. Miranskyy, Nazim H. Madhavji, Matthew Davison 0001, Mark Reesor
RE3