Transition Graph Properties of Target Class Classification
Levon Aslanyan Hasmik Sahakyan
Target class classification is a mixed classification and transition model
whose integrated goal is to assign objects to a certain, so called target or
normal class. The classification process is iterative, and in each step an
object in a certain class undergoes an action attached to that class,
initiating the transition of the object to one of the classes. The sequence of
transitions, which we call class transitions, must be designed to provide the
final assignment of objects to the target class. The transition process can be
described in the form of a directed graph, and the success of the final
classification is mainly due to the properties of this graph. In our previous
research we showed that the desirable structure of the transition graph is an
oriented rooted tree with orientation towards the root vertex, which
corresponds to the normal class. It is clear that the transition graph of an
arbitrary algorithm (policy) may not have this property. In this paper we study
the structure of realistic transition graphs, which makes it possible to find
classification inconsistencies, helping to transfer it into the desired form.
The medical interpretation of dynamic treatment regime considered in the
article further clarifies the investigated framework.