Logo IPI  
Journal > Journal of ICT Research and Applications > Mining High Utility Itemsets with Regular Occurrence

 

Full Text PDF (490 kb)
Journal of ICT Research and Applications
Vol 10, No 2 (2016)
Mining High Utility Itemsets with Regular Occurrence
Amphawan, Komate ( Burapha University, Computational Innovation Laboratory, 20131 Chonburi,)
Lenca, Philippe ( Institut Telecom, Telecom Bretagne, UMR CNRS 3192 Lab-STICC,)
Jitpattanakul, Anuchit ( Faculty of Applied Science, KNUTNB, 10800 Bangkok)
Surarerks, Athasit ( Chulalongkorn University, ELITE Laboratory, 10330 Bangkok,)
Article Info   ABSTRACT
Published date:
31 Aug 2016
 
High utility itemset mining (HUIM) plays an important role in the data mining community and in a wide range of applications. For example, in retail business it is used for finding sets of sold products that give high profit, low cost, etc. These itemsets can help improve marketing strategies, make promotions/ advertisements, etc. However, since HUIM only considers utility values of items/itemsets, it may not be sufficient to observe product-buying behavior of customers such as information related to “regular purchases of sets of products having a high profit margin”. To address this issue, the occurrence behavior of itemsets (in the term of regularity) simultaneously with their utility values was investigated. Then, the problem of mining high utility itemsets with regular occurrence (MHUIR) to find sets of co-occurrence items with high utility values and regular occurrence in a database was considered. An efficient single-pass algorithm, called MHUIRA, was introduced. A new modified utility-list structure, called NUL, was designed to efficiently maintain utility values and occurrence information and to increase the efficiency of computing the utility of itemsets. Experimental studies on real and synthetic datasets and complexity analyses are provided to show the efficiency of MHUIRA combined with NUL in terms of time and space usage for mining interesting itemsets based on regularity and utility constraints.
Copyrights © 2016