Decomposition of multiple-valued relations

TitleDecomposition of multiple-valued relations
Publication TypeConference Paper
Year of Publication1997
AuthorsPerkowski, M, Marek-Sadowska, M, Jozwiak, L, Luba, T, Grygiel, S, Nowicka, M, Malvi, R, Wang, Z, Zhang, JS
Conference NameMultiple-Valued Logic, 1997. Proceedings., 1997 27th International Symposium on
Date Publishedmay
Keywordscofactor pair compatibility, group compatibility, learning (artificial intelligence), machine learning, multiple-valued relations decomposition, multivalued logic, program GUD-MV, strongly unspecified data
AbstractThis 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
DOI10.1109/ISMVL.1997.601367