Mining approximate frequent itemsets from noisy data

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Industrial Conference on Data Mining

• Publication date

  2005-11-27

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/ICDM.2005.93
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Comparative Study of Sequential Pattern Mining Models

  2005cited by this paper
• Mining Approximate Frequent Itemsets from Noisy Data 1

  2005cited by this paper
• Support envelopes: a technique for exploring the structure of association patterns

  2004cited by this paper
• Dense itemsets

  2004cited by this paper
• Mining gene expression databases for association rules

  2003cited by this paper
• Strong-association-rule mining for large-scale gene-expression data analysis: a case study on human SAGE data

  2002cited by this paper
• Efficient discovery of error-tolerant frequent itemsets in high dimensions

  2001influential reference
• Fault-Tolerant Frequent Pattern Mining: Problems and Challenges

  2001cited by this paper
• Biogeography of Australian freshwater fishes

  2001cited by this paper
• Fast Discovery of Association Rules

  1996cited by this paper
• Mining association rules between sets of items in large databases

  1993cited by this paper

• C3Ro: An efficient mining algorithm of extended-closed contiguous robust sequential patterns in noisy data

  2019cites this paper
• Fault-tolerant tile mining

  2018cites this paper
• Categorizing User Sessions at Pinterest

  2017cites this paper
• Title : Mining Approximate Multi-Relational Patterns

  2017cites this paper
• Mining approximate multi-relational patterns

  2014cites this paper
• Mining Local Staircase Patterns in Noisy Data

  2012cites this paper
• Mining Dense Structures by Enumerating Weighted and Multi-level Pseudo-Bicliques

  2012cites this paper
• Discovery of error-tolerant biclusters from noisy gene expression data

  2011cites this paper
• Efficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression

  2011cites this paper
• Role Mining Techniques To Improve RBAC Administration

  2011cites this paper
• ABBA: adaptive bicluster-based approach to impute missing values in binary matrices

  2010cites this paper
• A tree-based approach for efficiently mining approximate frequent itemsets

  2010cites this paper
• Data mining for discovery of clinical and genomic disease markers

  2010cites this paper
• Unsupervised Learning for Gene Regulation Network Inference from Expression Data: A Review

  2010cites this paper
• TR 09-026 A Novel Error-Tolerant Frequent Itemset Model for Binary and Real-Valued Data

  2009cites this paper
• Agglomerating local patterns hierarchically with ALPHA

  2009cites this paper
• Towards efficient mining of proportional fault-tolerant frequent itemsets

  2009cites this paper
• On the size and recovery of submatrices of ones in a random binary matrix

  2008influential citation
• Approximate Frequent Itemset Mining In the Presence of Random Noise

  2008cites this paper
• Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration

  2008cites this paper
• Index-BitTableFI: An improved algorithm for mining frequent itemsets

  2008cites this paper
• Discovering frequent itemsets by support approximation and itemset clustering

  2008cites this paper
• RAM: Randomized Approximate Graph Mining

  2008cites this paper
• Quantitative evaluation of approximate frequent pattern mining algorithms

  2008influential citation
• Significance and recovery of blocks structures in binary and real-valued matrices with noise

  2007influential citation
• An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining

  2007cites this paper
• New approaches for clustering high dimensional data

  2006cites this paper
• Mining Approximate Frequent Itemsets In the Presence of Noise: Algorithm and Analysis

  2006cites this paper
• Significance and Recovery of Block Structures in Binary Matrices with Noise

  2006cites this paper
• Eextraction of Frequent Itemsets from Noisy Data

  2006cites this paper
• Mining Frequent Itemsets from Noisy Data

  2006cites this paper
• Mining Approximate Frequent Itemsets from Noisy Data 1

  2005cites this paper
• C3Ro: an E ffi cient Mining Algorithm of Extended-Closed Contiguous Robust Sequential Patterns in Noisy Data

  year unknowncites this paper