工作流优先级的机器学习方法

Niharika R Bollumpally, Andrew C Evans, Scott W Gleave, Alexander R Gromadzki, G. Learmonth
{"title":"工作流优先级的机器学习方法","authors":"Niharika R Bollumpally, Andrew C Evans, Scott W Gleave, Alexander R Gromadzki, G. Learmonth","doi":"10.1109/SIEDS.2019.8735589","DOIUrl":null,"url":null,"abstract":"Our client, S&P Global, is a leading provider of cross-industry data products, whose success is largely dependent on the timeliness and quality of its data. The company relies heavily on manual search across a variety of public documents to update internal records, making workflow prioritization an important component to the timeliness of its value proposition. Given the broad scope of prioritizing a highly granular workflow, our team aimed to leverage operational metadata at the lowest level: information extraction. Rather than parsing documents themselves, we aimed to preserve parsimony in developing a model capable of providing actionable insight towards workflow optimization. The selected model was trained using gradient decision tree-boosting with a logistic output, predicting the probability of task success. By combining a number of previously unused features, we were able to classify tasks that resulted in an update to any of our client's expansive datasets. The classification accuracy was measured with a ROC-AUC and the recall for the positive outcome class. Given the 98% F1 score achieved predicting at this level, we constructed a priority score, at a higher level of granularity, where the implementation of a rating system is of more practical use to our client in scheduling. The model was trained on our client's financial domain data from 2018, with hopes of generalizing our findings to other domains in the future.","PeriodicalId":265421,"journal":{"name":"2019 Systems and Information Engineering Design Symposium (SIEDS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Machine Learning Approach to Workflow Prioritization\",\"authors\":\"Niharika R Bollumpally, Andrew C Evans, Scott W Gleave, Alexander R Gromadzki, G. Learmonth\",\"doi\":\"10.1109/SIEDS.2019.8735589\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Our client, S&P Global, is a leading provider of cross-industry data products, whose success is largely dependent on the timeliness and quality of its data. The company relies heavily on manual search across a variety of public documents to update internal records, making workflow prioritization an important component to the timeliness of its value proposition. Given the broad scope of prioritizing a highly granular workflow, our team aimed to leverage operational metadata at the lowest level: information extraction. Rather than parsing documents themselves, we aimed to preserve parsimony in developing a model capable of providing actionable insight towards workflow optimization. The selected model was trained using gradient decision tree-boosting with a logistic output, predicting the probability of task success. By combining a number of previously unused features, we were able to classify tasks that resulted in an update to any of our client's expansive datasets. The classification accuracy was measured with a ROC-AUC and the recall for the positive outcome class. Given the 98% F1 score achieved predicting at this level, we constructed a priority score, at a higher level of granularity, where the implementation of a rating system is of more practical use to our client in scheduling. The model was trained on our client's financial domain data from 2018, with hopes of generalizing our findings to other domains in the future.\",\"PeriodicalId\":265421,\"journal\":{\"name\":\"2019 Systems and Information Engineering Design Symposium (SIEDS)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Systems and Information Engineering Design Symposium (SIEDS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIEDS.2019.8735589\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Systems and Information Engineering Design Symposium (SIEDS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIEDS.2019.8735589","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们的客户S&P Global是跨行业数据产品的领先供应商,其成功在很大程度上取决于其数据的及时性和质量。该公司严重依赖于手动搜索各种公共文档来更新内部记录,这使得工作流优先级成为其价值主张及时性的重要组成部分。考虑到高度细粒度工作流优先级的广泛范围,我们的团队的目标是在最低级别上利用操作元数据:信息提取。我们的目标不是解析文档本身,而是在开发能够为工作流优化提供可操作的洞察的模型时保持简约性。选择的模型使用梯度决策树增强和逻辑输出进行训练,预测任务成功的概率。通过结合许多以前未使用的特性,我们能够对导致任何客户扩展数据集更新的任务进行分类。用ROC-AUC和阳性结果类别的召回率来测量分类准确性。考虑到98%的F1分数在这个级别上实现了预测,我们在更高的粒度级别上构建了一个优先级分数,在这个级别上,评级系统的实现对我们的客户在调度中有更实际的用处。该模型是在客户2018年的金融领域数据上进行训练的,希望在未来将我们的发现推广到其他领域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Machine Learning Approach to Workflow Prioritization
Our client, S&P Global, is a leading provider of cross-industry data products, whose success is largely dependent on the timeliness and quality of its data. The company relies heavily on manual search across a variety of public documents to update internal records, making workflow prioritization an important component to the timeliness of its value proposition. Given the broad scope of prioritizing a highly granular workflow, our team aimed to leverage operational metadata at the lowest level: information extraction. Rather than parsing documents themselves, we aimed to preserve parsimony in developing a model capable of providing actionable insight towards workflow optimization. The selected model was trained using gradient decision tree-boosting with a logistic output, predicting the probability of task success. By combining a number of previously unused features, we were able to classify tasks that resulted in an update to any of our client's expansive datasets. The classification accuracy was measured with a ROC-AUC and the recall for the positive outcome class. Given the 98% F1 score achieved predicting at this level, we constructed a priority score, at a higher level of granularity, where the implementation of a rating system is of more practical use to our client in scheduling. The model was trained on our client's financial domain data from 2018, with hopes of generalizing our findings to other domains in the future.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信