Mining Maximal Frequent Itemsets in Data Streams Based on FP-Tree

No abstract is available for this paper.

• Publication year

  2007

• Venue

  IAPR International Conference on Machine Learning and Data Mining in Pattern Recognition

• Publication date

  2007-07-18

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-540-73499-4_36
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• CFI-Stream: mining closed frequent itemsets in data streams

  2006cited by this paper
• Pruning strategy for mining maximal frequent itemsets

  2005cited by this paper
• Online Mining of Maximal Frequent Itemsequences from Data Streams

  2005influential reference
• Finding maximal frequent itemsets over online data streams adaptively

  2005cited by this paper
• Online mining (recently) maximal frequent itemsets over data streams

  2005influential reference
• Fast Mining Maximal Frequent ItemSets Based on FP-Tree

  2004cited by this paper
• Moment: maintaining closed frequent itemsets over a stream sliding window

  2004cited by this paper
• AI 2004: Advances in Artificial Intelligence, 17th Australian Joint Conference on Artificial Intelligence, Cairns, Australia, December 4-6, 2004, Proceedings

  2004cited by this paper
• Mining Maximal Frequent ItemSets Using Combined FP-Tree

  2004cited by this paper
• Efficiently Using Prefix-trees in Mining Frequent Itemsets

  2003cited by this paper
• StatStream: Statistical Monitoring of Thousands of Data Streams in Real Time

  2002cited by this paper
• Models and issues in data stream systems

  2002cited by this paper
• A Tree Projection Algorithm for Generation of Frequent Item Sets

  2001cited by this paper
• Efficiently mining maximal frequent itemsets

  2001cited by this paper
• Mining frequent patterns without candidate generation

  2000cited by this paper
• Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm [published erratum appears in Bioinformatics 1998;14(2): 229]

  1998cited by this paper
• Efficiently mining long patterns from databases

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

  1994cited by this paper
• Search through Systematic Set Enumeration

  1992cited by this paper

• TREATS: Fairness-aware entity resolution over streaming data

  2025cites this paper
• Mining Multilevel Association Rules for Data Streams with Time Horizon by Artificial Bee Colony Based Optimization for Fuzzy Logic

  2014cites this paper
• Mining frequent itemsets in data streams within a time horizon

  2014cites this paper
• DFP-Growth: An Efficient Algorithm for Frequent Patterns in Dynamic Data Mining

  2014cites this paper
• On the efficient traversal of the itemset lattice: A literature review

  2013cites this paper
• Mining moving flock patterns in large spatio-temporal datasets using a frequent pattern mining approach

  2011cites this paper
• An Efficient Algorithm for Mining Closed Frequent Itemsets in Data Streams

  2008cites this paper