In Artificial Intelligence, planning refers to an area of research that proposes to develop systems that can automatically generate a result set, in the form of an integrated decision-making system through a formal procedure, known as plan. Instead of resorting to the scheduling algorithms to generate plans, it is proposed to operate the automatic learning by decision tree to optimize time. In this paper, we propose to build a classification model by induction graph from a learning sample containing plans that have an associated set of descriptors whose values change depending on each plan. This model will then operate for classifying new cases by assigning the appropriate plan.
Towards Feedback-to-Plan Decisions for Self-Evolving LLM Agents in CUDA Kernel Generation
Department of Computer Science and Technology, Tsinghua University, Beijing, China(清华大学计算机科学与技术系);Beijing National Research Center for Information Science and Technology, Beijing, China(北京信息科学国家研究中心)
Induction of Decision Trees based on Generalized Graph Queries
通常,决策树归纳算法仅限于处理非关系数据。给定一个记录,它们不考虑其他对象属性,即使它们可以为学习任务提供有价值的信息。在本文中,我们提出了GGQ-ID 3,一个多关系决策树学习算法,使用广义图论(GGQ)作为谓词的决策节点。GGQ允许表达复杂的模式(包括循环),并且可以逐步细化。此外,它们还可以评估结构(不仅是单个记录)并执行常规模式匹配。GGQ在GGQ-ID 3树构建过程中动态构建(模式挖掘)。我们将展示如何使用GGQ-ID 3来执行多关系机器学习,从而控制复杂性。最后给出了一些自动获得分类树和语义模式的实例。- Normalmente,los algoritmos de inducción de árboles de decisionón trabajan con datos no relacionales.在登记册上,没有任何关于其他对象的资料,因为这些资料是为了使学生能够获得适当的信息。本文介绍了GGQ-ID 3算法,它是一种利用广义图论(GGQ)进行多关系决策的算法。GGQs允许快递提供完整的服务(包括包裹),并可以进行一次又一次的改进。另外,可以评估结构(没有单独的寄存器),然后进行常规模式匹配。在GGQ-ID 3中,GGQ在构建Arbol的过程中进行模式挖掘。此外,我们还可以自动获取多种关系分类和赞助人的实际数据。