Associative classi¯cation (AC) is a promising data mining approach that integrates classi¯cation and association rule discovery to build classi¯cation models (classi¯ers). In the last decade, several AC algorithms have been proposed such as Classi¯cation based Association (CBA), Classi¯cation based on Predicted Association Rule (CPAR), Multi-class Classi¯cation using Association Rule (MCAR), Live and Let Live (L 3 ) and others. These algorithms use di®erent procedures for rule learning, rule sorting, rule pruning, classi¯er building and class allocation for test cases. This paper sheds the light and critically compares common AC algorithms with reference to the abovementioned procedures. Moreover, data representation formats in AC mining are discussed along with potential new research directions.