arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.11901cs.AI
收藏

基于概率律发现的机器学习:简明介绍

Machine Learning with Probabilistic Law Discovery: A Concise Introduction

Ershov Institute of Informatics Systems(叶尔绍夫信息系统研究所)

Alexander Demin, Denis Ponomaryov

摘要:

概率规律发现(PLD)是一种基于逻辑的机器学习方法,它实现了概率规则学习的一种变体。在几个方面,PLD接近决策树/随机森林方法,但它在如何定义相关规则方面有很大不同。PLD的学习过程解决了与搜索规则(称为概率法则)相关的优化问题,这些规则具有最小长度和相对较高的概率。在推理时,这些规则的集合用于预测。概率定律是人类可读的,基于PLD的模型是透明的,本质上是可解释的。PLD的应用包括分类/聚类/回归任务,以及时间序列分析/异常检测和自适应(机器人)控制。在本文中,我们概述了PLD的主要原理,突出其优点和局限性,并提供了一些应用指南。

英文摘要:

Probabilistic Law Discovery (PLD) is a logic based Machine Learning method, which implements a variant of probabilistic rule learning. In several aspects, PLD is close to Decision Tree/Random Forest methods, but it differs significantly in how relevant rules are defined. The learning procedure of PLD solves the optimization problem related to the search for rules (called probabilistic laws), which have a minimal length and relatively high probability. At inference, ensembles of these rules are used for prediction. Probabilistic laws are human-readable and PLD based models are transparent and inherently interpretable. Applications of PLD include classification/clusterization/regression tasks, as well as time series analysis/anomaly detection and adaptive (robotic) control. In this paper, we outline the main principles of PLD, highlight its benefits and limitations and provide some application guidelines.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑