Discovery of High Utility Itemsets Using Genetic Algorithm with Ranked Mutation

被引:102
作者
Kannimuthu, S. [1 ]
Premalatha, K. [2 ]
机构
[1] Coimbatore Inst Engn & Technol, Dept CSE, Coimbatore 641008, Tamil Nadu, India
[2] Bannari Amman Inst Technol, Dept CSE, Sathyamangalam, Tamil Nadu, India
关键词
EFFICIENT ALGORITHM;
D O I
10.1080/08839514.2014.891839
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
Utility mining is the study of itemset mining from the consideration of utilities. It is the utility-based itemset mining approach to find itemsets conforming to user preferences. Modern research in mining high-utility itemsets (HUI) from the databases faces two major challenges: exponential search space and database-dependent minimum utility threshold. The search space is extremely vast when the number of distinct items and the size of the database are very large. Data analysts must specify suitable minimum utility thresholds for their mining tasks, although they might have no knowledge pertaining to their databases. Moreover, a utility-mining algorithm supports only an itemset with positive item values. To evade these problems, two approaches are presented for mining HUI containing negative item values from transaction databases: with/without specifying the minimum utility threshold through a genetic algorithm with ranked mutation. To the best of our knowledge, this is the first work on mining HUI with negative item values from transaction databases using a genetic algorithm. Experimental results show that approaches described in this article achieve better performance in terms of scalability and efficiency.
引用
收藏
页码:337 / 359
页数:23
相关论文
共 29 条
[1]
Parallel mining of association rules [J].
Agrawal, R ;
Shafer, JC .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1996, 8 (06) :962-969
[2]
AGRAWAL R, 1995, PROC INT CONF DATA, P3, DOI 10.1109/ICDE.1995.380415
[3]
A Framework for Mining High Utility Web Access Sequences [J].
Ahmed, Chowdhury Farhan ;
Tanbeer, Syed Khairuzzaman ;
Jeong, Byeong-Soo .
IETE TECHNICAL REVIEW, 2011, 28 (01) :3-16
[4]
Efficient Mining of High Utility Patterns over Data Streams with a Sliding Window Method [J].
Ahmed, Chowdhury Farhan ;
Tanbeer, Syed Khairuzzaman ;
Jeong, Byeong-Soo .
SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL-DISTRIBUTED COMPUTING 2010, 2010, 295 :99-113
[5]
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases [J].
Ahmed, Chowdhury Farhan ;
Tanbeer, Syed Khairuzzaman ;
Jeong, Byeong-Soo ;
Lee, Young-Koo .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2009, 21 (12) :1708-1721
[6]
[Anonymous], 20 INT C VER LARG DA
[7]
[Anonymous], ACM SIGMOD RECORD
[8]
[Anonymous], 1975, Ann Arbor
[9]
[Anonymous], P 7 INT C COMP INF T
[10]
[Anonymous], 7 IEEE INT C DAT MIN