DocumentCode :
3219482
Title :
Decomposition of multiple-valued relations
Author :
Perkowski, M. ; Marek-Sadowska, M. ; Jozwiak, L. ; Luba, T. ; Grygiel, S. ; Nowicka, M. ; Malvi, R. ; Wang, Z. ; Zhang, J.S.
Author_Institution :
Dept. of Electr. Eng., Portland State Univ., OR, USA
fYear :
1997
fDate :
28-30 May 1997
Firstpage :
13
Lastpage :
18
Abstract :
This paper presents a new decomposition problem: decomposition of multi-valued (MV) relations, and a method of its solution. Decomposition is non-disjoint and multi-level. A fundamental difference in decomposition of MV functions and MV relations is discussed: the column (cofactor) pair compatibility translates to the group compatibility for functions, but not for relations. This makes the decomposition of relations more difficult. The method is especially efficient for strongly unspecified data typical for Machine Learning (ML). It is implemented in program GUD-MV.
Keywords :
learning (artificial intelligence); multivalued logic; cofactor pair compatibility; group compatibility; machine learning; multiple-valued relations decomposition; program GUD-MV; strongly unspecified data; Application software; Circuit synthesis; Explosions; Machine learning; Switching circuits; Telecommunications;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multiple-Valued Logic, 1997. Proceedings., 1997 27th International Symposium on
Conference_Location :
Antigonish, NS, Canada
Print_ISBN :
0-8186-7910-7
Type :
conf
DOI :
10.1109/ISMVL.1997.601367
Filename :
601367
Link To Document :
بازگشت