Some Heuristics for Default Knowledge Discovery

  • Tor-Kristian Jenssen
  • Jan Komorowski
  • Aleksander Øhrn
Conference paper

DOI: 10.1007/3-540-69115-4_51

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1424)
Cite this paper as:
Jenssen TK., Komorowski J., Øhrn A. (1998) Some Heuristics for Default Knowledge Discovery. In: Polkowski L., Skowron A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science, vol 1424. Springer, Berlin, Heidelberg

Abstract

In this paper discovery of default knowledge as proposed by Mollestad [7], [8], [9], [10] is further investigated. Mollestad’s algorithm, as described in [9], is refined and extended in several ways. In particular, new heuristics guiding the search for default decision rules are proposed and evaluated. The results so far have been encouraging when the (modified) framework is compared to other rough set methods.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Tor-Kristian Jenssen
    • 1
  • Jan Komorowski
    • 1
  • Aleksander Øhrn
    • 1
  1. 1.Knowledge Systems Group, Dept. of Computer and Information ScienceNorwegian University of Science and TechnologyTrondheimNorway

Personalised recommendations