Semantics of Instance Selection Clause Samples

Semantics of Instance Selection. ‌ The case of instance selection behaves exactly as the previous one. Let us call τis the specific operator for outlier detection; again, τis is defined row-by-row. For a specific component j, Pis[j] ∈ {0, 1}, and we define τis by components, each component corresponds to an instance j, and it is treated by the operator τj . The idea is that the value in the j-th position represents the elimination, or not, of the j-th row. As such, for example, Pod[j] = 1 (resp., 0) is interpreted as the j-th instance is not eliminated (resp., eliminated). In other words, instance selection and outlier detection are opposite to each other. Thus, we have: N1 r1  N1 r1 . . . . . .    . . . . . . , P ) =  Nz rm∗ . . . . . .  Np rj  if Pis[j] = 0 is