Fast rule extraction with binary-coded relations
Roman Pindur, Robert Susmaga · Intelligent Data Analysis · 2003
The induction of rules is one of the key issues of the Rough Sets Theory (RST). Generally, this problem is equivalent to finding prime implicants of a Boolean function, which is an NP-hard combinatorial problem. In practice, the NP-hardness makes sol