Decision trees and reducts for distributed decision tables

Mikhail Moshkov*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In the paper greedy algorithms for construction of decision trees and relative reducts for joint decision table generated by distributed decision tables are studied. Two ways for definition of joint decision table are considered: based on the assumption that the universe of joint table is the intersection of universes of distributed tables, and based on the assumption that the universe of joint table is the union of universes of distributed tables. Furthermore, a case is considered when the information about distributed decision tables is given in the form of decision rule systems.

Original languageEnglish (US)
Title of host publicationMonitoring, Security, and Rescue Techniques in Multiagent Systems
Pages239-248
Number of pages10
StatePublished - Dec 1 2005

Publication series

NameAdvances in Soft Computing
Volume28
ISSN (Print)1615-3871
ISSN (Electronic)1860-0794

Keywords

  • Decision trees
  • Distributed decision tables
  • Greedy algorithms
  • Relative reducts

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computational Mechanics
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Decision trees and reducts for distributed decision tables'. Together they form a unique fingerprint.

Cite this