Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Jeya Sutha, M.a; * | Ramesh Dhanaseelan, F.a | Felix Nes Mabel, M.b | Vijumon, V.T.c
Affiliations: [a] Department of Computer Applications, St. Xavier’s Catholic College of Engineering, Chunkankadai, Tamil Nadu, India | [b] Department of Mathematics, St. Xavier’s Catholic College of Engineering, Chunkankadai, Tamil Nadu, India | [c] Department of Mechanical Engineering, St. Xavier’s Catholic College of Engineering, Chunkankadai, Tamil Nadu, India
Correspondence: [*] Corresponding author. M. Jeya Sutha, Department of Computer Applications, St. Xavier’s Catholic College of Engineering, Chunkankadai, K.K. Dist., Tamil Nadu, India. E-mail: jayasuthaus@rediffmail.com.
Abstract: Association rule mining (ARM) is an important research issue in the field of data mining that aims to find relations among different items in binary databases. The conventional ARM algorithms consider the frequency of the items in binary databases, which is not sufficient for real time applications. In this paper, a novel hash table based Type-2 fuzzy mining algorithm (T2FM) with an efficient pruning strategy is presented for discovering multiple fuzzy frequent itemsets from quantitative databases. The algorithm employs a hash table based structure for efficient storage and retrieval of item/itemset which reduces the search efficiency to O(1) or constant time. Previously, type-2 based Apriori and FP-growth based fuzzy frequent itemsets mining were proposed, which required large amounts of computation and a greater number of candidate generation and processing. Meanwhile, the proposed approach reduces a huge amount of computation by finding the common keys before the actual intersection operation takes place. An efficient pruning strategy is proposed to avoid unpromising candidates in order to speed up the computations. Several experiments are carried out to verify the efficiency of the approach in terms of runtime and memory for different minimum support threshold and the results show that the designed approach provides better performance compared to the state-of-the-art algorithms.
Keywords: Data mining, type-2 fuzzy set, quantitative dataset, fuzzy frequent itemsets, multiple linguistic terms
DOI: 10.3233/JIFS-232918
Journal: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 2, pp. 3231-3244, 2024
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl