arrow
返回

On solving the continuous data editing problem

delete1996-03-01
delete7
PRE
AI
R
Ragsdale, CT *
M
McKeown, PG
DOI:10.1016/0305-0548(96)81769-2delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The data editing problem is concerned with identifying the most likely source of errors in computerized data bases. Given a record that is known to fail one or more logical consistency edits, the objective is to determine the minimum (possibly weighted) number of fields that could be changed in order to correct the record. While this problem can easily be formulated as a pure fixed-charge problem, it can be extremely difficult to solve under certain data conditions. In this paper we show how a number of structural characteristics in this problem can be exploited to dramatically reduce the computational time required to solve particularly difficult data editing problems.
Keyword:
FRAMEWORK
AXIS
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

暂无机构信息
引用论文

引用论文

Aging, twinning, and perinatal outcomes
err2003-03-01
err0
errOAAI
errIsaac Blickstein; Louis G Keith
err分享
err收藏
err分享
err收藏
学者 查看更多内容