Current database technology involves processing a large volume of data in order to discover new knowledge. The high volume of data makes the discovery process computationally expensive. In addition, real-world databases tend to be incomplete, redundant and inconsistent which could lead to discovery of redundant and inconsistent knowledge. We propose use of domain knowledge to reduce the size of the database being considered for discovery and to optimize the hypothesis (representing the pattern to be discovered) by eliminating implied, unnecessary and redundant conditions from the hypothesis. The benefits can be greater efficiency and the discovery of more meaningful, non-redundant, non-trivial and consistent rules. Experimental results are provided and analyzed.
Complete Chapter List
John A. Hoxmeier
Coral Calero, Mario Piattini, Marcela Genero
Anirban Bhaumik, Deepti Dixit, Roberto Galnares, Aparna Krishna, Michael Bieber, Vincent Oria, Firas Alljalad
M. Mehdi Owrang O.
Ladjel Bellatreche, Kamalakar Karlapalem, Mukesh Mohania
Manoj K. Singh, Mahesh S. Raisinghani
Esperenza Marcos, Paloma Caceres
Laura C. Rivero, Jorge H. Doorn, Viviana E. Ferraggine
Cheryl L. Dunn, Severin V. Grabiski
Eduardo Fernandez-Medina Paton, Mario G. Piattini
David J. Paper, James A. Rodger, Parag C. Pendharkar