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

K. Adaricheva, J. B. Nation

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

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 a lattice theoretic 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 data provided by the University of Hawaii Cancer Center.

Original languageEnglish
Pages (from-to)307-315
Number of pages9
JournalTheoretical Computer Science
Volume658
DOIs
Publication statusPublished - Jan 7 2017

Keywords

  • Association rules
  • Binary table
  • Galois lattice
  • Hypergraph dualization
  • Implicational basis

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Discovery of the D-basis in binary tables based on hypergraph dualization'. Together they form a unique fingerprint.

Cite this