SPLINE OPTIMIZATION OF SOFT CONNECTIVES IN MACHINE LEARNING MODELS
DOI:
https://doi.org/10.19153/cleiej.27.1.2Abstract
In this study, the problem of limited accuracy of machine learning models using soft logical connectives is investigated. Such connectives have shown their effectiveness in models with fuzzy initial data. On the one hand, the fundamental disadvantage of soft connectives is their non-associativity. On the other hand, the disadvantages of the currently used soft connectives include the loss of monotonicity and the inability to control several factors simultaneously. All these problems have been solved by the authors. We have proposed an approximation of the signum function by a ?1-smooth spline. The first part of the spline is responsible for the curvature of the connective at the diagonal and is adjustable. The second part of the spline is the solution to the optimization problem. We minimized the difference between the connective and the associative connective, the latter in our study was the minimum function. In the resulting solution, the rate of deviation reduction is the highest among known connectives. We have achieved not only a small deviation from associativity, but also the presence of a large domain of exact associativity. This area is up to a third of the volume of all triples of arguments. A comparative analysis of the currently used soft connectives with the constructed model was carried out. It was shown that the spline approximation is able to reduce the influence of all negative factors and is more flexible in setting. Moreover, the constructed spline model allows numerous modifications depending on the factor that requires the most attention for different tasks.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Vyacheslav Kalnitsky, Valery Vilkov
This work is licensed under a Creative Commons Attribution 4.0 International License.
CLEIej is supported by its home institution, CLEI, and by the contribution of the Latin American and international researchers community, and it does not apply any author charges whatsoever for submitting and publishing. Since its creation in 1998, all contents are made publicly accesibly. The current license being applied is a (CC)-BY license (effective October 2015; between 2011 and 2015 a (CC)-BY-NC license was used).