By Topic

A note on the capacity region of the multiple-access channel (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

In the classification problem for chromosomes there are N chromosomes which must be classified into k populations A_{1}, \cdots ,A_{k} having known probability distributions. It is further known that these N chromosomes have N_{i} in class A_{i}, i = 1,2, \cdots ,k . This is a compound decision problem whose optimal solution gives a classification algorithm which is not currently useful in practice because of its long computation time. Two other classification methods are considered, and the results are compared. One is the method often used for the classification of the 46 human chromosomes, where the knowledge about the exact number of chromosome types is disregarded, and only the a priori probability that a chromosome originates from population A_{i} is used. The other method permits only classifications with the correct number of objects in each class and selects from all the possible classifications that one which has the maximum likelihood function. This last method has some advantages for a small number of objects, particularly if the numbers of objects in the classes are equal.

Published in:

Information Theory, IEEE Transactions on  (Volume:25 ,  Issue: 4 )