当前位置:
X-MOL 学术
›
arXiv.cs.LO
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Interval Temporal Logic Decision Tree Learning
arXiv - CS - Logic in Computer Science Pub Date : 2020-03-10 , DOI: arxiv-2003.04952 Andrea Brunello, Guido Sciavicco, and Ionel Eduard Stan
arXiv - CS - Logic in Computer Science Pub Date : 2020-03-10 , DOI: arxiv-2003.04952 Andrea Brunello, Guido Sciavicco, and Ionel Eduard Stan
Decision trees are simple, yet powerful, classification models used to
classify categorical and numerical data, and, despite their simplicity, they
are commonly used in operations research and management, as well as in
knowledge mining. From a logical point of view, a decision tree can be seen as
a structured set of logical rules written in propositional logic. Since
knowledge mining is rapidly evolving towards temporal knowledge mining, and
since in many cases temporal information is best described by interval temporal
logics, propositional logic decision trees may evolve towards interval temporal
logic decision trees. In this paper, we define the problem of interval temporal
logic decision tree learning, and propose a solution that generalizes classical
decision tree learning.
中文翻译:
区间时序逻辑决策树学习
决策树是简单而强大的分类模型,用于对分类和数值数据进行分类,尽管它们很简单,但它们通常用于运筹学和管理以及知识挖掘。从逻辑的角度来看,决策树可以看作是用命题逻辑编写的一组结构化的逻辑规则。由于知识挖掘正在迅速向时间知识挖掘发展,并且由于在许多情况下时间信息最好用区间时间逻辑来描述,命题逻辑决策树可能会向区间时间逻辑决策树发展。在本文中,我们定义了区间时序逻辑决策树学习的问题,并提出了一种泛化经典决策树学习的解决方案。
更新日期:2020-03-13
中文翻译:
区间时序逻辑决策树学习
决策树是简单而强大的分类模型,用于对分类和数值数据进行分类,尽管它们很简单,但它们通常用于运筹学和管理以及知识挖掘。从逻辑的角度来看,决策树可以看作是用命题逻辑编写的一组结构化的逻辑规则。由于知识挖掘正在迅速向时间知识挖掘发展,并且由于在许多情况下时间信息最好用区间时间逻辑来描述,命题逻辑决策树可能会向区间时间逻辑决策树发展。在本文中,我们定义了区间时序逻辑决策树学习的问题,并提出了一种泛化经典决策树学习的解决方案。