A novel many‐valued decomposition within the framework of lossless reconstructability analysis (RA) is presented. In previous work, modified reconstructability analysis (MRA) was applied to Boolean functions, where it was shown that most Boolean functions not decomposable using conventional reconstructability analysis (CRA) are decomposable using MRA. Also, it was previously shown that whenever decomposition exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. In this paper, MRA is extended to many‐valued logic functions, and logic structures that correspond to such decomposition are developed. It is shown that many‐valued MRA can decompose many‐valued functions when CRA fails to do so. Since real‐life data are often many‐valued, this new decomposition can be useful for machine learning and data mining. Many‐valued MRA can also be applied for the decomposition of relations.
CitationDownload as .RIS
Emerald Group Publishing Limited
Copyright © 2004, Emerald Group Publishing Limited