Mining maximal frequent patterns by considering weight conditions over data streams
Authors:
- Unil YunUYUnil Yun
- Gangin LeeGLGangin Lee
- Keun Ho RyuKRKeun Ho Ryu
- 1 January 2014
- journal article
- Published by Elsevier in Knowledge-Based Systems
- Vol. 55, 49-65
Abstract
No abstract availableThis publication has 42 references indexed in Scilit:
- Single-pass incremental and interactive mining for weighted frequent patternsExpert Systems with Applications, 2012
- Maximal Pattern Mining Using Fast CP-Tree for Knowledge DiscoveryInternational Journal of Information Systems and Social Change, 2012
- A New Approach for Maximal Frequent Sequential Patterns Mining Over Data StreamsInternational Journal of Digital Content Technology and its Applications, 2011
- Interactive mining of top-K frequent closed itemsets from data streamsExpert Systems with Applications, 2009
- Efficient algorithms for incremental maintenance of closed sequential patterns in large databasesData & Knowledge Engineering, 2009
- Mining top-k frequent patterns in the presence of the memory constraintThe VLDB Journal, 2007
- Mining maximal frequent itemsets from data streamsJournal of Information Science, 2007
- A scalable algorithm for mining maximal frequent sequences using a sampleKnowledge and Information Systems, 2007
- Mining maximal hyperclique pattern: A hybrid search strategyInformation Sciences, 2006
- GenMax: An Efficient Algorithm for Mining Maximal Frequent ItemsetsData Mining and Knowledge Discovery, 2005