Affiliation:
1. Kongu Engineering College, India
2. K. S. R. College of Engineering, India
Abstract
In recent years, the data analysts are facing many challenges in high utility itemset (HUI) mining from given transactional database using existing traditional techniques. The challenges in utility mining algorithms are exponentially growing search space and the minimum utility threshold appropriate to the given database. To overcome these challenges, evolutionary algorithm-based techniques can be used to mine the HUI from transactional database. However, testing each of the supporting functions in the optimization problem is very inefficient and it increases the time complexity of the algorithm. To overcome this drawback, reinforcement learning-based approach is proposed for improving the efficiency of the algorithm, and the most appropriate fitness function for evaluation can be selected automatically during execution of an algorithm. Furthermore, during the optimization process when distinct functions are skillful, dynamic selection of current optimal function is done.
Reference33 articles.
1. Fast Algorithms for Mining Association Rules.;R.Agrawal;Proc. 20th Int’l Conf. Very Large Data Bases (VLDB),1994
2. Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases
3. Efficient data mining for path traversal patterns
4. Mining gene expression databases for association rules
5. UP-Hist Tree: An Efficient Data Structure for Mining High Utility Patterns from Transaction Databases.;S.Dawar;Proc. of the 19th International Database Engineering & Applications Symposium (IDEAS ’15),2015
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献