经验树熵的比较
A Comparison of Empirical Tree Entropies
摘要:
而对于字符串,高阶经验熵是标准的熵度量,过去已经提出了几种不同的树的经验熵概念,特别是标签熵,度熵,后两者的条件版本,以及树的经验熵(这里称为标签-形状熵)。在本文中,我们进行了系统的比较,这些熵的措施。我们支持我们的理论研究与真正的XML数据的实验结果。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。