An efficient tree-based fuzzy data mining approach

Chun Wei Lin, Tzung Pei Hong, Wen-Hsiang Lu

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

In the past, many algorithms were proposed for mining association rules, most of which were based on items with binary values. In this paper, a novel tree structure called the compressed fuzzy frequent pattern tree (CFFP tree) is designed to store the related information in the fuzzy mining process. A mining algorithm called the CFFP-growth mining algorithm is then proposed based on the tree structure to mine the fuzzy frequent itemsets. Each node in the tree has to keep the membership value of the contained item as well as the membership values of its super-itemsets in the path. The database scans can thus be greatly reduced with the help of the additional information. Experimental results also compare the performance of the proposed approach both in the execution time and the number of tree nodes at two different numbers of regions, respectively.

Original languageEnglish
Pages (from-to)150-157
Number of pages8
JournalInternational Journal of Fuzzy Systems
Volume12
Issue number2
Publication statusPublished - 2010 Jun 1

Fingerprint

Fuzzy Data
Data mining
Data Mining
Tree Structure
Mining
Process Mining
Frequent Pattern
Frequent Itemsets
Association Rule Mining
Association rules
Vertex of a graph
Execution Time
Binary
Path
Experimental Results

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Artificial Intelligence

Cite this

Lin, Chun Wei ; Hong, Tzung Pei ; Lu, Wen-Hsiang. / An efficient tree-based fuzzy data mining approach. In: International Journal of Fuzzy Systems. 2010 ; Vol. 12, No. 2. pp. 150-157.
@article{c128f217ad504257a2ee1d851ec09201,
title = "An efficient tree-based fuzzy data mining approach",
abstract = "In the past, many algorithms were proposed for mining association rules, most of which were based on items with binary values. In this paper, a novel tree structure called the compressed fuzzy frequent pattern tree (CFFP tree) is designed to store the related information in the fuzzy mining process. A mining algorithm called the CFFP-growth mining algorithm is then proposed based on the tree structure to mine the fuzzy frequent itemsets. Each node in the tree has to keep the membership value of the contained item as well as the membership values of its super-itemsets in the path. The database scans can thus be greatly reduced with the help of the additional information. Experimental results also compare the performance of the proposed approach both in the execution time and the number of tree nodes at two different numbers of regions, respectively.",
author = "Lin, {Chun Wei} and Hong, {Tzung Pei} and Wen-Hsiang Lu",
year = "2010",
month = "6",
day = "1",
language = "English",
volume = "12",
pages = "150--157",
journal = "International Journal of Fuzzy Systems",
issn = "1562-2479",
publisher = "Chinese Fuzzy Systems Association",
number = "2",

}

An efficient tree-based fuzzy data mining approach. / Lin, Chun Wei; Hong, Tzung Pei; Lu, Wen-Hsiang.

In: International Journal of Fuzzy Systems, Vol. 12, No. 2, 01.06.2010, p. 150-157.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An efficient tree-based fuzzy data mining approach

AU - Lin, Chun Wei

AU - Hong, Tzung Pei

AU - Lu, Wen-Hsiang

PY - 2010/6/1

Y1 - 2010/6/1

N2 - In the past, many algorithms were proposed for mining association rules, most of which were based on items with binary values. In this paper, a novel tree structure called the compressed fuzzy frequent pattern tree (CFFP tree) is designed to store the related information in the fuzzy mining process. A mining algorithm called the CFFP-growth mining algorithm is then proposed based on the tree structure to mine the fuzzy frequent itemsets. Each node in the tree has to keep the membership value of the contained item as well as the membership values of its super-itemsets in the path. The database scans can thus be greatly reduced with the help of the additional information. Experimental results also compare the performance of the proposed approach both in the execution time and the number of tree nodes at two different numbers of regions, respectively.

AB - In the past, many algorithms were proposed for mining association rules, most of which were based on items with binary values. In this paper, a novel tree structure called the compressed fuzzy frequent pattern tree (CFFP tree) is designed to store the related information in the fuzzy mining process. A mining algorithm called the CFFP-growth mining algorithm is then proposed based on the tree structure to mine the fuzzy frequent itemsets. Each node in the tree has to keep the membership value of the contained item as well as the membership values of its super-itemsets in the path. The database scans can thus be greatly reduced with the help of the additional information. Experimental results also compare the performance of the proposed approach both in the execution time and the number of tree nodes at two different numbers of regions, respectively.

UR - http://www.scopus.com/inward/record.url?scp=77954870627&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954870627&partnerID=8YFLogxK

M3 - Article

VL - 12

SP - 150

EP - 157

JO - International Journal of Fuzzy Systems

JF - International Journal of Fuzzy Systems

SN - 1562-2479

IS - 2

ER -