A Rough Set Framework for Learning in a Directed Acyclic Graph

  • Authors:
  • Herman Midelfart;Henryk Jan Komorowski

  • Affiliations:
  • -;-

  • Venue:
  • TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Prediction of gene function from expression profiles introduces a new learning problem where the decision classes associated with the objects (i.e., genes) are organized in a directed acyclic graph (DAG). Standard learning methods such a Rough Sets assume that these classes are unrelated, and cannot handle this problem properly. To this end, we introduce an extended rough set framework with several new operators. We show how these operators can be used in an new learning algorithm.