Aickelin Uwe
Robust datamining
Uwe, Aickelin
Authors
Abstract
Our long-term research goal is to develop datamining methodologies that are robust to changes in data and uncertainty. By robust we mean solutions remain ‘optimal’ when things change or are easily repaired. Broadly, this robustness can be achieved in two ways: One, by having ‘slack’ in the solution or two, by constructing the solution such that is easily repairable, e.g. failures are isolated.
Citation
Uwe, A. (2017). Robust datamining.
| Conference Name | 4th Asia Pacific Conference on Advanced Research (APCAR - Mar, 2017) |
|---|---|
| End Date | Mar 5, 2017 |
| Acceptance Date | Feb 1, 2017 |
| Publication Date | Mar 5, 2017 |
| Deposit Date | Nov 15, 2017 |
| Publicly Available Date | Nov 15, 2017 |
| Journal | 4th Asia Pacific Conference on Advanced Research (APCAR- MAR 2017), Melbourne, Australia |
| Peer Reviewed | Peer Reviewed |
| Public URL | https://nottingham-repository.worktribe.com/output/848679 |
| Related Public URLs | http://apiar.org.au/?conference=4th-asia-pacific-conference-on-advanced-research-apcar-mar-2017-melbourne-australia |
| Additional Information | Proceedings published by Asia Pacific Institute of Advanced Research. ISBN 9780995398009 / ISSN 2207-2799 |
Files
ROBUST DATAMINING.pdf
(51 Kb)
PDF
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: digital-library-support@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search