MINING HIGH UTILITY PATTERNS IN ONE PHASE WITHOUT GENERATING CANDIDATES

High utility item sets refer to the sets of items with high utility like profit in a database, and efficient mining of high utility item sets plays a crucial role in many real-life applications and is an important research issue in data mining area. To identify high utility item sets, most existing algorithms first generate candidate item sets by overestimating their utilities, and subsequently compute the exact utilities of these candidates. These algorithms incur the problem that a very large number of candidates are generated, but most of the candidates are found out to be not high utility after their exact utilities are computed. In this paper, we propose an algorithm, called TWU pattern, for high utility itemset mining. By avoiding the costly generation and utility computation of numerous candidate item sets, TWU patterns can efficiently mine high utility item sets from the utility-lists constructed from a mined database.