Rule storage for an efficient rule based inconsistency check
Date
2012
Authors
Natarajan, K.
Li, J.
Liu, J.
Koronios, A.
Editors
Soliman, K.S.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Innovation and Sustainable Competitive Advantage from Regional Development to World Economies Proceedings of the 18th International Business Information Management Association Conference, 2012 / Soliman, K.S. (ed./s), vol.4, pp.2053-2068
Statement of Responsibility
Conference Name
18th International-Business-Information-Management-Association Conference (9 May 2012 - 10 May 2012 : TURKEY, Istanbul)
Abstract
Data inconsistency is a key source of data quality problems. Rule based methods are a major means for inconsistency checking. Association rules have been used for this purpose. Time efficiency is very important for online checking. In this paper we utilize a tree structure for efficient storage and retrieval of rules; to reduce complexity and improve efficiency. In the present work we use a storage method called prefix tree (Trie) to store and retrieve rules for making predictions on a dirty dataset. Inconsistent values are identified from large, high dimensional data sets using a large ruleset with reduced complexity in comparison to the existing methods. The number of experiments is conducted using various real world data sets to show the efficiency of our model.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2012 IBIMA