Skip to Main content Skip to Navigation
Conference papers

A Novel Decomposition Algorithm for Binary Datatables: Encouraging Results on Discrimination Tasks

Martine Cadot 1 Alain Lelu 2, 3
1 ABC - Machine Learning and Computational Biology
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 KIWI - Knowledge Information and Web Intelligence
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present here an algorithm for decomposing any binary datatable into a set of “sufficient itemsets”, i.e. a non-redundant list of itemsets adequate for reconstructing the whole table up to a permutation of the rows. For doing so, we have replaced the “support” threshold criterion of the well-known Apriori algorithm by a “number of liberties”: the liberty count expresses how a (k+1)-level itemset is constrained by its k-level “parents”, till the level when the situation turns frozen. Our algorithm is symmetric: we take into account the absence of items as well as their presence in our itemsets. Conversely, we present a method for reconstituting the original data starting from our exact MIDOVA representation. We illustrate these points with the examples of Breast Cancer and Mushroom datasets from UCI Repository. We validate our approach by deriving a learning classifier approach and applying it to three discrimination problems drawn from the above-mentioned repository.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00460310
Contributor : Martine Cadot <>
Submitted on : Friday, February 26, 2010 - 7:12:13 PM
Last modification on : Friday, April 2, 2021 - 3:36:59 AM

Identifiers

  • HAL Id : hal-00460310, version 1

Collections

Citation

Martine Cadot, Alain Lelu. A Novel Decomposition Algorithm for Binary Datatables: Encouraging Results on Discrimination Tasks. Fourth International Conference on Research Challenges in Information Science - RCIS 2010, May 2010, Nice, France. pp.57-68. ⟨hal-00460310⟩

Share

Metrics

Record views

276