• Aug 09, 2018 News![CFP] The annual meeting of IJFCC Editorial Board, ICCTD 2019, will be held in Prague, Czech Republic during March 2-4, 2019.   [Click]
  • Aug 09, 2018 News!IJFCC Vol. 6, No. 1-No. 3 has been indexed by EI (Inspec).   [Click]
  • Dec 24, 2018 News!The papers published in Vol.7, No.1-No.2 have all received dois from Crossref.
General Information
    • ISSN: 2010-3751
    • Frequency: Bimonthly (2012-2016); Quarterly (Since 2017)
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Mohamed Othman
    • Executive Editor: Ms. Cherry L. Chan
    • Abstracting/ Indexing: Google Scholar,  Crossref, Electronic Journals LibraryEI (INSPEC, IET), etc.
    • E-mail:  ijfcc@ejournal.net 
Prof. Mohamed Othman
Department of Communication Technology and Network Universiti Putra Malaysia, Malaysia
It is my honor to be the editor-in-chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.
IJFCC 2012 Vol.1(2): 138-141 ISSN: 2010-3751
DOI: 10.7763/IJFCC.2012.V1.36

Mining Associative Classification without Candidate Rules

Panida Songram

Abstract—Associative classification is a combination of association rule mining and classification for prediction. For mining associative classification, traditional algorithms generate the complete set of association rules, and then use a minimum confidence threshold to select interesting rules for classification. If the number of association rules is very large, it is time consuming to select only the interesting rules. In this paper, a new algorithm, called TOPAC (Top Associative Classification), is proposed to solve the problem. The TOPAC algorithm directly produces the interesting rules without the generation of candidate rules. Moreover, it discovers the interesting rules based on frequent closed itemsets to reduce the redundancy rules.

Index Terms—Associative classification, association rule, closed itemset, high confidence.

Panida Songram is with Department of Computer Science, Faculty of Informatics, Mahasarakham University, Mahasarakham, 44150, Thailand.


Cite: Panida Songram, "Mining Associative Classification without Candidate Rules," International Journal of Future Computer and Communication vol. 1, no. 2, pp. 138-141, 2012.

Copyright © 2008-2018. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net