Discovering Robust Knowledge from Databases that Change

  • Authors:
  • Chun-Nan Hsu;Craig A. Knoblock

  • Affiliations:
  • Department of Computer Science and Engineering, Arizona State University, PO Box 875406, Tempe, AZ 85287, USA. E-mail: chunnan@asu.edu;Information Sciences Institute and Department of Computer Science, University of Southern California, 4676 Admiralty Way, Marina del Rey, CA 90292, USA. E-mail: knoblock@isi.edu

  • Venue:
  • Data Mining and Knowledge Discovery
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many applications of knowledge discovery and data mining such asrule discovery for semantic query optimization, database integration anddecision support, require the knowledge to be consistent with the data.However, databases usually change over time and make machine-discoveredknowledge inconsistent. Useful knowledge should be robustagainst database changes so that it is unlikely to become inconsistent afterdatabase updates. This paper defines this notion of robustness in thecontext of relational databases and describes how robustness of first-order Horn-clause rules can be estimated. Experimental results showthat our estimation approach can accurately identify robust rules. We alsopresent a rule antecedent pruning algorithm that improves the robustness andapplicability of machine discovered rules to demonstrate the usefulness ofrobustness estimation.