闭包算子:复杂性及其在分类和决策中的应用
Closure operators: Complexity and applications to classification and decision-making
摘要:
我们研究闭包算子的复杂性,并将其应用于机器学习和决策理论。在机器学习中,闭包算子在数据分类和聚类中自然出现。在决策理论中,他们可以模拟选择菜单的等价性,因此也可以模拟偏好灵活性的情况。我们的贡献是制定一个概念的复杂性的封闭运营商,这转化为ML中的分类器的复杂性,或决策理论中的效用函数。
英文摘要:
We study the complexity of closure operators, with applications to machine learning and decision theory. In machine learning, closure operators emerge naturally in data classification and clustering. In decision theory, they can model equivalence of choice menus, and therefore situations with a preference for flexibility. Our contribution is to formulate a notion of complexity of closure operators, which translate into the complexity of a classifier in ML, or of a utility function in decision theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。