Mining High Utility Itemsets in Big Data
Authors:
- 9 May 2015
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 649-661
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Mining big dataACM SIGKDD Explorations Newsletter, 2013
- Direct Discovery of High Utility Itemsets without Candidate Generation2012
- Mining high utility itemsets without candidate generation2012
- Efficient Algorithms for Mining High Utility Itemsets from Transactional DatabasesIEEE Transactions on Knowledge and Data Engineering, 2012
- Efficient Tree Structures for High Utility Pattern Mining in Incremental DatabasesIEEE Transactions on Knowledge and Data Engineering, 2009
- Parallel Method for Mining High Utility Itemsets from Vertically Partitioned Distributed DatabasesLecture Notes in Computer Science, 2009
- Isolated items discarding strategy for discovering high utility itemsetsData & Knowledge Engineering, 2008
- A fast high utility itemsets mining algorithm2005
- Mining frequent patterns without candidate generationACM SIGMOD Record, 2000