Archive
Page >> Table
of Contents >> Abstract
27th
International Symposium on Multiple-Valued Logic (ISMVL '97)
p. 13 Decomposition of
multiple-valued relations M.
Perkowski, Dept. of Electr. Eng., Portland State Univ., OR,
USA M.
Marek-Sadowska, Dept. of Electr. Eng., Portland State Univ., OR,
USA L.
Jozwiak, Dept. of Electr. Eng., Portland State Univ., OR,
USA T.
Luba, Dept. of Electr. Eng., Portland State Univ., OR, USA S.
Grygiel, Dept. of Electr. Eng., Portland State Univ., OR,
USA M.
Nowicka, Dept. of Electr. Eng., Portland State Univ., OR,
USA R.
Malvi, Dept. of Electr. Eng., Portland State Univ., OR,
USA Z.
Wang, Dept. of Electr. Eng., Portland State Univ., OR, USA J.S.
Zhang, Dept. of Electr. Eng., Portland State Univ., OR,
USA
Full Article Text:
DOI Bookmark:
http://doi.ieeecomputersociety.org/10.1109/ISMVL.1997.601367
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. |
Additional Information |
Index Terms- learning (artificial
intelligence); multiple-valued relations decomposition;
cofactor pair compatibility; group compatibility; strongly
unspecified data; machine learning; program GUD-MV
Citation: M. Perkowski, M.
Marek-Sadowska, L. Jozwiak, T. Luba, S. Grygiel, M. Nowicka,
R. Malvi, Z. Wang, J.S. Zhang, "Decomposition of
multiple-valued relations," ismvl, p. 13, 27th
International Symposium on Multiple-Valued Logic (ISMVL
'97), 1997.
| |