An efficient algorithm for mining the top- k high utility itemsets, using novel threshold raising and pruning strategies
- 1 July 2016
- journal article
- Published by Elsevier in Knowledge-Based Systems
- Vol. 104, 106-122
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Effective periodic pattern mining in time series databasesExpert Systems with Applications, 2013
- Mining top−k frequent patterns without minimum support thresholdKnowledge and Information Systems, 2011
- Isolated items discarding strategy for discovering high utility itemsetsData & Knowledge Engineering, 2008
- H-Mine: Fast and space-preserving frequent pattern mining in large databasesIIE Transactions, 2007
- Frequent pattern mining: current status and future directionsData Mining and Knowledge Discovery, 2007
- Mining N-most interesting itemsets without support threshold by the COFI-treeInternational Journal of Business Intelligence and Data Mining, 2005
- Mining frequent itemsets without support threshold: with and without item constraintsIEEE Transactions on Knowledge and Data Engineering, 2004
- Mining frequent patterns without candidate generationACM SIGMOD Record, 2000
- Scalable algorithms for association miningIEEE Transactions on Knowledge and Data Engineering, 2000
- Mining association rules between sets of items in large databasesACM SIGMOD Record, 1993