Closed loop machine learning: complexity of ASE-progol
File(s)DTR02-8.pdf (260.85 KB)
Published version
Author(s)
Tamaddoni Nezhad, Alireza
Muggleton, Stephen
Type
Report
Abstract
In this report we study the complexity of each implemented component of the Closed Loop Machine Learning in ASE-Progol. In the first part of the report, we review each component of ASE-Progol and discuss the complexity of each component. In the second part, we perform an experimentation to compare the average run time of each component of ASE-Progol in each iteration of the closed loop machine learning. This experimentation is repeated to measure the average run time for both phase A and phase B data.
Date Issued
2002-01-01
Citation
Departmental Technical Report: 02/8, 2002, pp.1-22
Publisher
Department of Computing, Imperial College London
Start Page
1
End Page
22
Journal / Book Title
Departmental Technical Report: 02/8
Copyright Statement
© 2002 The Author(s). This report is available open access under a CC-BY-NC-ND (https://creativecommons.org/licenses/by-nc-nd/4.0/)
Publication Status
Published
Article Number
02/8