.png){kind=icon}
返回
Fast Fuzzy Pattern Tree Learning for Classification
.png){kind=icon}
PRE
AI
DOI：10.1109/TFUZZ.2015.2396078.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Fuzzy pattern trees have recently been introduced as a novel type of fuzzy system, specifically with regard to the modeling of classification functions in machine learning. Moreover, different algorithms for learning pattern trees from data have been proposed in the literature. While showing strong performance in terms of predictive accuracy, these algorithms exhibit a rather high computational complexity, and their runtime may become prohibitive for large datasets. In this paper, we therefore propose extensions of an existing state-of-the-art algorithm for fuzzy pattern tree induction, which are aimed at making this algorithm faster without compromising its predictive accuracy. These extensions include the use of adaptive sampling schemes, as well as heuristics for guiding the growth of pattern trees. The effectiveness of our modified algorithm is confirmed by means of several experimental studies.
Keyword:
Aggregation operators
classification
fuzzy pattern trees (FPT)
machine learning
multiarmed bandits
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.9
论文数:
5.0K
被引数:
2.9W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容