Query processing over incomplete autonomous databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
An iterative refinement approach for data cleaning
Intelligent Data Analysis
Missing Values: Proposition of a Typology and Characterization with an Association Rule-Based Model
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
The VLDB Journal — The International Journal on Very Large Data Bases
Yet another approach for completing missing values
CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
Mining rules from an incomplete dataset with a high missing rate
Expert Systems with Applications: An International Journal
WebPut: efficient web-based data imputation
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Hi-index | 0.00 |
We present in this paper a new method for completing missing data using the concept of association rules. The basic idea is that association rules describe the dependency relationships among data entries in a dataset where all data, including the missing ones, should hold the similar relationships. For a missing datum, we guess its possible value according to related association rules. A new completing procedure and a new evaluation function are developed and presented. The evaluation function is scored according to the support, confidence, and lift of association rules, which reasonably reflects the dependency relationships among existing and missing data. Experimental results show that our method is feasible in completing some incomplete datasets.