Abstract

This paper introduces a hybrid approach for rule discovery in databases in an environment with uncertainty and incompleteness. We first create an appropriate relationship between deductive reasoning and stochastic process, and extend the relationship for including abduction. Then, we define a Generalization Distribution Table (GDT), which is a variant of transition matrix in stochastic process, as a hypothesis search space for generalization, and describe that the GDT can be represented by knowledge-oriented networks. Furthermore, we describe a discovery process based on the network representation. Finally, we introduce some extension for making our approach more useful, and discuss some problems for real applications. We discuss inductive methods from the viewpoint of the value of information, and describe that the main features of our approach are: (1) the uncertainty of a rule, including its ability to predict possible instances, can be explicitly represented in the strength of the rule, (2) noisy data and data change can be handled effectively, (3) biases can be flexibly selected and background knowledge can be used in the discovery process for constraint and search control, and (4) if-then rules can be discovered in an evolutionary, parallel-distributed cooperative mode.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.