Mining Multidimensional Frequent Patterns from Relational Database

摘要

Mining frequent patterns focus on discover the set of items which were frequently purchased together, which is an important data mining task and has broad applications. However, traditional frequent pattern mining does not consider the characteristics of the customers, such that the frequent patterns for some specific customer groups cannot be found. Multidimensional frequent pattern mining can find the frequent patterns according to the characteristics of the customer. Therefore, we can promote or recommend the products to a customer according to the characteristics of the customer. However, the characteristics of the customers may be the continuous data, but frequent pattern mining only can process categorical data. This paper proposes an efficient approach for mining multidimensional frequent pattern, which combines the clustering algorithm to automatically discretize numerical-type attributes without experts.