Efficient Mining of Multiple Fuzzy Frequent Itemsets

Efficient Mining of Multiple Fuzzy Frequent Itemsets Traditional association-rule mining or frequent itemset mining only can handle binary databases, in which each item or attribute is represented as either 0 or 1. Several algorithms were developed extensively to discover fuzzy frequent itemsets by adopting the fuzzy set theory to the quantitative databases. Most of them considered the maximum scalar cardinality to find, at most, one represented item from the transformed linguistic terms. This paper presents an MFFI-Miner algorithm to mine the complete set of multiple fuzzy frequent itemsets (MFFIs) without candidate generation. An efficient fuzzy-list structure was designed to keep the essential information for mining process, which can greatly reduce the computation of a database scan. Two efficient pruning strategies are developed to reduce the search space, thus speeding up the mining process to discover MFFIs directly. Substantial experiments were conducted to compare the performance of the proposed algorithm to the state-of-the-art approaches in terms of execution time, memory usage, and node analysis. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Fuzzy Systems Springer Journals
Loading next page...
 
/lp/springer_journal/efficient-mining-of-multiple-fuzzy-frequent-itemsets-6R8nchquml
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2016 by Taiwan Fuzzy Systems Association and Springer-Verlag Berlin Heidelberg
Subject
Engineering; Computational Intelligence; Artificial Intelligence (incl. Robotics); Operations Research, Management Science
ISSN
1562-2479
eISSN
2199-3211
D.O.I.
10.1007/s40815-016-0246-1
Publisher site
See Article on Publisher Site

Abstract

Traditional association-rule mining or frequent itemset mining only can handle binary databases, in which each item or attribute is represented as either 0 or 1. Several algorithms were developed extensively to discover fuzzy frequent itemsets by adopting the fuzzy set theory to the quantitative databases. Most of them considered the maximum scalar cardinality to find, at most, one represented item from the transformed linguistic terms. This paper presents an MFFI-Miner algorithm to mine the complete set of multiple fuzzy frequent itemsets (MFFIs) without candidate generation. An efficient fuzzy-list structure was designed to keep the essential information for mining process, which can greatly reduce the computation of a database scan. Two efficient pruning strategies are developed to reduce the search space, thus speeding up the mining process to discover MFFIs directly. Substantial experiments were conducted to compare the performance of the proposed algorithm to the state-of-the-art approaches in terms of execution time, memory usage, and node analysis.

Journal

International Journal of Fuzzy SystemsSpringer Journals

Published: Sep 6, 2016

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off