The K1-map reduction for pattern classifications
Tsong-Chih Hsu, Sheng‐De Wang · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1997
A shortcut hand-reduction method known as the Karnaugh map (K map) is an efficient way of reducing Boolean functions to a minimum form for the purpose of minimizing hardware requirements. In this paper, by applying the prime group and the essential prime group concepts of the K maps to pattern classification problems, the K1-map reduction method is proposed. The K1-map reduction method can be used to design restricted Coulomb energy networks and to determine the number of hidden units problems in a systematic manner.