A framework for mining interesting high utility patterns with a strong frequency affinity

• Published in: Information sciences Vol. 181; no. 21; pp. 4878 - 4894
• Main Authors: Ahmed, Chowdhury Farhan, Tanbeer, Syed Khairuzzaman, Jeong, Byeong-Soo, Choi, Ho-Jin
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.11.2011
• Subjects: Affinity; Algorithms; Data mining; Data processing; Frequency affinity; High utility pattern mining; Interesting patterns; Knowledge discovery; Mining; Real time; Trees; Utilities; Knowledge discovery; Interesting patterns; Frequency affinity; High utility pattern mining; Data mining
• ISSN: 0020-0255; 1872-6291
• DOI: 10.1016/j.ins.2011.05.012

High utility pattern (HUP) mining is one of the most important research issues in data mining. Although HUP mining extracts important knowledge from databases, it requires long calculations and multiple database scans. Therefore, HUP mining is often unsuitable for real-time data processing schemes such as data streams. Furthermore, many HUPs may be unimportant due to the poor correlations among the items inside of them. Hence,the fast discovery of fewer but more important HUPs would be very useful in many practical domains. In this paper, we propose a novel framework to introduce a very useful measure, called frequency affinity, among the items in a HUP and the concept of interesting HUP with a strong frequency affinity for the fast discovery of more applicable knowledge. Moreover, we propose a new tree structure, utility tree based on frequency affinity (UTFA), and a novel algorithm, high utility interesting pattern mining (HUIPM), for single-pass mining of HUIPs from a database. Our approach mines fewer but more valuable HUPs, significantly reduces the overall runtime of existing HUP mining algorithms and is applicable to real-time data processing. Extensive performance analyses show that the proposed HUIPM algorithm is very efficient and scalable for interesting HUP mining with a strong frequency affinity.