General Information
    • ISSN: 1793-8201 (Print), 2972-4511 (Online)
    • Abbreviated Title: Int. J. Comput. Theory Eng.
    • Frequency: Quarterly
    • DOI: 10.7763/IJCTE
    • Editor-in-Chief: Prof. Mehmet Sahinoglu
    • Associate Editor-in-Chief: Assoc. Prof. Alberto Arteta, Assoc. Prof. Engin Maşazade
    • Managing Editor: Ms. Mia Hu
    • Abstracting/Indexing: Scopus (Since 2022), INSPEC (IET), CNKI,  Google Scholar, EBSCO, etc.
    • Average Days from Submission to Acceptance: 192 days
    • E-mail: ijcte@iacsitp.com
    • Journal Metrics:

Editor-in-chief
Prof. Mehmet Sahinoglu
Computer Science Department, Troy University, USA
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.

IJCTE 2012 Vol.4(5): 793-797 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2012.V4.580

Fast Mining of Fuzzy Association Rules

Amir Ebrahimzadeh and Reza Sheibani

Abstract—Fuzzy association rules described by the natural language are well suited for the thinking of human subject and will help to increase the flexibility for supporting user in making decisions or designing the fuzzy systems. However, the efficiency of algorithms needs to be improved to handle real-world large datasets. In this paper, we present an efficient algorithm named fuzzy cluster-based (FCB) along with its parallel version named parallel fuzzy cluster-based (PFCB). The FCB method is to create cluster tables by scanning the database once, and then clustering the transaction records to the i-th cluster table, where the length of a record is i. moreover, the fuzzy large itemsets are generated by contrasts with the partial cluster tables. Similarly, the PFCB method is to create cluster tables by scanning the database once, and then clustering the transaction records to the i-th cluster table, which is on the i-th processor, where the length of a record is i. moreover, the large itemsets are generated by contrasts with the partial cluster tables. Then, to calculate the fuzzy support of the candidate itemsets at each level, each processor calculates the support of the candidate itemsets in its own cluster and forwards the result to the coordinator. The final fuzzy support of the candidate itemsets is then calculated from these results in the coordinator. We have performed extensive experiments and compared the performance of our algorithms with two of the best existing algorithms.

Index Terms—Fuzzy association rules, cluster table, parallel.

A. Ebrahimzadeh is with the Sama technical and vocational training college, Islamic Azad University, Mashhad branch, Mashhad, Iran (e-mail: ebrahimzadehamir@gmail.com).
R. Sheibani is with the Department of Computer, Mashhad Branch, Islamic Azad University, Mashhad, Iran (e-mail: reza.shni@gmail.com)

[PDF]

Cite: Amir Ebrahimzadeh and Reza Sheibani, "Fast Mining of Fuzzy Association Rules," International Journal of Computer Theory and Engineering vol. 4, no. 5, pp. 793-797, 2012.


Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.