Knowledge Discovery in Database: Induction Graph and Cellular Automaton

Rok, strany: 2007, 171 - 197

In this article we present the general architecture of a cellular machine, which makes it possible to reduce the size of induction graphs, and to optimize automatically the generation of symbolic rules. Our objective is to propose a tool for detecting and eliminating non relevant variables from the database. The goal, after acquisition by machine learning from a set of data, is to reduce the complexity of storage, thus to decrease the computing time. The objective of this work is to experiment a cellular machine for systems of inference containing rules. Our system relies upon the graphs generated by the SIPINA method. After an introduction aiming at positioning our contribution within the area of machine learning, we briefly present the SIPINA method for automatic retrieval of knowledge starting from data. We then describe our cellular system and the phase of knowledge post-processing, in particular the validation and the use of extracted knowledge. The presentation of our system is mostly done through an example taken from medical diagnosis.

ISO 690:

Atmani, B., Beldjilali, B. 2007. Knowledge Discovery in Database: Induction Graph and Cellular Automaton. In Computing and Informatics, vol. 26, no.2, pp. 171-197. 1335-9150.

APA:

Atmani, B., Beldjilali, B. (2007). Knowledge Discovery in Database: Induction Graph and Cellular Automaton. Computing and Informatics, 26(2), 171-197. 1335-9150.