Mining quantitative frequent itemsets using adaptive density-based subspace clustering

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Industrial Conference on Data Mining

• Publication date

  2005-11-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ICDM.2005.100
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Projective clustering by histograms

  2005cited by this paper
• Density-Connected Subspace Clustering for High-Dimensional Data

  2004cited by this paper
• SCHISM: a new approach for interesting subspace mining

  2004cited by this paper
• A Monte Carlo algorithm for fast projective clustering

  2002cited by this paper
• Redefining Clustering for High-Dimensional Applications

  2002cited by this paper
• Data Mining with optimized two-dimensional association rules

  2001cited by this paper
• Clustering through decision tree construction

  2000cited by this paper
• Discovering Frequent Closed Itemsets for Association Rules

  1999cited by this paper
• Fast algorithms for projected clustering

  1999cited by this paper
• Entropy-based subspace clustering for mining numerical data

  1999cited by this paper
• Interestingness-Based Interval Merger for Numeric Association Rules

  1998cited by this paper
• Automatic subspace clustering of high dimensional data for data mining applications

  1998cited by this paper
• On the Complexity of Mining Quantitative Association Rules

  1998cited by this paper
• Mining optimized association rules with categorical and numeric attributes

  1998cited by this paper
• A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise

  1996cited by this paper
• Mining quantitative association rules in large relational tables

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

  1994cited by this paper

• Mining evolutions of complex spatial objects using a single-attributed Directed Acyclic Graph

  2020cites this paper
• Cluster sequence mining from event sequence data and its application to damage correlation analysis

  2019cites this paper
• Extraction de motifs spatio-temporels : co-localisations, séquences et graphes dynamiques attribués. (Mining spatio-temporal patterns: colocations, sequences and dynamic attributed graphs)

  2019cites this paper
• Extraction of Characteristic Sets of Ingredients and Cooking Actions on Cuisine Type

  2017cites this paper
• Association Rules-Based Analysis in Multidimensional Clusters

  2017cites this paper
• Discovering Overlapping Quantitative Associations by Density-Based Mining of Relevant Attributes

  2016influential citation
• Sequence-based multimodal behavior modeling for social agents

  2016cites this paper
• Discovery of Sequential Patterns with Quantity Factors

  2014cites this paper
• Mining of Co-occurring Clusters for Damage Pattern Extraction of a Fuel Cell

  2012cites this paper
• Co-occurring Cluster Mining for Damage Patterns Analysis of a Fuel Cell

  2012cites this paper
• Frequent Pattern Mining from a Single Graph with Quantitative Itemsets

  2011cites this paper
• PGLCM: efficient parallel mining of closed frequent gradual itemsets

  2010cites this paper
• Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets

  2009influential citation
• Discovery of Quantitative Sequential Patterns from Event Sequences

  2009cites this paper
• A Method to Search ARX Model Orders and Its Application to Sales Dynamics Analysis

  2006cites this paper
• A Penalized Likelihood Estimation on Transcriptional Module-Based Clustering

  2005cites this paper