THE MFFP‐TREE FUZZY MINING ALGORITHM TO DISCOVER COMPLETE LINGUISTIC FREQUENT ITEMSETS. (11th September 2012)

• Record Type: Journal Article
• Authors: Hong, Tzung‐Pei; Lin, Chun‐Wei; Lin, Tsung‐Ching
• Is Part Of: Computational intelligence. Volume 30:Number 1(2014:Feb.)
• Page Start: 145
• Page End: 166
• Publication Date: 2012-09-11
• Subjects: Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/j.1467-8640.2012.00467.x
• Languages: English
• ISSNs: 0824-7935

Abstract

<abstract abstract-type="main" xml:lang="en"> <title> <x xml:space="preserve">Abstract</x> </title> <p>Recently, mining useful information and knowledge from transactions is evolving into an important research issue. Many algorithms have thus been proposed for mining association rules based on items with binary values. Transactions with quantitative values are, however, also commonly seen in real‐world applications. The fuzzy frequent‐pattern tree (FP tree) algorithm has been proposed for extracting fuzzy frequent itemsets from quantitative transactions. Only the term with the maximum cardinality in later processes is used, making the number of fuzzy regions processed equal to the number of original items, which reduces the processing time. In real world applications, however, multiple fuzzy regions of an item produce better fuzzy association rules than those obtained using a single region. In this paper, the multiple fuzzy FP tree (MFFP tree) algorithm is proposed for mining fuzzy frequent itemsets from transactions with quantitative values. When extending the FP‐tree structure to handle fuzzy data, the processing becomes much more complex than that for the original FP‐tree structure since the fuzzy intersection in each transaction has to be handled. The MFFP‐tree construction algorithm is designed and the MFFP‐growth mining approach is proposed for mining the fuzzy frequent itemsets from the tree structure. Experiments were conducted to evaluate the performance of the proposed approach.</p> </abstract>