Thumbnail
Access Restriction
Subscribed

Author Green, Christopher D.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1973
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract The class of rooted trees or arborescences used for modeling hierarchical classification and indexing procedures is considered. An entropy function measuring the complexity of the paths from the root to the terminal vertices is defined. Upper and lower bounds are found for the values of this function, and it is shown to be additive with respect to a tree product operation defined here. The results are extended to the case when the terminal vertices are weighted, and the path entropy function is compared to the information function defined by C. Picard for questionnaires.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1973-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 20
Issue Number 3
Page Count 7
Starting Page 378
Ending Page 384


Open content in new tab

   Open content in new tab
Source: ACM Digital Library