幂集上分次函数的最大相对发散原理
Maximum Relative Divergence Principle for Grading Functions on Power Sets
摘要:
本文将分次函数的相对散度的概念从全序链推广到有限事件空间的幂集。将香农熵的概念推广到幂集上的归一化分次函数。最大相对发散原理是最大熵原理的推广,它是确定“最合理”评分函数的工具,并用于某些运筹学应用中,在特定应用的线性约束下,该函数应该是“元素可加”或“基数依赖”的。
英文摘要:
The concept of Relative Divergence of one Grading Function from another is extended from totally ordered chains to power sets of finite event spaces. Shannon Entropy concept is extended to normalized grading functions on such power sets. Maximum Relative Divergence Principle is introduced as a generalization of the Maximum Entropy Principle as a tool for determining the "most reasonable" grading function and used in some Operations Research applications where that function is supposed to be "element-additive" or "cardinality-dependent" under application-specific linear constraints.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。