Efficient algorithms for mining closed high utility itemsets in dynamic profit databases
Authors:
- Trinh D.D. NguyenTNTrinh D.D. Nguyen
- Loan T.T. NguyenLNLoan T.T. Nguyen
- Lung VuLVLung Vu
- Bay VoBVBay Vo
- Witold PedryczWPWitold Pedrycz
- 1 December 2021
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 186
Abstract
No abstract availableKeywords
This publication has 43 references indexed in Scilit:
- An efficient approach for mining association rules from high utility itemsetsExpert Systems with Applications, 2015
- Pruning strategies for mining high utility itemsetsExpert Systems with Applications, 2015
- New Techniques for Mining Frequent Patterns in Unordered TreesIEEE Transactions on Cybernetics, 2014
- Efficient Algorithms for Mining the Concise and Lossless Representation of High Utility ItemsetsIEEE Transactions on Knowledge and Data Engineering, 2014
- High utility itemset mining with techniques for reducing overestimated utilities and pruning candidatesExpert Systems with Applications, 2014
- A lattice-based approach for mining most generalization association rulesKnowledge-Based Systems, 2013
- Efficient algorithms for mining maximal high utility itemsets from data streams with different modelsExpert Systems with Applications, 2012
- An efficient strategy for mining high utility itemsetsInternational Journal of Intelligent Information and Database Systems, 2011
- Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree ApproachData Mining and Knowledge Discovery, 2004
- Mining association rules between sets of items in large databasesACM SIGMOD Record, 1993