Notice of RetractionMining Top-k Fault Tolerant Association Rules by Redundant Pattern Disambiguation in Data Streams

No abstract is available for this paper.

• Publication year

  2010

• Venue

  2010 International Conference on Intelligent Computing and Cognitive Informatics

• Publication date

  2010-06-22

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/ICICCI.2010.91
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Research of Mining Positive and Negative Weighted Association Rules Based on Chi-Squared Analysis

  2009cited by this paper
• Efficient Mining of Strong Negative Association Rules in Multi-Database

  2009cited by this paper
• Mining the Frequent Patterns in an Arbitrary Sliding Window over Online Data Streams

  2008cited by this paper
• Mining the Frequent Patterns in an Arbitrary Sliding Window over Online Data Streams: Mining the Frequent Patterns in an Arbitrary Sliding Window over Online Data Streams

  2008cited by this paper
• Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases

  2007cited by this paper
• Exception Rules Mining Based on Negative Association Rules

  2004cited by this paper
• Efficient mining of both positive and negative association rules

  2004cited by this paper
• Finding frequent items in data streams

  2002cited by this paper
• A New Approach to Online Generation of Association Rules

  2001cited by this paper

• ETARM: an efficient top-k association rule mining algorithm

  2017cites this paper
• An Improved Algorithm for Mining Top-k Association Rules

  2017cites this paper
• A Novel Method for Refined Association Rule Mining from a Data Set

  2014cites this paper
• Mining Top-K Non-redundant Association Rules

  2012cites this paper
• Mining Top-K Association Rules

  2012cites this paper
• in Computer

  year unknowncites this paper