Efficient representative pattern mining based on weight and maximality conditions. Issue 5 (28th June 2016)

• Record Type: Journal Article
• Authors: Yun, Unil; Lee, Gangin; Lee, Kyung‐Min
• Is Part Of: Expert systems. Volume 33:Issue 5(2016)
• Page Start: 439
• Page End: 462
• Publication Date: 2016-06-28
• Subjects: data mining -- tree and array structures -- weighted frequent pattern mining -- maximal frequent pattern mining; Expert systems (Computer science); 006.33
• DOI: 10.1111/exsy.12158
• Languages: English
• ISSNs: 0266-4720

Abstract

Abstract: As a core area in data mining, frequent pattern (or itemset) mining has been studied for a long time. Weighted frequent pattern mining prunes unimportant patterns and maximal frequent pattern mining discovers compact frequent patterns. These approaches contribute to improving mining performance by reducing the search space. However, we need to consider both the downward closure property and patterns' subset checking process when integrating these different methods in order to prevent unintended pattern losses. Moreover, it is also essential to extract valid patterns with faster runtime and less memory consumption. For this reason, in this paper, we propose more efficient maximal weighted frequent pattern (MWFP) mining approaches based on tree and array structures. We describe how to handle these problems more efficiently, maintaining the correctness of our method. We develop two types of maximal weighted frequent mining algorithms based on weight ascending order and support descending order and compare these two algorithms to conclude which is more suitable for MWFP mining. In addition, comprehensive tests in this paper show that our algorithms are more efficient and scalable than state‐of‐the‐art algorithms, and they also have the correctness of the MWFP mining in terms of their pattern generation results.