Current Trends in Rough Set Flow Graphs

Abstract

In this chapter, we review a graphical framework for reasoning from data, called rough set flow graphs (RSFGs), and point out issues of current interest involving RSFG inference. Our discussion begins by examining two methods for conducting inference in a RSFG. We highlight the fact that the order of variable elimination, called an elimination ordering, affects the amount of computation needed for inference. The culminating result is the incorporation of an algorithm for obtaining a good elimination ordering into our RSFG inference algorithm.