“…Combinatoric classification was introduced in Zeis and Smith (1974) and developed in Dunn andSmith (1980, 1982) with a further application in Dunn (1982). The algorithm on which subroutine MCE is based is described in detail in Dunn and Smith (1980). The a priori probability that an element comes from population i (i = 1, 2) is denoted by a., For the ith (i = 1, 2, ... , n) marginal classification rule, the probability of misclassifying an element from population 1 is denoted by Pi and the probability of misclassifying an element from population 2 is denoted by qi' As in Dunn and Smith (1980), it is assumed that the marginal rules are indexed such that n,~P2 ... «o.. For the joint procedure O"k,A, let the misclassification probabilities for elements from population 1 and population 2 be P, k A and q, k A respectively.…”