Machine Learning Applied to the Clerical Task Management Problem in Master Data Management Systems
Zusammenfassung
Clerical tasks are created if a duplicate detection algorithm detects some similarity of records but not enough to allow an auto-merge operation. Data stewards review clerical tasks and make a final non-match or match decision. In this paper we evaluate different machine learning algorithms regarding their accuracy to predict the correct action for a clerical task and execute that action automatically if the prediction has sufficient confidence. This approach reduces the amount of work for data stewards by factors of magnitude.
- Vollständige Referenz
- BibTeX
Oberhofer, M., Bremer, L. & Chkalova, M.,
(2019).
Machine Learning Applied to the Clerical Task Management Problem in Master Data Management Systems.
In:
Grust, T., Naumann, F., Böhm, A., Lehner, W., Härder, T., Rahm, E., Heuer, A., Klettke, M. & Meyer, H.
(Hrsg.),
BTW 2019.
Gesellschaft für Informatik, Bonn.
(S. 419-431).
DOI: 10.18420/btw2019-25
@inproceedings{mci/Oberhofer2019,
author = {Oberhofer, Martin AND Bremer, Lars AND Chkalova, Mariya},
title = {Machine Learning Applied to the Clerical Task Management Problem in Master Data Management Systems},
booktitle = {BTW 2019},
year = {2019},
editor = {Grust, Torsten AND Naumann, Felix AND Böhm, Alexander AND Lehner, Wolfgang AND Härder, Theo AND Rahm, Erhard AND Heuer, Andreas AND Klettke, Meike AND Meyer, Holger} ,
pages = { 419-431 } ,
doi = { 10.18420/btw2019-25 },
publisher = {Gesellschaft für Informatik, Bonn},
address = {}
}
author = {Oberhofer, Martin AND Bremer, Lars AND Chkalova, Mariya},
title = {Machine Learning Applied to the Clerical Task Management Problem in Master Data Management Systems},
booktitle = {BTW 2019},
year = {2019},
editor = {Grust, Torsten AND Naumann, Felix AND Böhm, Alexander AND Lehner, Wolfgang AND Härder, Theo AND Rahm, Erhard AND Heuer, Andreas AND Klettke, Meike AND Meyer, Holger} ,
pages = { 419-431 } ,
doi = { 10.18420/btw2019-25 },
publisher = {Gesellschaft für Informatik, Bonn},
address = {}
}
Sollte hier kein Volltext (PDF) verlinkt sein, dann kann es sein, dass dieser aus verschiedenen Gruenden (z.B. Lizenzen oder Copyright) nur in einer anderen Digital Library verfuegbar ist. Versuchen Sie in diesem Fall einen Zugriff ueber die verlinkte DOI: 10.18420/btw2019-25
Haben Sie fehlerhafte Angaben entdeckt? Sagen Sie uns Bescheid: Feedback abschicken


(en)