DECOMPOSITION OF RELATIONS A NEW APPROACH TO CONSTRUCTIVE.pptVIP

DECOMPOSITION OF RELATIONS: A NEW APPROACH TOCONSTRUCTIVE INDUCTION IN MACHINE LEARNING ANDDATA MINING - AN OVERVIEW Marek Perkowski Portland State University This is a review paper that presents work done at Portland State University and associated groups in years 1989 - 2001 in the area of functional decomposition of multi-valued functions and relations, as well as some applications of these methods. Short Introduction: multiple-valued logic Types of Logical Synthesis Sum of Products Decision Diagrams Functional Decomposition Pros and cons A Standard Map of function ‘z’ Decomposition of Multi-Valued Relations Forming a CCG from a K-Map clique partitioning example. Maximal clique covering example. Cost Function DFC = Decomposed Function Cardinality Example of DFC calculation New Complexity Measures Comparison of RC before and after decomposition RCbefore = (3*3*3)*(log24) = 54 RCafter = [(3)*(log22)] + [(2*3*3)*(log24)] = 3 + 36 = 39 Two-Level Curtis Decomposition Decomposition Algorithm Find a set of partitions (Ai, Bi) of input variables (X) into free variables (A) and bound variables (B) For each partitioning, find decompositionF(X) = Hi(Gi(Bi), Ai) such that column multiplicity is minimal, and calculate DFC Repeat the process for all partitioning until the decomposition with minimum DFC is found. Algorithm Requirements Since the process is iterative, it is of high importance that minimization of the column multiplicity index is done as fast as possible. At the same time, for a given partitioning, it is important that the value of the column multiplicity is as close to the absolute minimum value Column Multiplicity Column Multiplicity-other example Decomposition of multiple-valued relation Discovering new concepts Discovering concepts useful for purchasing a car Variable ordering Vacuous variables removing Variables b and d reduce uncertainty of y to 0 which means they provide all the information necessary for determination of the