scispace - formally typeset
Search or ask a question
Institution

University of Jaén

EducationJaén, Spain
About: University of Jaén is a education organization based out in Jaén, Spain. It is known for research contribution in the topics: Population & Fuzzy logic. The organization has 4643 authors who have published 12317 publications receiving 268471 citations. The organization is also known as: University of Jaen & Universidad de Jaén.


Papers
More filters
Journal ArticleDOI
TL;DR: In this review the usual methods applied in systematic reviews and meta-analyses are outlined, and the most common procedures for combining studies with binary outcomes are described, illustrating how they can be done using Stata commands.

31,656 citations

Journal ArticleDOI
TL;DR: The basics are discussed and a survey of a complete set of nonparametric procedures developed to perform both pairwise and multiple comparisons, for multi-problem analysis are given.
Abstract: a b s t r a c t The interest in nonparametric statistical analysis has grown recently in the field of computational intelligence. In many experimental studies, the lack of the required properties for a proper application of parametric procedures - independence, normality, and homoscedasticity - yields to nonparametric ones the task of performing a rigorous comparison among algorithms. In this paper, we will discuss the basics and give a survey of a complete set of nonparametric procedures developed to perform both pairwise and multiple comparisons, for multi-problem analysis. The test problems of the CEC'2005 special session on real parameter optimization will help to illustrate the use of the tests throughout this tutorial, analyzing the results of a set of well-known evolutionary and swarm intelligence algorithms. This tutorial is concluded with a compilation of considerations and recommendations, which will guide practitioners when using these tests to contrast their experimental results.

3,832 citations

Journal ArticleDOI
TL;DR: In this paper, the authors use behavioral theory to show that family firms are risk-averse and risk-wary at the same time, and that the predictions of behavioral theory differ depending on family ownership.
Abstract: This paper challenges the prevalent notion that family-owned firms are more risk averse than publicly owned firms. Using behavioral theory, we argue that for family firms, the primary reference point is the loss of their socioemotional wealth, and to avoid those losses, family firms are willing to accept a significant risk to their performance; yet at the same time, they avoid risky business decisions that might aggravate that risk. Thus, we propose that the predictions of behavioral theory differ depending on family ownership. We confirm our hypotheses using a population of 1,237 family-owned olive oil mills in Southern Spain who faced the choice during a 54-year period of becoming a member of a cooperative, a decision associated with loss of family control but lower business risk, or remaining independent, which preserves the family's socioemotional wealth but greatly increases its performance hazard. As shown in this study, family firms may be risk willing and risk averse at the same time.

2,978 citations

Journal ArticleDOI
TL;DR: This paper develops a computational technique for computing with words without any loss of information in the 2-tuple linguistic model and extends different classical aggregation operators to deal with this model.
Abstract: The fuzzy linguistic approach has been applied successfully to many problems. However, there is a limitation of this approach imposed by its information representation model and the computation methods used when fusion processes are performed on linguistic values. This limitation is the loss of information; this loss of information implies a lack of precision in the final results from the fusion of linguistic information. In this paper, we present tools for overcoming this limitation. The linguistic information is expressed by means of 2-tuples, which are composed of a linguistic term and a numeric value assessed in (-0.5, 0.5). This model allows a continuous representation of the linguistic information on its domain, therefore, it can represent any counting of information obtained in a aggregation process. We then develop a computational technique for computing with words without any loss of information. Finally, different classical aggregation operators are extended to deal with the 2-tuple linguistic model.

2,353 citations

Journal ArticleDOI
01 Jul 2012
TL;DR: A taxonomy for ensemble-based methods to address the class imbalance where each proposal can be categorized depending on the inner ensemble methodology in which it is based is proposed and a thorough empirical comparison is developed by the consideration of the most significant published approaches to show whether any of them makes a difference.
Abstract: Classifier learning with data-sets that suffer from imbalanced class distributions is a challenging problem in data mining community. This issue occurs when the number of examples that represent one class is much lower than the ones of the other classes. Its presence in many real-world applications has brought along a growth of attention from researchers. In machine learning, the ensemble of classifiers are known to increase the accuracy of single classifiers by combining several of them, but neither of these learning techniques alone solve the class imbalance problem, to deal with this issue the ensemble learning algorithms have to be designed specifically. In this paper, our aim is to review the state of the art on ensemble techniques in the framework of imbalanced data-sets, with focus on two-class problems. We propose a taxonomy for ensemble-based methods to address the class imbalance where each proposal can be categorized depending on the inner ensemble methodology in which it is based. In addition, we develop a thorough empirical comparison by the consideration of the most significant published approaches, within the families of the taxonomy proposed, to show whether any of them makes a difference. This comparison has shown the good behavior of the simplest approaches which combine random undersampling techniques with bagging or boosting ensembles. In addition, the positive synergy between sampling techniques and bagging has stood out. Furthermore, our results show empirically that ensemble-based algorithms are worthwhile since they outperform the mere use of preprocessing techniques before learning the classifier, therefore justifying the increase of complexity by means of a significant enhancement of the results.

2,228 citations


Authors

Showing all 4733 results

NameH-indexPapersCitations
Francisco Herrera139100182976
R. Graham Cooks11073647662
Michel Caboche7520623821
Francisco J. Corpas7425417491
Carlos M. Herrera7022816438
Antonio Gálvez6125912404
Juan B. Barroso6016011705
Federico Garrido5824012077
Mariano Rodriguez5828912330
Luis Martínez5736416958
Jalel Labidi5631210965
Gustavo E. Romero5655812008
Salvador García5118020281
Miguel Delgado-Rodríguez5024821968
Alberto Fernández4920614158
Network Information
Related Institutions (5)
University of Granada
59.2K papers, 1.4M citations

96% related

Complutense University of Madrid
90.2K papers, 2.1M citations

93% related

University of Valencia
65.6K papers, 1.7M citations

93% related

Autonomous University of Barcelona
80.5K papers, 2.3M citations

91% related

University of Barcelona
108.5K papers, 3.7M citations

91% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202333
2022148
2021871
2020948
2019847
2018810