Quine-McCluskey Classification

In this paper the Karnaugh and Quine-McCluskey methods are used for symbolic classification problem, and then these methods are compared with other famous available methods. Because the data in classification problem is very large, some changes should be applied in the original Quine-McCluskey (QMC) algorithm. We proposed a new algorithm that applies the QMC algorithm greedily calling it GQMC. It is surprising that GQMC results are most of the time equal to QMC. GQMC is still very slow classifier and it can be used when the number of attributes of the data is small, and the ratio of training data to the all possible data is high.

• Type: Conference
• Year: 2007
• Where: AICCSA
• Authors: Javad Safaei, Hamid Beigy
• Keywords: AICCSA 2007, Classification Problem, Famous Available Methods, Hardware, Symbolic Classification Problem