Skip Navigation

The Computer Journal 1982 25(2):183-187; doi:10.1093/comjnl/25.2.183
© 1982 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 Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Yannakoudakis, E. J.
Right arrow Articles by Wu, A. K. P
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Quasi-Equifrequent Group Generation and Evaluation

E. J. Yannakoudakis * and A. K. P Wu *

Postgraduate School of Computer Science, University of Bradford, Bradford, UK

The frequency of occurrence and other statistical results derived thereupon from unique items in collections such as letters, words and records has recently formed the basis for the design of optimal information structures. A fundamental theorem of information science states that the information representing capability of a set of symbols is maximized when the probability of occurrence of any symbol in the available set becomes the same. Equifrequency however is very rarely encountered in real applications and it is in many cases desirable to have sets of items or symbols which are equifrequent within a certain deviation i.e. quasi-equifrequent. This paper presents an algorithm for generating equifrequent sets and evaluates and compares the efficiency and accuracy of (a) the entropy and (b) the variance concepts for measuring the degree of quasi-equifrequency in a set. Tests are carried out on the occurrence of the letters A-Z (out of a total of 7,908,100 letters) on a 244 unique subfields (out of a total of 1,113,447 bibliographic record subfields) and an absolutely equifrequent set of subfields is presented.

Received November 1980.

* Postgraduate School of Computer Science, University of Bradford, Bradford, West Yorkshire BD7 1DP, UK


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




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.