International Journal of Computer Science and Informatics


Classification based on predictive association rules (CPAR) is a kind of association classification methods which combines the advantages of both associative classification and traditional rule-based classification. For rule generation, CPAR is more efficient than traditional rule-based classification because much repeated calculation is avoided and multiple literals can be selected to generate multiple rules simultaneously. CPAR inherits the basic ideas of FOIL (First Order Inductive Learner) algorithm and PRM (Predictive Rule Mining) algorithm in rule generation. It integrates the features of associative classification in predictive rule analysis. In comparison of FOIL, PRM algorithm usually generates more rules. PRM uses concept of lowering weights rather than removing tuple if tuple is satisfied by the rule. The distinction between CPAR and PRM is that instead of choosing only the attribute that displays the best gain on each iteration CPAR may choose a number of attributes if those attributes have gain close to best gain.





To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.