Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/39962
DC Field | Value | |
---|---|---|
dc.title | IntelliClean: A knowledge-based intelligent data cleaner | |
dc.contributor.author | Lee, M.L. | |
dc.contributor.author | Ling, T.W. | |
dc.contributor.author | Low, W.L. | |
dc.date.accessioned | 2013-07-04T07:53:33Z | |
dc.date.available | 2013-07-04T07:53:33Z | |
dc.date.issued | 2000 | |
dc.identifier.citation | Lee, M.L.,Ling, T.W.,Low, W.L. (2000). IntelliClean: A knowledge-based intelligent data cleaner. Proceeding of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining : 290-294. ScholarBank@NUS Repository. | |
dc.identifier.isbn | 1581132336 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/39962 | |
dc.description.abstract | Existing data cleaning methods work on the basis of computing the degree of similarity between nearby records in a sorted database. High recall is achieved by accepting records with low degrees of similarity as duplicates, at the cost of lower precision. High precision is achieved analogously at the cost of lower recall. This is the recall-precision dilemma. In this paper, we propose a generic knowledge-based framework for effective data cleaning that implements existing cleaning strategies and more. We develop a new method to compute transitive closure under uncertainty which handles the merging of groups of inexact duplicate records. Experimental results show that this framework can identify duplicates and anomalies with high recall and precision. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.sourcetitle | Proceeding of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining | |
dc.description.page | 290-294 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.