期刊
INTERNATIONAL JOURNAL OF FUZZY SYSTEMS
卷 19, 期 4, 页码 1032-1040出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s40815-016-0246-1
关键词
Fuzzy frequent itemsets; MFFI-Miner; Multiple regions; Fuzzy-list structure
类别
资金
- National Natural Science Foundation of China (NSFC) [61503092]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据