Linguistic data mining with fuzzy FP-trees

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

Research output: Contribution to journalArticle

36 Citations (Scopus)

Abstract

Due to the increasing occurrence of very large databases, mining useful information and knowledge from transactions is evolving into an important research area. In the past, many algorithms were proposed for mining association rules, most of which were based on items with binary values. Transactions with quantitative values are, however, commonly seen in real-world applications. In this paper, the frequent fuzzy pattern tree (fuzzy FP-tree) is proposed for extracting frequent fuzzy itemsets from the transactions with quantitative values. When extending the FP-tree to handle fuzzy data, the processing becomes much more complex than the original since fuzzy intersection in each transaction has to be handled. The fuzzy FP-tree construction algorithm is thus designed, and the mining process based on the tree is presented. Experimental results on three different numbers of fuzzy regions also show the performance of the proposed approach.

Original languageEnglish
Pages (from-to)4560-4567
Number of pages8
JournalExpert Systems With Applications
Volume37
Issue number6
DOIs
Publication statusPublished - 2010 Jun 1

Fingerprint

Linguistics
Data mining
Association rules
Processing

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Computer Science Applications
  • Artificial Intelligence

Cite this

Lin, Chun Wei ; Hong, Tzung Pei ; Lu, Wen-Hsiang. / Linguistic data mining with fuzzy FP-trees. In: Expert Systems With Applications. 2010 ; Vol. 37, No. 6. pp. 4560-4567.
@article{da6d0c9c1c8a4b18abf68261fd4f4f70,
title = "Linguistic data mining with fuzzy FP-trees",
abstract = "Due to the increasing occurrence of very large databases, mining useful information and knowledge from transactions is evolving into an important research area. In the past, many algorithms were proposed for mining association rules, most of which were based on items with binary values. Transactions with quantitative values are, however, commonly seen in real-world applications. In this paper, the frequent fuzzy pattern tree (fuzzy FP-tree) is proposed for extracting frequent fuzzy itemsets from the transactions with quantitative values. When extending the FP-tree to handle fuzzy data, the processing becomes much more complex than the original since fuzzy intersection in each transaction has to be handled. The fuzzy FP-tree construction algorithm is thus designed, and the mining process based on the tree is presented. Experimental results on three different numbers of fuzzy regions also show the performance of the proposed approach.",
author = "Lin, {Chun Wei} and Hong, {Tzung Pei} and Wen-Hsiang Lu",
year = "2010",
month = "6",
day = "1",
doi = "10.1016/j.eswa.2009.12.052",
language = "English",
volume = "37",
pages = "4560--4567",
journal = "Expert Systems with Applications",
issn = "0957-4174",
publisher = "Elsevier Limited",
number = "6",

}

Linguistic data mining with fuzzy FP-trees. / Lin, Chun Wei; Hong, Tzung Pei; Lu, Wen-Hsiang.

In: Expert Systems With Applications, Vol. 37, No. 6, 01.06.2010, p. 4560-4567.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Linguistic data mining with fuzzy FP-trees

AU - Lin, Chun Wei

AU - Hong, Tzung Pei

AU - Lu, Wen-Hsiang

PY - 2010/6/1

Y1 - 2010/6/1

N2 - Due to the increasing occurrence of very large databases, mining useful information and knowledge from transactions is evolving into an important research area. In the past, many algorithms were proposed for mining association rules, most of which were based on items with binary values. Transactions with quantitative values are, however, commonly seen in real-world applications. In this paper, the frequent fuzzy pattern tree (fuzzy FP-tree) is proposed for extracting frequent fuzzy itemsets from the transactions with quantitative values. When extending the FP-tree to handle fuzzy data, the processing becomes much more complex than the original since fuzzy intersection in each transaction has to be handled. The fuzzy FP-tree construction algorithm is thus designed, and the mining process based on the tree is presented. Experimental results on three different numbers of fuzzy regions also show the performance of the proposed approach.

AB - Due to the increasing occurrence of very large databases, mining useful information and knowledge from transactions is evolving into an important research area. In the past, many algorithms were proposed for mining association rules, most of which were based on items with binary values. Transactions with quantitative values are, however, commonly seen in real-world applications. In this paper, the frequent fuzzy pattern tree (fuzzy FP-tree) is proposed for extracting frequent fuzzy itemsets from the transactions with quantitative values. When extending the FP-tree to handle fuzzy data, the processing becomes much more complex than the original since fuzzy intersection in each transaction has to be handled. The fuzzy FP-tree construction algorithm is thus designed, and the mining process based on the tree is presented. Experimental results on three different numbers of fuzzy regions also show the performance of the proposed approach.

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

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

U2 - 10.1016/j.eswa.2009.12.052

DO - 10.1016/j.eswa.2009.12.052

M3 - Article

AN - SCOPUS:77249107501

VL - 37

SP - 4560

EP - 4567

JO - Expert Systems with Applications

JF - Expert Systems with Applications

SN - 0957-4174

IS - 6

ER -