Applying d-XChoquet integrals in classification problems

Several generalizations of the Choquet integral have been applied in the Fuzzy Reasoning Method (FRM) of Fuzzy Rule-Based Classification Systems (FRBCS's) to improve its performance. Additionally, to achieve that goal, researchers have searched for new ways to provide more flexibility to those generalizations, by restricting the requirements of the functions being used in their constructions and relaxing the monotonicity of the integral. This is the case of CT-integrals, CC-integrals, CF-integrals, CF1F2-integrals and dCF-integrals, which obtained good performance in classification algorithms, more specifically, in the fuzzy association rule-based classification method for high-dimensional problems (FARC-HD). Thereafter, with the introduction of Choquet integrals based on restricted dissimilarity functions (RDFs) in place of the standard difference, a new generalization was made possible: the d-XChoquet (d-XC) integrals, which are ordered directional increasing functions and, depending on the adopted RDF, may also be a pre-aggregation function. Those integrals were applied in multi-criteria decision making problems and also in a motor-imagery brain computer interface framework. In the present paper, we introduce a new FRM based on the d-XC integral family, analyzing its performance by applying it to 33 different datasets from the literature.Supported by Navarra de Servicios y Tecnologías, S.A. (NASERTIC), CNPq (301618/2019-4, 305805/2021-5), FAPERGS (19/2551-0001660-3), the Spanish Ministry of Science and Technology (TIN2016-77356-P, PID2019- 108392GB I00 (MCIN/AEI/10.13039/501100011033)

Agrupamento Espectral Aglomerativo: Uma Proposta de Algoritmo

Neste artigo é apresentado o agrupamento espectral baseado em uma etapa de aglomeração dos k-menores autovalores da matriz Laplaciana que representao conjunto de dados no grafo. O algoritmo proposto é aplicado em três conjunto de dados de formatos geom´etricos distintos e os resultados são comparados aos agrupamentos obtidos pelo método k-médias e o método de agrupamento espectral via k-médias. Para medir a performance dos algoritmos é utilizada a medida-F e os resultados são apresentados em forma de tabela e gráfico. Por fim, é feito uma discussão a respeito da sensibilidade do método espectral na variação do número de vizinhos de um elemento do conjunto de dados

Optimal layout of ellipses and its application for additive manufacturing

The paper studies a layout problem of variable number of ellipses with variable sizes placed into an arbitrary disconnected polygonal domain with maximum packing factor. The ellipses can be continuously translated and rotated. Restrictions on the dimensions of the ellipses are taken into account. Tools for the mathematical modelling of placement constraints (distance constraints between ellipses and containment of ellipses into a polygonal domain) using the phi-function technique are introduced. The tools make it possible to formulate the layout problem in the form of MIP model that is equivalent to a sequence of nonlinear programming subproblems. We develop a new solution algorithm that involves the feasible starting point algorithm and optimisation procedure to search for efficient locally optimal solutions of the layout problem. This algorithm can be used in the design of parts for «support-free» additive manufacturing, taking into account the conditions for its static/ dynamic strength. Results of the algorithm implementation for a topologically optimised flat part with the analysis of a stress state are provided