Using Tree Structure to Mine High Temporal Fuzzy Utility Itemsets

IEEE Access

Wei-Ming Huang¹  Katherine Shu-Min Li¹  Cheng-Yu Lin¹  Tzung-Pei Hong²  Leon Shyue-Liang Wang²  Jerry Chun-Wei Lin³ 

[1] Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan;Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan;Department of Computer Science, Electrical Engineering and Mathematical Sciences, Western Norway University of Applied Science, Bergen, Norway;

关键词: Fuzzy set;    quantitative database;    temporal fuzzy utility mining;    tree structure;    utility mining;   

DOI  :  10.1109/ACCESS.2020.3018155

来源: DOAJ

【 摘 要 】

Data mining is a critical technology for extracting valuable knowledge from databases. It has been used in many fields, like retail, finance, biology, etc. In computational intelligence, fuzzy logic has been applied in many intelligent systems widely because it is simple and similar to human inference. Fuzzy utility mining combines utility mining and fuzzy logic for getting linguistic utility knowledge. In this paper, we study a more challenging, complicated, but practical topic called temporal fuzzy utility data mining, which considers the temporal periods in transactions, purchased amounts, item profits, and understandable linguistic terms as important factors. Although an Apriori-based algorithm was proposed previously, its execution was not efficient. We thus use a modified tree structure based on the classical frequent-pattern tree to improve its performance. A tree-based mining algorithm is also proposed to mine temporal fuzzy utility itemsets from quantitative transactional databases. The tree structure is built to keep all temporal fuzzy utility 1-itemsets in a database. All the high temporal fuzzy utility itemsets in a database can be obtained by traversing the tree-based structure. The proposed algorithm gets the final results through two phases. In the first phase, a procedure like FP-Growth is used to find the candidate itemsets. In the second phase, the temporal fuzzy utility database is scanned to decide whether the candidate itemsets are desired. Experimental results show that the proposed algorithm is superior to the existing algorithm for temporal fuzzy utility mining in terms of processing time and used memory.

【 授权许可】

Unknown