Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
Data Mining and Knowledge DiscoveryPublished 1 January 2003
Jean‐François Boulicaut, Artur Bykowski, Christophe Rigotti
Citations253
SJR quartileQ1
SJR score1.02
SNIP1.88
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The experiments show that the extraction of frequent free-sets can be efficiently extracted using pruning strategies developed for frequent itemset discovery, and that they can be used to approximate the support of any frequent item set.
Abstract
International audience
Keywords
Computer Science
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Efficiently mining long patterns from databases
1,297 Citations1998Roberto J. Bayardo
A pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern, compared with previous algorithms that scale exponentially with longest pattern length.
Data Mining and Knowledge DiscoveryLevelwise Search and Borders of Theories in Knowledge Discovery
865 Citations1997Heikki Mannila, Hannu Toivonen
The concept of the border of a theory, a notion that turns out to be surprisingly powerful in analyzing the algorithm, is introduced and strong connections between the verification problem and the hypergraph transversal problem are shown.
Information SystemsEfficient mining of association rules using closed itemset lattices
739 Citations1999Nicolas Pasquier, Yves Bastide +2 more
Experiments showed that Close is very efficient for mining dense and/or correlated data such as census style data, and performs reasonably well for market basket style data.
Exploratory mining and pruning optimizations of constrained associations rules
713 Citations1998Raymond T. Ng, Laks V. S. Lakshmanan +2 more
An architecture that opens up the black-box, and supports constraint-based, human-centered exploratory mining of associations, and introduces and analyzes two properties of constraints that are critical to pruning: anti-monotonicity and succinctness.
Lecture notes in computer scienceApproximation of Frequency Queries by Means of Free-Sets
117 Citations2000Jean‐François Boulicaut, Artur Bykowski +1 more
It is shown that frequent free-sets can be efficiently extracted using pruning strategies developed for frequent item-set discovery, and that they can be used to approximate the support of any frequent itemset.
Brute-force mining of high-confidence classification rules
105 Citations1997Jr. Roberto J. Bayardo
An association rule miner enhanced with new pruning strategies to control combinatorial explosion in the number of candidates counted with each database pass effectively and efficiently extracts high confidence classification rules that apply to most if not all of the data in several classification benchmarks.
Multiple uses of frequent sets and condensed representations extended abstract
97 Citations1996Heikki Mannila, Hannu Toivonen
Lecture notes in computer scienceFrequent Closures as a Concise Representation for Binary Data Mining
82 Citations2000Jean‐François Boulicaut, Artur Bykowski
The concept of almost-closure (generation of every frequent set from frequent almost-closures remains possible but with a bounded error on frequency) is introduced and to the best of the knowledge, this is a new concept and, here again, some experimental evidence of its add-value is provided.
Dynamic miss-counting algorithms: finding implication and similarity rules with confidence pruning
11 Citations2002Shintaro Fujiwara, Jeffrey D. Ullman +1 more
Dynamic miss-counting (DMC) algorithms are proposed which find all implication and similarity rules with confidence pruning but without support pruning to handle data sets with a large number of columns that can be applied during data scanning.
Condensed representations of frequent sets : application to descriptive pattern discovery
6 Citations2002Artur Bykowski
New major condensed representations of simple frequent patterns are proposed, the algorithms to mine them and derive the target pattern collections and an abstract view of the proposed representations in the unified structure for condensed representations are provided.