Continuous Prediction of Closed Frequent Itemsets from High speed Distributed Data Streams using Parallel Mining on Manifold Windows with Varying Size

No abstract is available for this paper.

• Publication year

  2014

• Venue

  International Journal of Computer Applications

• Publication date

  2014-09-18

• Fields of study

  Computer Science

• Identifiers
  DOI 10.5120/17662-8479
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Knowledge Discovery from Static Datasets to Evolving Data Streams and Challenges

  2014cited by this paper
• Mining Frequent Itemsets (MFI) over Data Streams: Variable Window Size (VWS) by Context Variation Analysis (CVA) of the Streaming Transactions

  2014cited by this paper
• TIFIM: Tree based Incremental Frequent Itemset Mining over Streaming Data

  2013cited by this paper
• Approximate Frequency Counts over Data Streams

  2012cited by this paper
• Correcting Jaccard and other similarity indices for chance agreement in cluster analysis

  2011cited by this paper
• EclatDS: An efficient sliding window based frequent pattern mining method for data streams

  2011influential reference
• Mining non-derivable frequent itemsets over data stream

  2009influential reference
• Mining frequent itemsets over data streams using efficient window sliding techniques

  2009influential reference
• estMax: Tracing Maximal Frequent Item Sets Instantly over Online Transactional Data Streams

  2009cited by this paper
• Sliding window-based frequent pattern mining over data streams

  2009influential reference
• Verifying and Mining Frequent Patterns from Large Windows over Data Streams

  2008influential reference
• Frequent pattern mining: current status and future directions

  2007cited by this paper
• An Efficient Algorithm for Frequent Itemset Mining on Data Streams

  2006cited by this paper
• Knowledge and Information Systems

  2006influential reference
• Finding recently frequent itemsets adaptively over online transactional data streams,

  2006cited by this paper
• A false negative approach to mining frequent itemsets from high speed transactional data streams

  2006cited by this paper
• DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams

  2006influential reference
• Mining Frequent Itemsets from Data Streams with a Time-Sensitive Sliding Window

  2005influential reference
• estWin: Online data stream mining of recent frequent itemsets by sliding window method

  2005influential reference
• An Efficient Algorithm for Mining Frequent Itemsets over the Entire History of Data Streams

  2004cited by this paper
• An Efficient Algorithm for Mining Frequent Itemests over the Entire History of Data Streams

  2004cited by this paper
• Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

  2004cited by this paper
• Fast Algorithms for Mining Association Rules

  1998cited by this paper
• Fast Algorithms for Mining Association Rules in Large Databases

  1994cited by this paper

• No citing papers are available for this paper.