Relation restricted prediction analysis
Ivo Düntsch, Günther Gediga · 1999
For the description of dependencies between a set of independent attributes Q and a dependent at-tribute p, a soft computing approach such as Rough Set Data Analysis (RSDA) uses only a very simple data representation model: The set of equivalence classes of feature vectors determined by Q, and p respectively. Although this model is satisfactory for many applications, there are sometimes problems to interpret the results, because this type of prediction does not take into account relational information within the attributes, for example, orderings. We consider the problem what form predic-tion should take in the “nominal attributes predict an ordinal attribute ” situation ((n; o)-prediction), as well as in the (o; o)-situation. We show how to define rough (n; o)- and (o; o)-prediction and ap-proximation in terms of relational compatibility, which respects the granularity information given by the attributes. A running example is presented to demonstrate the result of the three types of data analysis. 1