2020/06/01 by Danny Hucke, Hucke, Danny, Markus Lohrey +3 · 1 citation
Computer Science · Mathematics · #94A17 #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.IT #math.CO #math.IT #msc:94A17
paper · pdf · doi:10.48550/arxiv.2006.01695
arxiv created 2020/06/01 · arxiv updated 2020/06/03
Whereas for strings, higher-order empirical entropy is the standard entropy measure, several different notions of empirical entropy for trees have been proposed in the past, notably label entropy, degree entropy, conditional versions of the latter two, and empirical entropy of trees (here, called label-shape entropy). In this paper, we carry out a systematic comparison of these entropy measures. We underpin our theoretical investigations by experimental results with real XML data.