Carlos Morell
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Carlos Morell has a total of 73 co-authors. Here are the top co-authors by number of shared publications:
- Bernard De Baets
KERMIT, Department of Data Analysis and Mathematical Modelling, Ghent University, Gent, Belgium
7 shared publications - Sebastián Ventura
University of Córdoba
7 shared publications - Bac Nguyen
Sony AI
6 shared publications - Franscesc J. Ferri
Departament d’Informàtica, Universitat de València, Burjassot, Spain
6 shared publications - Rafael Bello
Universidad Central “Marta Abreu” de Las Villas
6 shared publications Yanet Rodriguez
Computer Science Department. Universidad Central de Las Villas, C. Camajuani km 5, Santa Clara, Cuba
5 shared publications
Latest Publications
- 16 October 2025
- Published by Springer Nature
- p. 201-211
WilsonIA: Rule Based Framework for Supporting Non-expert Creating Machine Learning Models
- 16 October 2025
- Published by Springer Nature
- p. 201-211
WilsonIA: Rule Based Framework for Supporting Non-expert Creating Machine Learning Models
- Open Access
- 26 June 2025
- Published by PIAP - Industrial Research Institute for Automation and Measurements in Journal of Automation, Mobile Robotics and Intelligent Systems
- p. 1-7
Development of a Distributed Outlier Detection Method based on the Alternating Direction Method of Multipliers
In data mining, one of the most studied problems is outlier detection, which involves identifying "unusual" data points within a dataset that are suspected to be generated by a different mechanism than the rest of the dataset. Outlier detection has applications in discovering novel information, detecting bank fraud, and identifying system intrusions, and others. However, handling large volumes of data, known as big data, poses a challenge to outlier detection algorithms because the resources of a single computer may not be sufficient to achieve efficient performance. Furthermore, datasets are often stored in distributed environments.The goal of this work is to develop a new distributed outlier detection algorithm based on the solution of the support vector data description using the alternating direction method of multipliers. Mathematical optimization methods and Python language libraries are mainly used for the implementation. As a result, the design and distributed implementation of the proposed algorithm are achieved, which are validated using several test datasets, yielding satisfactory and competitive results compared to existing methods.
- 26 June 2025
- Published by PIAP - Industrial Research Institute for Automation and Measurements in Journal of Automation, Mobile Robotics and Intelligent Systems
- p. 1-7
Open AccessDevelopment of a Distributed Outlier Detection Method based on the Alternating Direction Method of Multipliers
In data mining, one of the most studied problems is outlier detection, which involves identifying "unusual" data points within a dataset that are suspected to be generated by a different mechanism than the rest of the dataset. Outlier detection has applications in discovering novel information, detecting bank fraud, and identifying system intrusions, and others. However, handling large volumes of data, known as big data, poses a challenge to outlier detection algorithms because the resources of a single computer may not be sufficient to achieve efficient performance. Furthermore, datasets are often stored in distributed environments.The goal of this work is to develop a new distributed outlier detection algorithm based on the solution of the support vector data description using the alternating direction method of multipliers. Mathematical optimization methods and Python language libraries are mainly used for the implementation. As a result, the design and distributed implementation of the proposed algorithm are achieved, which are validated using several test datasets, yielding satisfactory and competitive results compared to existing methods.
- Open Access
- 15 February 2022
- Published by Wolters Kluwer Health in The Pediatric Infectious Disease Journal
- Vol. 42 (3) , 271-273
Hemophagocytic Lymphohistiocytosis and Severe Hypoxemia in a Preterm Infant
- 15 February 2022
- Published by Wolters Kluwer Health in The Pediatric Infectious Disease Journal
- Vol. 42 (3) , 271-273
Open AccessHemophagocytic Lymphohistiocytosis and Severe Hypoxemia in a Preterm Infant
- Open Access
- 9 October 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (20) , 9380
Dwell Time Estimation of Import Containers as an Ordinal Regression Problem
The optimal stacking of import containers in a terminal reduces the reshuffles during the unloading operations. Knowing the departure date of each container is critical for optimal stacking. However, such a date is rarely known because it depends on various attributes. Therefore, some authors have proposed estimation algorithms using supervised classification. Although supervised classifiers can estimate this dwell time, the variable “dwell time” takes ordered values for this problem, suggesting using ordinal regression algorithms. Thus, we have compared an ordinal regression algorithm (selected from 15) against two supervised classifiers (selected from 30). We have set up two datasets with data collected in a container terminal. We have extracted and evaluated 35 attributes related to the dwell time. Additionally, we have run 21 experiments to evaluate both approaches regarding the mean absolute error modified and the reshuffles. As a result, we have found that the ordinal regression algorithm outperforms the supervised classifiers, reaching the lowest mean absolute error modified in 15 () and the lowest reshuffles in 14 () experiments.- 9 October 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (20) , 9380
Open AccessDwell Time Estimation of Import Containers as an Ordinal Regression Problem
The optimal stacking of import containers in a terminal reduces the reshuffles during the unloading operations. Knowing the departure date of each container is critical for optimal stacking. However, such a date is rarely known because it depends on various attributes. Therefore, some authors have proposed estimation algorithms using supervised classification. Although supervised classifiers can estimate this dwell time, the variable “dwell time” takes ordered values for this problem, suggesting using ordinal regression algorithms. Thus, we have compared an ordinal regression algorithm (selected from 15) against two supervised classifiers (selected from 30). We have set up two datasets with data collected in a container terminal. We have extracted and evaluated 35 attributes related to the dwell time. Additionally, we have run 21 experiments to evaluate both approaches regarding the mean absolute error modified and the reshuffles. As a result, we have found that the ordinal regression algorithm outperforms the supervised classifiers, reaching the lowest mean absolute error modified in 15 () and the lowest reshuffles in 14 () experiments. - 13 May 2019
- Published by Springer Nature in Progress in Artificial Intelligence
- Vol. 8 (3) , 375-387
WordificationMI: multi-relational data mining through multiple-instance propositionalization
- 13 May 2019
- Published by Springer Nature in Progress in Artificial Intelligence
- Vol. 8 (3) , 375-387
WordificationMI: multi-relational data mining through multiple-instance propositionalization
- 30 March 2019
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Computación y Sistemas
- Vol. 23 (1) , 197-211
Solutions To Storage Spaces Allocation Problem for Import Containers by Exact and Heuristic Methods
Maritime transport carries out most of the world's commercial activities. One of the elements used for maritime transportation is the container. Before moving to or from a country, containers are stacked in a container terminal, also called container yard. Container terminals perform multiple and complex operations daily. Scientific community pays attention to the container stacking operations in the yard area due to its complexity and relevance in the international commerce. In this work, we solve the problem of optimizing the storage spaces allocation to imported containers by the linear mixed integer programming method. The objective of this work is to solve storage space allocation problem for imported containers, in an acceptable computational time. We use an exact optimization method for the operations of a real container yard. We model this optimization problem mathematically as a generalized assignment problem. We present the mathematical formulation, its solution, as well as the computational experiments.
- 30 March 2019
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Computación y Sistemas
- Vol. 23 (1) , 197-211
Solutions To Storage Spaces Allocation Problem for Import Containers by Exact and Heuristic Methods
Maritime transport carries out most of the world's commercial activities. One of the elements used for maritime transportation is the container. Before moving to or from a country, containers are stacked in a container terminal, also called container yard. Container terminals perform multiple and complex operations daily. Scientific community pays attention to the container stacking operations in the yard area due to its complexity and relevance in the international commerce. In this work, we solve the problem of optimizing the storage spaces allocation to imported containers by the linear mixed integer programming method. The objective of this work is to solve storage space allocation problem for imported containers, in an acceptable computational time. We use an exact optimization method for the operations of a real container yard. We model this optimization problem mathematically as a generalized assignment problem. We present the mathematical formulation, its solution, as well as the computational experiments.
- 1 January 2019
- Published by Elsevier in Information Sciences
- Vol. 471, 149-163
An efficient method for clustered multi-metric learning
- 1 January 2019
- Published by Elsevier in Information Sciences
- Vol. 471, 149-163
An efficient method for clustered multi-metric learning
- 29 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 50 (3) , 1072-1083
Scalable Large-Margin Distance Metric Learning Using Stochastic Gradient Descent
The key to success of many machine learning and pattern recognition algorithms is the way of computing distances between the input data. In this paper, we propose a large-margin-based approach, called the large-margin distance metric learning (LMDML), for learning a Mahalanobis distance metric. LMDML employs the principle of margin maximization to learn the distance metric with the goal of improving k-nearest-neighbor classification. The main challenge of distance metric learning is the positive semidefiniteness constraint on the Mahalanobis matrix. Semidefinite programming is commonly used to enforce this constraint, but it becomes computationally intractable on large-scale data sets. To overcome this limitation, we develop an efficient algorithm based on a stochastic gradient descent. Our algorithm can avoid the computations of the full gradient and ensure that the learned matrix remains within the positive semidefinite cone after each iteration. Extensive experiments show that the proposed algorithm is scalable to large data sets and outperforms other state-of-the-art distance metric learning approaches regarding classification accuracy and training time.
- 29 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 50 (3) , 1072-1083
Scalable Large-Margin Distance Metric Learning Using Stochastic Gradient Descent
The key to success of many machine learning and pattern recognition algorithms is the way of computing distances between the input data. In this paper, we propose a large-margin-based approach, called the large-margin distance metric learning (LMDML), for learning a Mahalanobis distance metric. LMDML employs the principle of margin maximization to learn the distance metric with the goal of improving k-nearest-neighbor classification. The main challenge of distance metric learning is the positive semidefiniteness constraint on the Mahalanobis matrix. Semidefinite programming is commonly used to enforce this constraint, but it becomes computationally intractable on large-scale data sets. To overcome this limitation, we develop an efficient algorithm based on a stochastic gradient descent. Our algorithm can avoid the computations of the full gradient and ensure that the learned matrix remains within the positive semidefinite cone after each iteration. Extensive experiments show that the proposed algorithm is scalable to large data sets and outperforms other state-of-the-art distance metric learning approaches regarding classification accuracy and training time.
- 22 September 2018
- Published by Springer Nature
- p. 219-227
Accelerated Proximal Gradient Descent in Metric Learning for Kernel Regression
- 22 September 2018
- Published by Springer Nature
- p. 219-227
Accelerated Proximal Gradient Descent in Metric Learning for Kernel Regression
- 1 February 2018
- Published by Elsevier in Knowledge-Based Systems
- Vol. 142, 17-28
Distance metric learning for ordinal classification based on triplet constraints
- 1 February 2018
- Published by Elsevier in Knowledge-Based Systems
- Vol. 142, 17-28
Distance metric learning for ordinal classification based on triplet constraints