Minimal re-computation for exploratory data analysis in astronomy
dc.contributor.author | Nikolic, Bojan | |
dc.contributor.author | Small, D | |
dc.contributor.author | Kettenis, M | |
dc.date.accessioned | 2018-12-13T00:31:07Z | |
dc.date.available | 2018-12-13T00:31:07Z | |
dc.date.issued | 2018-10 | |
dc.identifier.issn | 2213-1337 | |
dc.identifier.uri | https://www.repository.cam.ac.uk/handle/1810/286791 | |
dc.description.abstract | We present a technique to automatically minimise the re-computation when a data processing program is iteratively changed, or added to, as is often the case in exploratory data analysis in radio astronomy. A typical example is flagging and calibration of demanding or unusual observations where visual inspection suggests improvement to the processing strategy. The technique is based on memoization and referentially transparent tasks. We describe a prototype implementation for the CASA data reduction package. This technique improves the efficiency of data analysis while reducing the possibility for user error and improving the reproducibility of the final result. | |
dc.publisher | Elsevier BV | |
dc.title | Minimal re-computation for exploratory data analysis in astronomy | |
dc.type | Article | |
prism.endingPage | 138 | |
prism.publicationDate | 2018 | |
prism.publicationName | Astronomy and Computing | |
prism.startingPage | 133 | |
prism.volume | 25 | |
dc.identifier.doi | 10.17863/CAM.34098 | |
dcterms.dateAccepted | 2018-09-04 | |
rioxxterms.versionofrecord | 10.1016/j.ascom.2018.09.003 | |
rioxxterms.version | AM | |
rioxxterms.licenseref.uri | http://www.rioxx.net/licenses/all-rights-reserved | |
rioxxterms.licenseref.startdate | 2018-10-01 | |
dc.contributor.orcid | Nikolic, Bojan [0000-0001-7168-2705] | |
dc.identifier.eissn | 2213-1345 | |
rioxxterms.type | Journal Article/Review | |
pubs.funder-project-id | European Commission (283393) | |
pubs.funder-project-id | European Commission Horizon 2020 (H2020) Research Infrastructures (RI) (653477) | |
rioxxterms.freetoread.startdate | 2019-10-01 |
Files in this item
This item appears in the following Collection(s)
-
Cambridge University Research Outputs
Research outputs of the University of Cambridge