.png){kind=icon}
返回
FAN: Finding Accurate iNductions
.png){kind=icon}
PRE
AI
DOI：10.1006/ijhc.2002.1002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present a machine-learning algorithm that computes a small set of accurate and interpretable rules. The decisions of these rules can be straight-forwardly explained as the conclusions drawn by a case-based reasoner. Our system is named FAN, an acronym for finding accurate inductions. It starts from a collection of training examples and produces propositional rules able to classify unseen cases following a minimum-distance criterion in their evaluation procedure. In this way, we combine the advantages of instance-based algorithms and the conciseness of rule (or decision-tree) inducers, The algorithm followed by FAN can be seen as the result of successive steps of pruning heuristics. The main tool employed is that of the impurity level, a measure of the classification quality of a rule, inspired by a similar measure used in IB3. Finally, a number of experiments were conducted with standard benchmark datasets of the UCI repository to test the performance of our system, successfully comparing FAN with a wide collection of machine-learning algorithms. (C) 2002 Elsevier Science Ltd. All rights reserved.
Keyword:
machine learning
classification rules
minimum distance
induction from examples
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
5.1
论文数:
2.9K
被引数:
8.9K
机构
暂无机构信息
引用论文
.png){kind=icon}
Electrical Conductivity of Reproductive Tissue for Detection of Estrus in Dairy Cows用于检测奶牛发情的繁殖组织电导率
OAAI
OAAI分享收藏分享收藏分享收藏分享收藏
查看更多内容