Condensed Representation of Emerging Patterns

Lecture notes in computer sciencePublished 1 January 2004

Arnaud Soulet, Bruno Crémilleux, François Rioult

DOI10.1007/978-3-540-24775-3_16

Source URL

Citations39

SJR quartileQ2

SJR score0.35

SNIP0.55

TL;DR

An exact condensed representation of emerging patterns is proposed and a method to provide EPs with the highest growth rates is given, called strong emerging patterns (SEPs), in collaboration with the Philips company.

Abstract

Emerging patterns (EPs) are associations of features whose frequencies increase significantly from one class to another. They have been proven useful to build powerful classifiers and to help establishing diagnosis. Because of the huge search space, mining and representing EPs is a hard task for large datasets. Thanks to the use of recent results on condensed representations of frequent closed patterns, we propose here an exact condensed representation of EPs. We also give a method to provide EPs with the highest growth rates, we call them strong emerging patterns (SEPs). In collaboration with the Philips company, experiments show the interests of SEPs.

Keywords

Computer Science

IEEE ExpertData mining and knowledge discovery: making sense out of data

4,643 Citations1996U.M. Feyyad

Find loads of the data mining and knowledge discovery making sense out of data book catalogues in this site as the choice of you visiting this page.

Lecture notes in computer scienceDiscovering Frequent Closed Itemsets for Association Rules

1,361 Citations1999Nicolas Pasquier, Yves Bastide +2 more

This paper proposes a new algorithm, called A-Close, using a closure mechanism to find frequent closed itemsets, and shows that this approach is very valuable for dense and/or correlated data that represent an important part of existing databases.

Efficient mining of emerging patterns

1,005 Citations1999Guozhu Dong, Jinyan Li

It is believed that EPs with low to medium support, such as 1%-20%, can give useful new insights and guidance to experts, in even “well understood” applications.

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.

Lecture notes in computer scienceCAEP: Classification by Aggregating Emerging Patterns

379 Citations1999Guozhu Dong, Xiuzhen Zhang +2 more

A new classifier, CAEP, is proposed using the following main ideas based on EPs, which is suitable for many applications, even those with large volumes of high dimensional data; it does not depend on dimension reduction on data; and it is usually equally accurate on all classes even if their populations are unbalanced.

Lecture notes in computer scienceMining All Non-derivable Frequent Itemsets

275 Citations2002Toon Calders, Bart Goethals

This paper presents deduction rules to derive tight bounds on the support of candidate itemsets, and shows how the deduction rules allow for constructing a minimal representation for all frequent itemsets.

Data Mining and Knowledge DiscoveryFree-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries

253 Citations2003Jean‐François Boulicaut, Artur Bykowski +1 more

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.

Lecture notes in computer scienceIssues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java™

236 Citations1999Malcolm Atkinson, Mick Jordan

The difficult problem of system evolution is identified as a major barrier to deploying orthogonal persistence for the Java language.

Lecture notes in computer scienceFast Algorithms for Mining Emerging Patterns

92 Citations2002James Bailey, Thomas Manoukian +1 more

This paper presents a new mining method for a particular type of emerging pattern known as a jumping emerging pattern, whose structure specifically targets the likely distribution of emerging patterns.

Exploring constraints to efficiently mine emerging patterns from large high-dimensional datasets

75 Citations2000Xiuzhen Zhang, Guozu Dong +1 more

A Constraint-based EP Miner that can mine all EPs at low support on large highdimensional datasets, with low minimums on growth rate and growth-rate improvement, and is more than twice as fast as the DenseMiner approach.

View PDF