Altmetric
Closed loop machine learning: complexity of ASE-progol
| File | Description | Size | Format | |
|---|---|---|---|---|
 DTR02-8.pdf | Published version | 260.85 kB | Adobe PDF | View/Open |
| Title: | Closed loop machine learning: complexity of ASE-progol |
| Authors: | Tamaddoni Nezhad, A Muggleton, S |
| Item 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. |
| Issue Date: | 1-Jan-2002 |
| URI: | http://hdl.handle.net/10044/1/95720 |
| DOI: | https://doi.org/10.25561/95720 |
| 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 |
| Appears in Collections: | Computing Computing Technical Reports |
This item is licensed under a Creative Commons License
