Discovery of the $D$-basis in binary tables based on hypergraph dualization

TL;DR

This paper presents a new method for discovering the $D$-basis of implications in binary tables using hypergraph dualization, which leverages lattice theory and is applicable to gene expression data analysis.

Contribution

The paper introduces a novel approach combining lattice theory and hypergraph dualization to efficiently identify the $D$-basis in binary data tables.

Findings

Effective $D$-basis discovery in binary tables

Application to gene expression data analysis

Utilization of hypergraph dualization algorithm

Abstract

Discovery of (strong) association rules, or implications, is an important task in data management, and it finds application in artificial intelligence, data mining and the semantic web. We introduce a novel approach for the discovery of a specific set of implications, called the $D$-basis, that provides a representation for a reduced binary table, based on the structure of its Galois lattice. At the core of the method are the $D$-relation defined in the lattice theory framework, and the hypergraph dualization algorithm that allows us to effectively produce the set of transversals for a given Sperner hypergraph. The latter algorithm, first developed by specialists from Rutgers Center for Operations Research, has already found numerous applications in solving optimization problems in data base theory, artificial intelligence and game theory. One application of the method is for analysis of gene expression data related to a particular phenotypic variable, and some initial testing is done for the data provided by the University of Hawaii Cancer Center.