TU Bergakademie Freiberg | Fakultät für Mathematik und Informatik

Logo IFI
3rd International Workshop Boolsche Probleme
Home Lehre Email

Abstracts

MINIMIZATION OF SUM OF CONTINUOUS­INPUT AND/OR IMPLICANT EXPRESSIONS FOR DATA MINING APPLICATIONS.

Marek Perkowski, Lech Jozwiak , and Craig Files
Dept. of Electrical Engineering, Portland State University,
Portland, Oregon 97207­0751, USA, Tel: 503­725­5411, Fax: 503­725­4882,
mperkows@ee.pdx.edu
Faculty of Electrical Engineering, Eindhoven University of Technology,
P.O. Box 513, EH 10.25, 5600 MB Eindhoven, The Netherlands,
Tel: +31.40.2473645, Fax: +31.40.2433066, lech@eb.ele.tue.nl

Abstract:
In many Data Mining applications the attributes are continuous (continuous input variables) and the decision values are a finite set of symbols (multi-valued output variables). In this paper we give an efficient algorithm for the minimization of Sum of Continuous-Input AND/OR implicants. Our expressions generalize the well-known Disjunctive Normal Forms to three-level structures with continuous inputs. They are compiled to rule-based programs. The network minimization uses the conditional graph coloring approach to solve the covering problem.



Inhalt:/ Content: Institut für Informatik
TU Bergakademie Freiberg
Gestaltung/ Layout: Webmaster
19. Oktober 1998