Answers are grounded in this paper and cite their sources.
Fuzzy Pattern Trees (FPTs) are symbolic tree-based structures whose internal nodes are fuzzy operators, and the leaves are fuzzy features, which enhance interpretability by representing data with meaningful fuzzy terms. However, conventional FPT approaches typically employ uniformly distributed membership functions, which often fail to accurately represent features in real-world datasets. In this work, we propose an automatic method to adapt the bounds of fuzzy features based on their data distributions, with a focus on a simple triangular membership scheme. We evaluate our approach across 11 benchmark classification problems, incorporating six parsimony pressure methods to promote more compact solutions. Our results demonstrate that the adapted fuzzification scheme, beyond improving interpretability, consistently yields models that better balance accuracy and size when compared to uniform representations, appearing on the Pareto front 20 times, while the second-best scheme appeared only 15 times.
No takes yet. Share an insight, caveat, or question.
Lima et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: