Minimal k-Free Representations of Frequent Sets

No abstract is available for this paper.

• Publication year

  2003

• Venue

  European Conference on Principles of Data Mining and Knowledge Discovery

• Publication date

  2003-09-22

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-540-39804-2_9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Foundations of Intelligent Systems, 15th International Symposium, ISMIS 2005, Saratoga Springs, NY, USA, May 25-28, 2005, Proceedings

  2005cited by this paper
• Axiomatization and Deduction Rules for the Frequency of Itemsets

  2003influential reference
• Mining All Non-derivable Frequent Itemsets

  2002influential reference
• Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns?

  2002influential reference
• Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators

  2002influential reference
• Principles of Data Mining and Knowledge Discovery

  2001cited by this paper
• Concise representation of frequent patterns based on disjunction-free generators

  2001influential reference
• Real world performance of association rule algorithms

  2001cited by this paper
• A condensed representation to find frequent patterns

  2001influential reference
• Mining frequent patterns with counting inference

  2000cited by this paper
• Frequent Closures as a Concise Representation for Binary Data Mining

  2000cited by this paper
• Approximation of Frequency Queris by Means of Free-Sets

  2000influential reference
• CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets

  2000cited by this paper
• Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java

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

  1999cited by this paper
• UCI Repository of machine learning databases

  1998cited by this paper
• Bonferroni-type inequalities with applications

  1996cited by this paper
• Multiple Uses of Frequent Sets and Condensed Representations (Extended Abstract)

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

  1993cited by this paper
• Information and Computer Science

  1975cited by this paper

• A Condensed Survey on Condensed Representations of Patterns

  2022cites this paper
• Une nouvelle approche de complétion des valeurs manquantes dans les bases de données

  2019cites this paper
• Fouille de données : motifs minimaux, redescription d'espace et analyse du (e-)sport

  2017cites this paper
• BASSINS VERSANTSFonctionnement des petits bassins versants miniers

  2016cites this paper
• Sampling frequent and minimal boolean patterns: theory and application in classification

  2015cites this paper
• Exact and Approximate Minimal Pattern Mining

  2015cites this paper
• Efficient negative association rule mining based on chance thresholds

  2014cites this paper
• Formal Methods for Mining Structured Objects

  2013cites this paper
• Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs

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

  2011cites this paper
• Conception et validation d’une méthode de complétion des valeurs manquantes fondée sur leurs modèles d’apparition

  2011cites this paper
• Extraction de motifs spatio-temporels dans des séries d'images de télédétection : application à des données optiques et radar

  2011cites this paper
• Distributed Algorithms for Computing Closed Itemsets Based onan Iterative MapReduce Framework

  2011cites this paper
• Fouille de graphes pour la découverte de contrastes entre classes : application à l'estimation de la toxicité des molécules. (Graph data mining to discover contrasts between classes : application to predictive (eco)toxicology)

  2011cites this paper
• Mining Frequent Boolean Expressions: Application to Gene Expression and Regulatory Modeling

  2010cites this paper
• A new classification of datasets for frequent itemsets

  2010influential citation
• Frequent Set Mining

  2010cites this paper
• Supervised Descriptive Rule Induction

  2010cites this paper
• On Concise Representations of Frequent Patterns Admitting Negation

  2010cites this paper
• DISTRIBUTED ASSOCIATION RULES MINING USING NON-

  2010cites this paper
• Nonredundant Generalized Rules and Their Impact in Classification

  2010cites this paper
• Segmentation Spatio-temporelle d'une séquence d'images satellitaires à haute résolution. (Spatio-temporal segmentation of a satellite image time series at high resolution)

  2009cites this paper
• Apriori Property and Breadth-First Search Algorithms

  2009cites this paper
• Reasoning about Frequent Patterns with Negation

  2009cites this paper
• Mining non-derivable frequent itemsets over data stream

  2009cites this paper
• Adequate condensed representations of patterns

  2008cites this paper
• Mining conjunctive sequential patterns

  2008cites this paper
• A new concise representation of frequent itemsets using generators and a positive border

  2008cites this paper
• Représentation condensée à base d'intervalles d'un ensemble de motifs

  2008cites this paper
• Extraction de Séquences Fréquentes : Des Bases de Données Statiques aux Flots de Données

  2008cites this paper
• Apport de la négation pour la classification supervisée à l'aide d'associations

  2008cites this paper
• Non-derivable itemset mining

  2007influential citation
• A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation

  2007cites this paper
• Efficient mining of understandable patterns from multivariate interval time series

  2007cites this paper
• CFP-tree: A compact disk-based structure for storing and querying frequent itemsets

  2007cites this paper
• Time Series Knowledge Mining

  2006cites this paper
• Frequency-based views to pattern collections

  2006cites this paper
• Closed Sets for Labeled Data

  2006cites this paper
• BLOSOM: a framework for mining arbitrary boolean expressions

  2006cites this paper
• Vers le prototypage rapide de programmes de fouille de données

  2006cites this paper
• Extraction de propriétés correctes dans des bases de données incomplètes

  2006influential citation
• Positive Borders or Negative Borders: How to Make Lossless Generator Based Representations Concise

  2006cites this paper
• Mining Correct Properties in Incomplete Databases

  2006influential citation
• A New Concise and Lossless Representation of Frequent Itemsets Using Generators and A Positive Border

  2006cites this paper
• Using and extending itemsets in data mining: query approximation, dense itemsets, and tiles

  2006cites this paper
• Mining subspace and boolean patterns from data

  2006cites this paper
• Depth-First Non-Derivable Itemset Mining

  2005cites this paper
• An Efficient Framework for Mining Flexible Constraints

  2005cites this paper
• Transaction Databases, Frequent Itemsets, and Their Condensed Representations

  2005cites this paper
• Principles of Employing a Self-organizing Map as a Frequent Itemset Miner

  2005cites this paper
• A thorough experimental study of datasets for frequent itemsets

  2005influential citation
• Average Number of Frequent and Closed Patterns in Random Databases

  2005cites this paper
• Extraction de connaissances dans les bases de donn'ees comportant des valeurs manquantes ou un grand nombre d'attributs

  2005cites this paper
• Quick Inclusion-Exclusion

  2005cites this paper
• Condensed Representations for Data Mining

  2005cites this paper
• Summarization Techniques for Pattern Collections in Data Mining

  2005cites this paper
• Upper bound on the length of generalized disjunction-free patterns

  2004influential citation
• Condensed Representation of EPs and Patterns Quantified by Frequency-Based Measures

  2004cites this paper
• ABS: adaptative borders search of frequent itemsets

  2004influential citation
• Inductive Databases as Ranking

  2004cites this paper
• Implicit Enumeration of Patterns

  2004cites this paper
• Implicit Enumeration of Patterns ( Preliminary Version )

  2004cites this paper
• Theoretical Bounds on the Size of Condensed Representations

  2004influential citation
• An Automata Approach to Pattern Collections

  2004cites this paper
• A Survey on Condensed Representations for Frequent Sets

  2004influential citation
• Chaining Patterns

  2003cites this paper
• Proceedings of the 2nd International Workshop on Knowledge Discovery in Inductive Databases (KDID-2003)

  2003cites this paper
• Finding All Occurring Sets of Interest

  2003cites this paper
• What You Store is What You Get

  2003cites this paper
• Privacy Preserving Data Mining Privacy Preserving Naïve Bayes Classifier for Horizontally Partitioned Data / 3

  2003cites this paper
• On Inverse Frequent Set Mining

  2003cites this paper
• Change Profiles

  2003cites this paper
• What You Store Is What You Get ( extended abstract )

  2003cites this paper
• Change profiles

  2003cites this paper
• Mining strong emerging patterns in wide SAGE data

  year unknowncites this paper