.png){kind=icon}
Return
On solving the continuous data editing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/0305-0548(96)81769-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
FRAMEWORK
AXIS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
ShareSaveShareSave
View more