Two scalable algorithms for associative text classification

  • Yoon Y
  • Lee G
  • 23


    Mendeley users who have this article in their library.
  • 11


    Citations of this article.


Associative classification methods have been recently applied to various categorization tasks due to its simplicity and high accuracy. To improve the coverage for test documents and to raise classification accuracy, some associative classifiers generate a huge number of association rules during the mining step. We present two algorithms to increase the computational efficiency of associative classification: one to store rules very efficiently, and the other to increase the speed of rule matching, using all of the generated rules. Empirical results using three large-scale text collections demonstrate that the proposed algorithms increase the feasibility of applying associative classification to large-scale problems. © 2012 Elsevier Ltd. All rights reserved.

Author-supplied keywords

  • Association rule mining
  • Associative classification
  • Large-scale dataset
  • Text categorization

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Yongwook Yoon

  • Gary G. Lee

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free