Mining high utility itemsets without candidate generation
Authors:
Top Cited Papers
Open Access
- 29 October 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 55-64
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Adequate condensed representations of patternsData Mining and Knowledge Discovery, 2008
- Isolated items discarding strategy for discovering high utility itemsetsData & Knowledge Engineering, 2008
- High-utility pattern mining: A method for discovery of high-utility item setsPattern Recognition, 2007
- Frequent pattern mining: current status and future directionsData Mining and Knowledge Discovery, 2007
- Association miningACM Computing Surveys, 2006
- A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets2005
- A Fast Algorithm for Mining Share-Frequent ItemsetsLecture Notes in Computer Science, 2005
- A Foundational Approach to Mining Itemset Utilities from Databases2004
- Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree ApproachData Mining and Knowledge Discovery, 2004
- Scalable algorithms for association miningIEEE Transactions on Knowledge and Data Engineering, 2000