Jose Miguel Leiva-Murillo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jose Miguel Leiva-Murillo has a total of 64 co-authors. Here are the top co-authors by number of shared publications:
- Antonio Artés-Rodríguez
Signal Theory and Communications Department, Universidad Carlos III de Madrid, Leganés, Spain
10 shared publications - Enrique Baca-García
Instituto de Investigación Sanitaria de la Fundación Jiménez Díaz, Avenida de los Reyes Católicos 2, 28040 Madrid, Spain
5 shared publications - Maria Mercedes Perez-Rodriguez
Department of Psychiatry, Icahn School of Medicine at Mount Sinai, New York, NY, USA
4 shared publications - Ricardo Santiago-Mozos
Department of Signal Theory and Communications, University Rey Juan Carlos Fuenlabrada, Spain
4 shared publications - Jorge Lopez-Castroman
Department of Psychiatry, Radiology, Public Health, Nursing and Medicine; University of Santiago de Compostela, A Coruña, Spain
3 shared publications - Jose de Leon
Mental Health Research Center, Eastern State Hospital, Lexington, KY
3 shared publications
Latest Publications
- Open Access
- 20 June 2013
- Published by Wiley in Computational and Mathematical Methods in Medicine
- Vol. 2013, 1-9
Characterization of Suicidal Behaviour with Self-Organizing Maps
The study of the variables involved in suicidal behavior is important from a social, medical, and economical point of view. Given the high number of potential variables of interest, a large population of subjects must be analysed in order to get conclusive results. In this paper, we describe a method based on self-organizing maps (SOMs) for finding the most relevant variables even when their relation to suicidal behavior is strongly nonlinear. We have applied the method to a cohort with more than 8,000 subjects and 600 variables and discovered four groups of variables involved in suicidal behavior. According to the results, there are four main groups of risk factors that characterize the population of suicide attempters: mental disorders, alcoholism, impulsivity, and childhood abuse. The identification of specific subpopulations of suicide attempters is consistent with current medical knowledge and may provide a new avenue of research to improve the management of suicidal cases.
- 20 June 2013
- Published by Wiley in Computational and Mathematical Methods in Medicine
- Vol. 2013, 1-9
Open AccessCharacterization of Suicidal Behaviour with Self-Organizing Maps
The study of the variables involved in suicidal behavior is important from a social, medical, and economical point of view. Given the high number of potential variables of interest, a large population of subjects must be analysed in order to get conclusive results. In this paper, we describe a method based on self-organizing maps (SOMs) for finding the most relevant variables even when their relation to suicidal behavior is strongly nonlinear. We have applied the method to a cohort with more than 8,000 subjects and 600 variables and discovered four groups of variables involved in suicidal behavior. According to the results, there are four main groups of risk factors that characterize the population of suicide attempters: mental disorders, alcoholism, impulsivity, and childhood abuse. The identification of specific subpopulations of suicide attempters is consistent with current medical knowledge and may provide a new avenue of research to improve the management of suicidal cases.
- 1 October 2012
- Published by Elsevier in Pattern Recognition Letters
- Vol. 33 (13) , 1717-1724
Algorithms for maximum-likelihood bandwidth selection in kernel density estimators
- 1 October 2012
- Published by Elsevier in Pattern Recognition Letters
- Vol. 33 (13) , 1717-1724
Algorithms for maximum-likelihood bandwidth selection in kernel density estimators
- 8 June 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 51 (1) , 151-161
Multitask Remote Sensing Data Classification
Many remote sensing data processing problems are inherently constituted by several tasks that can be solved either individually or jointly. For instance, each image in a multitemporal classification setting could be taken as an individual task. Here, the relation to previous acquisitions should be properly considered because of the nonstationary behavior of temporal, spatial, and angular image features which gives rise to distribution changes. This phenomenon is known as covariate shift. Additionally, when labeled data are scarce or expensive to obtain, the small sample-set problem arises, which makes solving the problems independently in each domain difficult. Multitask learning (MTL) aims at jointly solving a set of prediction problems by sharing information across tasks. This paper introduces MTL in remote sensing data classification. The proposed methods alleviate the data set shift by imposing cross-information in the classifiers through matrix regularization. We consider the support vector machine (SVM) as the core learner and two different regularization schemes: 1) the inclusion of relational operators between tasks and 2) the pairwise Euclidean distance of the predictors in the Hilbert space. These methods rely on simple and intuitive modifications of the kernel used in the standard SVM. Experiments are conducted in three challenging remote sensing problems: cloud screening from multispectral images, land-mine detection using radar data, and multitemporal and multisource image classification. The pairwise method consistently outperforms standard independent and aggregate approaches by about +2% to 4% in all problems at no additional cost. Also, the solutions found give us information about the distribution shift among tasks.
- 8 June 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 51 (1) , 151-161
Multitask Remote Sensing Data Classification
Many remote sensing data processing problems are inherently constituted by several tasks that can be solved either individually or jointly. For instance, each image in a multitemporal classification setting could be taken as an individual task. Here, the relation to previous acquisitions should be properly considered because of the nonstationary behavior of temporal, spatial, and angular image features which gives rise to distribution changes. This phenomenon is known as covariate shift. Additionally, when labeled data are scarce or expensive to obtain, the small sample-set problem arises, which makes solving the problems independently in each domain difficult. Multitask learning (MTL) aims at jointly solving a set of prediction problems by sharing information across tasks. This paper introduces MTL in remote sensing data classification. The proposed methods alleviate the data set shift by imposing cross-information in the classifiers through matrix regularization. We consider the support vector machine (SVM) as the core learner and two different regularization schemes: 1) the inclusion of relational operators between tasks and 2) the pairwise Euclidean distance of the predictors in the Hilbert space. These methods rely on simple and intuitive modifications of the kernel used in the standard SVM. Experiments are conducted in three challenging remote sensing problems: cloud screening from multispectral images, land-mine detection using radar data, and multitemporal and multisource image classification. The pairwise method consistently outperforms standard independent and aggregate approaches by about +2% to 4% in all problems at no additional cost. Also, the solutions found give us information about the distribution shift among tasks.
- 15 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 6 (4) , 388-398
Evaluating the Internationalization Success of Companies Through a Hybrid Grouping Harmony Search—Extreme Learning Machine Approach
The internationalization of a company is widely understood as the corporative strategy for growing through external markets. It usually embodies a hard process, which affects diverse activities of the value chain and impacts on the organizational structure of the company. There is not a general model for a successful international company, so the success of an internationalization procedure must be estimated based on different variables addressing the status, strategy and market characteristics of the company at hand. This paper presents a novel hybrid soft-computing approach for evaluating the internationalization success of a company based on existing past data. Specifically, we propose a hybrid algorithm composed by a grouping-based harmony search (HS) approach and an extreme learning machine (ELM) ensemble. The proposed hybrid scheme further incorporates a feature selection method, which is obtained by means of a given group in the HS encoding format, whereas the ELM ensemble renders the final accuracy metric of the model. Practical results for the proposed hybrid technique are obtained in a real application based on the exporting success of Spanish manufacturing companies, which are shown to be satisfactory in comparison with alternative state-of-the-art techniques.
- 15 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 6 (4) , 388-398
Evaluating the Internationalization Success of Companies Through a Hybrid Grouping Harmony Search—Extreme Learning Machine Approach
The internationalization of a company is widely understood as the corporative strategy for growing through external markets. It usually embodies a hard process, which affects diverse activities of the value chain and impacts on the organizational structure of the company. There is not a general model for a successful international company, so the success of an internationalization procedure must be estimated based on different variables addressing the status, strategy and market characteristics of the company at hand. This paper presents a novel hybrid soft-computing approach for evaluating the internationalization success of a company based on existing past data. Specifically, we propose a hybrid algorithm composed by a grouping-based harmony search (HS) approach and an extreme learning machine (ELM) ensemble. The proposed hybrid scheme further incorporates a feature selection method, which is obtained by means of a given group in the HS encoding format, whereas the ELM ensemble renders the final accuracy metric of the model. Practical results for the proposed hybrid technique are obtained in a real application based on the exporting success of Spanish manufacturing companies, which are shown to be satisfactory in comparison with alternative state-of-the-art techniques.
- 17 April 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
- Vol. 42 (6) , 1180-1189
Information-Theoretic Linear Feature Extraction Based on Kernel Density Estimators: A Review
In this paper, we provide a unified study of the application of kernel density estimators to supervised linear feature extraction by means of criteria inspired by information and detection theory. We enrich this study by the incorporation of two novel criteria to the study, i.e., the mutual information and the likelihood ratio test, and perform both a theoretical and an experimental comparison between the new methods and other ones previously described in the literature. The impact of the bandwidth selection of the density estimator in the classification performance is discussed. Some theoretical results that bound classification performance as a function or mutual information are also compiled. A set of experiments on different real-world datasets allows us to perform an empirical comparison of the methods, in terms of both accuracy and computational complexity. We show the suitability of these methods to determine the dimension of the subspace that contains the discriminative information.
- 17 April 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
- Vol. 42 (6) , 1180-1189
Information-Theoretic Linear Feature Extraction Based on Kernel Density Estimators: A Review
In this paper, we provide a unified study of the application of kernel density estimators to supervised linear feature extraction by means of criteria inspired by information and detection theory. We enrich this study by the incorporation of two novel criteria to the study, i.e., the mutual information and the likelihood ratio test, and perform both a theoretical and an experimental comparison between the new methods and other ones previously described in the literature. The impact of the bandwidth selection of the density estimator in the classification performance is discussed. Some theoretical results that bound classification performance as a function or mutual information are also compiled. A set of experiments on different real-world datasets allows us to perform an empirical comparison of the methods, in terms of both accuracy and computational complexity. We show the suitability of these methods to determine the dimension of the subspace that contains the discriminative information.
- 1 May 2011
- Published by Elsevier in Journal of Psychiatric Research
- Vol. 45 (5) , 619-625
Distinguishing the relevant features of frequent suicide attempters
- 1 May 2011
- Published by Elsevier in Journal of Psychiatric Research
- Vol. 45 (5) , 619-625
Distinguishing the relevant features of frequent suicide attempters
- 7 October 2010
- Published by SPIE-Intl Soc Optical Eng
- p. 78300L-78300L-8
Multitask SVM learning for remote sensing data classification
Many remote sensing data processing problems are inherently constituted by several tasks that can be solved either individually or jointly. For instance, each image in a multitemporal classification setting could be taken as an individual task but relation to previous acquisitions should be properly considered. In such problems, different modalities of the data (temporal, spatial, angular) gives rise to changes between the training and test distributions, which constitutes a difficult learning problem known as covariate shift. Multitask learning methods aim at jointly solving a set of prediction problems in an efficient way by sharing information across tasks. This paper presents a novel kernel method for multitask learning in remote sensing data classification. The proposed method alleviates the dataset shift problem by imposing cross-information in the classifiers through matrix regularization. We consider the support vector machine (SVM) as core learner and two regularization schemes are introduced: 1) the Euclidean distance of the predictors in the Hilbert space; and 2) the inclusion of relational operators between tasks. Experiments are conducted in the challenging remote sensing problems of cloud screening from multispectral MERIS images and for landmine detection.
- 7 October 2010
- Published by SPIE-Intl Soc Optical Eng
- p. 78300L-78300L-8
Multitask SVM learning for remote sensing data classification
Many remote sensing data processing problems are inherently constituted by several tasks that can be solved either individually or jointly. For instance, each image in a multitemporal classification setting could be taken as an individual task but relation to previous acquisitions should be properly considered. In such problems, different modalities of the data (temporal, spatial, angular) gives rise to changes between the training and test distributions, which constitutes a difficult learning problem known as covariate shift. Multitask learning methods aim at jointly solving a set of prediction problems in an efficient way by sharing information across tasks. This paper presents a novel kernel method for multitask learning in remote sensing data classification. The proposed method alleviates the dataset shift problem by imposing cross-information in the classifiers through matrix regularization. We consider the support vector machine (SVM) as core learner and two regularization schemes are introduced: 1) the Euclidean distance of the predictors in the Hilbert space; and 2) the inclusion of relational operators between tasks. Experiments are conducted in the challenging remote sensing problems of cloud screening from multispectral MERIS images and for landmine detection.
- 21 December 2009
- Published by Wiley in American Journal of Medical Genetics Part B: Neuropsychiatric Genetics
- Vol. 153B (1) , 208-213
Nucleotide variation in central nervous system genes among male suicide attempters
Despite marked morbidity and mortality associated with suicidal behavior, accurate identification of individuals at risk remains elusive. The goal of this study is to identify a model based on single nucleotide polymorphisms (SNPs) that discriminates between suicide attempters and non‐attempters using data mining strategies. We examined functional SNPs (n = 840) of 312 brain function and development genes using data mining techniques. Two hundred seventy‐seven male psychiatric patients aged 18 years or older were recruited at a University hospital psychiatric emergency room or psychiatric short stay unit. The main outcome measure was history of suicide attempts. Three SNPs of three genes (rs10944288, HTR1E; hCV8953491, GABRP; and rs707216, ACTN2) correctly classified 67% of male suicide attempters and non‐attempters (0.50 sensitivity, 0.82 specificity, positive likelihood ratio = 2.80, negative likelihood ratio = 1.64). The OR for the combined three SNPs was 4.60 (95% CI: 1.31–16.10). The model's accuracy suggests that in the future similar methodologies may generate simple genetic tests with diagnostic utility in identification of suicide attempters. This strategy may uncover new pathophysiological pathways regarding the neurobiology of suicidal acts.
- 21 December 2009
- Published by Wiley in American Journal of Medical Genetics Part B: Neuropsychiatric Genetics
- Vol. 153B (1) , 208-213
Nucleotide variation in central nervous system genes among male suicide attempters
Despite marked morbidity and mortality associated with suicidal behavior, accurate identification of individuals at risk remains elusive. The goal of this study is to identify a model based on single nucleotide polymorphisms (SNPs) that discriminates between suicide attempters and non‐attempters using data mining strategies. We examined functional SNPs (n = 840) of 312 brain function and development genes using data mining techniques. Two hundred seventy‐seven male psychiatric patients aged 18 years or older were recruited at a University hospital psychiatric emergency room or psychiatric short stay unit. The main outcome measure was history of suicide attempts. Three SNPs of three genes (rs10944288, HTR1E; hCV8953491, GABRP; and rs707216, ACTN2) correctly classified 67% of male suicide attempters and non‐attempters (0.50 sensitivity, 0.82 specificity, positive likelihood ratio = 2.80, negative likelihood ratio = 1.64). The OR for the combined three SNPs was 4.60 (95% CI: 1.31–16.10). The model's accuracy suggests that in the future similar methodologies may generate simple genetic tests with diagnostic utility in identification of suicide attempters. This strategy may uncover new pathophysiological pathways regarding the neurobiology of suicidal acts.
- 30 June 2008
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 21 (4) , 499-508
A simulated annealing approach to speaker segmentation in audio databases
- 30 June 2008
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 21 (4) , 499-508
A simulated annealing approach to speaker segmentation in audio databases
- 1 October 2007
- Published by Elsevier in Computers & Graphics
- Vol. 31 (5) , 750-760
Automated generation and visualization of picture-logic puzzles
- 1 October 2007
- Published by Elsevier in Computers & Graphics
- Vol. 31 (5) , 750-760
Automated generation and visualization of picture-logic puzzles