Skip to main navigation Skip to search Skip to main content

Functional entropy and decision trees

  • Belarusian State University

Research output: Contribution to journal › Conference article › peer-review

Abstract

We introduce a technique to compute several information estimations for Boolean and multivalued functions. Special features of these estimations for completely and incompletely specified logic functions, including symmetric logic functions are investigated. Finally, we give an algorithm for determining various information measures for logical functions based on decision trees.

Original languageEnglish
Pages (from-to)257-262
Number of pages6
JournalProceedings of The International Symposium on Multiple-Valued Logic
StatePublished - 1998
EventProceedings of the 1998 28th International Symposium on Multiple-Valued Logic - Fukuoka, Jpn
Duration: May 27 1998 → May 29 1998

ASJC Scopus Subject Areas

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'Functional entropy and decision trees'. Together they form a unique fingerprint.

Cite this