Discovering robust knowledge from dynamic closed-world data

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

  • Affiliations:
  • Information Sciences Institute and Department of Computer Science, University of Southern California, Marina del Rey, CA;Information Sciences Institute and Department of Computer Science, University of Southern California, Marina del Rey, CA

  • Venue:
  • AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many applications of knowledge discovery require the knowledge to be consistent with data. Examples include discovering rules for query optimization, database integration, decision support, etc. However, databases usually change over time and make machine-discovered knowledge inconsistent with data. Useful knowledge should be robust against database changes so that it is unlikely to become inconsistent after database changes. This paper defines this notion of robustness, describes how to estimate the robustness of Horn-clause rules in closed-world databases, and describes how the robustness estimation can be applied in rule discovery systems.