Tag Archives: Soft Computing – A Fusion of Foundations, Methodologies and Applications

Abstract  A generalization of the singular spectral analysis (SSA) technique to ill-defined data is introduced in this paper. The proposed
algorithm achieves tight estimates of the energy of irregular or aperiodic oscillations from records o… Continue reading →

Guest editorial: special issue on “knowledge extraction from low quality data: theoretical, methodological and practical issues”
Content Type Journal ArticleCategory EditorialPages 1-2DOI 10.1007/s00500-011-0765-5Authors
Luciano Sánchez, Comput… Continue reading →

Abstract  In this paper, we give a generalization of the Chebyshev type inequalities for Sugeno integral with respect to non-additive
measures. The main results of this paper generalize most of the inequalities for Sugeno integral obtained b… Continue reading →

Abstract  We show that every pseudo-hoop satisfies the Riesz decomposition property. We visualize basic pseudo-hoops by functions on
a linearly ordered set. Finally, we study normal-valued basic pseudo-hoops giving a countable base of equati… Continue reading →

Abstract  We prove that Haveshki’s and Eslami’s n-fold implicative basic logic is Gödel logic and n-fold positive implicative basic logic is a fragment of ukasiewicz logic.

Content Type Journal ArticleCategory Original PaperPages 1-… Continue reading →

Abstract  Developing rule extraction algorithms from machine learning techniques such as artificial neural networks and support vector
machines (SVMs), which are considered incomprehensible black-box models, is an important topic in current … Continue reading →

Abstract  Tournament selection is one of the most commonly used parent selection schemes in genetic programming (GP). While it has a
number of advantages over other selection schemes, it still has some issues that need to be thoroughly inves… Continue reading →

Abstract  This paper proposes a framework named multi-objective ant colony optimization based on decomposition (MoACO/D) to solve bi-objective
traveling salesman problems (bTSPs). In the framework, a bTSP is first decomposed into a number of… Continue reading →

Abstract  Quite recently, Savaş (Appl Math Lett 21:134–141, 2008), defined the lacunary statistical analogue for double sequence

X={Xk,l}
of fuzzy numbers as follows: a double sequence

X={Xk,l}
is said to be lacunary P-statistically … Continue reading →

Abstract  This paper performs an unprecedented comparative study of Metaheuristic optimization frameworks. As criteria for comparison
a set of 271 features grouped in 30 characteristics and 6 areas has been selected. These features include t… Continue reading →