Skip Navigation

The Computer Journal 1970 13(1):63-69; doi:10.1093/comjnl/13.1.63
© 1970 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Boulton, D. M.
Right arrow Articles by Wallace, C. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A program for numerical classification

D. M. Boulton * and C. S. Wallace *

Department of Information Science, Monash University, Melbourne, Australia

In a previous paper (Wallace & Boulton, 1968) the information measure was derived. It is designed to measure the objective goodness of a nonhierarchical taxonomic classification and can be used to choose the best of a number of different classifications of the one data set. The information measure can also form the basis of a classification algorithm which searches directly for that classification with the best information measure. In the present paper such a classification algorithm is described together with an ALGOL program called Snob incorporating this algorithm.

Received November 1968.

* Department of Information Science, Monash University, Melbourne, Australia


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Br J Philos SciHome page
D. L. Dowe, S. Gardner, and G. Oppy
Bayes not Bust! Why Simplicity is no Problem for Bayesians
Brit J Philos Sci, December 1, 2007; 58(4): 709 - 754.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.