Maria D. Gonzalez-Lima
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
Maria D. Gonzalez-Lima has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Adolfo J. Quiroz
Universidad de los Andes
2 shared publications - Carenne C. Ludeña
Matrix CPM Solutions, Bogot, Colombia
2 shared publications Richard A. Tapia
2 shared publicationsRobert M. Thrall
2 shared publications- Anagh Mirji
Department of Psychology, Texas Consortium in Behavioral Neuroscience, The University of Texas at Austin, Austin, TX, USA
1 shared publication - Aurelio Ribeiro Leite Oliveira
Institute of Mathematics, Statistics and Scientific Computing (IMECC), University of Campinas (UNICAMP), Brazil, Brazil
1 shared publication
Latest Publications
- Open Access
- 27 February 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 484
A centered Newton method for nonlinear complementarity problem
- 27 February 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 484
Open AccessA centered Newton method for nonlinear complementarity problem
- Open Access
- 27 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Systems and Rehabilitation Engineering
- Vol. 33 (15344320) , 4349-4361
Machine Learning Prediction of the Cognitive Responses to Transcranial Prefrontal Photobiomodulation in Individuals With Bipolar Disorder Using Functional Near-Infrared Spectroscopy
People with bipolar disorder often experience impaired prefrontal cortex function and cognitive decline. While current treatments primarily focus on mood stabilization, they do not specifically target cognitive performance or brain oxygenation. Transcranial photobiomodulation (tPBM) using infrared laser at 1064 nm offers a promising, non-invasive approach to improve brain oxygenation and cognitive function in the prefrontal cortex. This study developed a predictive machine learning model using support vector machines to identify people with bipolar disorder who would respond well to tPBM treatment. The model utilized functional near-infrared spectroscopy (fNIRS) data (528 features) from the anterior prefrontal cortex, collected before tPBM treatment of 29 participants. To mitigate overfitting, we used ridge regularization, Leave-One-Subject-Out Cross-Validation, feature extractions using Fisher-scores, and different classification metrics. Key findings included: 1) Pre-treatment fNIRS data from 10-20 extracted features predicted cognitive response to tPBM with 85% or better accuracy and F1-score; and 2) Total hemoglobin concentration statistics and oxygenated hemoglobin correlations in ventrolateral prefrontal regions were crucial predictive features. These hemodynamic features could serve as potential biomarkers for tPBM intervention efficacy in people with bipolar disorder and possibly other psychiatric populations experiencing cognitive decline. The ability to predict tPBM treatment responses in advance may lead to more effective treatment strategies for individuals with bipolar disorder. Additionally, this research sheds light on the role of prefrontal cortical regions in the cognitive improvements observed after tPBM treatment.
- 27 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Systems and Rehabilitation Engineering
- Vol. 33 (15344320) , 4349-4361
Open AccessMachine Learning Prediction of the Cognitive Responses to Transcranial Prefrontal Photobiomodulation in Individuals With Bipolar Disorder Using Functional Near-Infrared Spectroscopy
People with bipolar disorder often experience impaired prefrontal cortex function and cognitive decline. While current treatments primarily focus on mood stabilization, they do not specifically target cognitive performance or brain oxygenation. Transcranial photobiomodulation (tPBM) using infrared laser at 1064 nm offers a promising, non-invasive approach to improve brain oxygenation and cognitive function in the prefrontal cortex. This study developed a predictive machine learning model using support vector machines to identify people with bipolar disorder who would respond well to tPBM treatment. The model utilized functional near-infrared spectroscopy (fNIRS) data (528 features) from the anterior prefrontal cortex, collected before tPBM treatment of 29 participants. To mitigate overfitting, we used ridge regularization, Leave-One-Subject-Out Cross-Validation, feature extractions using Fisher-scores, and different classification metrics. Key findings included: 1) Pre-treatment fNIRS data from 10-20 extracted features predicted cognitive response to tPBM with 85% or better accuracy and F1-score; and 2) Total hemoglobin concentration statistics and oxygenated hemoglobin correlations in ventrolateral prefrontal regions were crucial predictive features. These hemodynamic features could serve as potential biomarkers for tPBM intervention efficacy in people with bipolar disorder and possibly other psychiatric populations experiencing cognitive decline. The ability to predict tPBM treatment responses in advance may lead to more effective treatment strategies for individuals with bipolar disorder. Additionally, this research sheds light on the role of prefrontal cortical regions in the cognitive improvements observed after tPBM treatment.
- Open Access
- 12 August 2024
- Published by Springer Nature in Fixed Point Theory and Algorithms for Sciences and Engineering
- Vol. 2024 (1) , 1-19
A general algorithm for convex fair partitions of convex polygons
- 12 August 2024
- Published by Springer Nature in Fixed Point Theory and Algorithms for Sciences and Engineering
- Vol. 2024 (1) , 1-19
Open AccessA general algorithm for convex fair partitions of convex polygons
- Open Access
- 22 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 15791-15799
A Graph Classification Method Based on Support Vector Machines and Locality-Sensitive Hashing
Graphs classification is a relevant problem that arises in many disciplines. Using graphs directly instead of vectorization allows exploiting the intrinsic representations of the data. Support Vector Machines (SVM) is a supervised learning method based on the use of graph kernel functions used for this task. One of the problems of SVM, as the number of samples increases, is the cost of storing and solving the optimization problem related to SVM. In this work, we propose a method capable of finding a small representative subset of the whole graph data set such that an approximate solution of the SVM optimization problem can be obtained in a fraction of the time, and without significantly degrading the classification prediction error. The method is based on the use of Locality-Sensitive Hashing for projecting over the Hilbert spaces defined by appropriate graph kernels that measure similarity between the graphs. A description of the algorithm, as well as numerical results using two graph kernels (Simple Product and Random Walk) on simulated and real life data sets are presented. The numerical experiments compare the training times and the classification error between the SVM obtained with our smart sampling approach, and the SVM obtained over the complete data set or over a random sub-sample. The results offer evidence of the advantages of our proposal for solving large scale graph classification problems when using SVM.
- 22 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 15791-15799
Open AccessA Graph Classification Method Based on Support Vector Machines and Locality-Sensitive Hashing
Graphs classification is a relevant problem that arises in many disciplines. Using graphs directly instead of vectorization allows exploiting the intrinsic representations of the data. Support Vector Machines (SVM) is a supervised learning method based on the use of graph kernel functions used for this task. One of the problems of SVM, as the number of samples increases, is the cost of storing and solving the optimization problem related to SVM. In this work, we propose a method capable of finding a small representative subset of the whole graph data set such that an approximate solution of the SVM optimization problem can be obtained in a fraction of the time, and without significantly degrading the classification prediction error. The method is based on the use of Locality-Sensitive Hashing for projecting over the Hilbert spaces defined by appropriate graph kernels that measure similarity between the graphs. A description of the algorithm, as well as numerical results using two graph kernels (Simple Product and Random Walk) on simulated and real life data sets are presented. The numerical experiments compare the training times and the classification error between the SVM obtained with our smart sampling approach, and the SVM obtained over the complete data set or over a random sub-sample. The results offer evidence of the advantages of our proposal for solving large scale graph classification problems when using SVM.
- Open Access
- 28 August 2023
- Published by Springer Nature in Research Square
A general algorithm for convex fair partitions of convex polygons
A convex fair partition of a convex polygonal region is defined as a partition on which all regions are convex and have equal area and equal perimeter. In this paper we present an algorithm, based on a heuristic, that finds such a fair partition for any given convex polygon and any given number of regions. MSC Classification: 52A38 , 68U05
- 28 August 2023
- Published by Springer Nature in Research Square
Open AccessA general algorithm for convex fair partitions of convex polygons
A convex fair partition of a convex polygonal region is defined as a partition on which all regions are convex and have equal area and equal perimeter. In this paper we present an algorithm, based on a heuristic, that finds such a fair partition for any given convex polygon and any given number of regions. MSC Classification: 52A38 , 68U05
- Open Access
- 13 October 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (20) , 3776
On Subsampling Procedures for Support Vector Machines
Herein, theoretical results are presented to provide insights into the effectiveness of subsampling methods in reducing the amount of instances required in the training stage when applying support vector machines (SVMs) for classification in big data scenarios. Our main theorem states that under some conditions, there exists, with high probability, a feasible solution to the SVM problem for a randomly chosen training subsample, with the corresponding classifier as close as desired (in terms of classification error) to the classifier obtained from training with the complete dataset. The main theorem also reflects the curse of dimensionalityin that the assumptions made for the results are much more restrictive in large dimensions; thus, subsampling methods will perform better in lower dimensions. Additionally, we propose an importance sampling and bagging subsampling method that expands the nearest-neighbors ideas presented in previous work. Using different benchmark examples, the method proposed herein presents a faster solution to the SVM problem (without significant loss in accuracy) compared with the available state-of-the-art techniques.
- 13 October 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (20) , 3776
Open AccessOn Subsampling Procedures for Support Vector Machines
Herein, theoretical results are presented to provide insights into the effectiveness of subsampling methods in reducing the amount of instances required in the training stage when applying support vector machines (SVMs) for classification in big data scenarios. Our main theorem states that under some conditions, there exists, with high probability, a feasible solution to the SVM problem for a randomly chosen training subsample, with the corresponding classifier as close as desired (in terms of classification error) to the classifier obtained from training with the complete dataset. The main theorem also reflects the curse of dimensionalityin that the assumptions made for the results are much more restrictive in large dimensions; thus, subsampling methods will perform better in lower dimensions. Additionally, we propose an importance sampling and bagging subsampling method that expands the nearest-neighbors ideas presented in previous work. Using different benchmark examples, the method proposed herein presents a faster solution to the SVM problem (without significant loss in accuracy) compared with the available state-of-the-art techniques.
- Open Access
- 25 May 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (11) , 1812
Using Locality-Sensitive Hashing for SVM Classification of Large Data Sets
We propose a novel method using Locality-Sensitive Hashing (LSH) for solving the optimization problem that arises in the training stage of support vector machines for large data sets, possibly in high dimensions. LSH was introduced as an efficient way to look for neighbors in high dimensional spaces. Random projections-based LSH functions create bins so that when great probability points belonging to the same bin are close, the points that are far will not be in the same bin. Based on these bins, it is not necessary to consider the whole original set but representatives in each one of them, thus reducing the effective size of the data set. A key of our proposal is that we work with the feature space and use only the projections to search for closeness in this space. Moreover, instead of choosing the projection directions at random, we sample a small subset and solve the associated SVM problem. Projections in this direction allows for a more precise sample in many cases and an approximation of the solution of the large problem is found in a fraction of the running time with small degradation of the classification error. We present two algorithms, theoretical support, and numerical experiments showing their performances on real life problems taken from the LIBSVM data base.
- 25 May 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (11) , 1812
Open AccessUsing Locality-Sensitive Hashing for SVM Classification of Large Data Sets
We propose a novel method using Locality-Sensitive Hashing (LSH) for solving the optimization problem that arises in the training stage of support vector machines for large data sets, possibly in high dimensions. LSH was introduced as an efficient way to look for neighbors in high dimensional spaces. Random projections-based LSH functions create bins so that when great probability points belonging to the same bin are close, the points that are far will not be in the same bin. Based on these bins, it is not necessary to consider the whole original set but representatives in each one of them, thus reducing the effective size of the data set. A key of our proposal is that we work with the feature space and use only the projections to search for closeness in this space. Moreover, instead of choosing the projection directions at random, we sample a small subset and solve the associated SVM problem. Projections in this direction allows for a more precise sample in many cases and an approximation of the solution of the large problem is found in a fraction of the running time with small degradation of the classification error. We present two algorithms, theoretical support, and numerical experiments showing their performances on real life problems taken from the LIBSVM data base.
- 22 August 2015
- Published by Springer Nature in Annals of Operations Research
- Vol. 235 (1) , 85-101
Nearest neighbors methods for support vector machines
- 22 August 2015
- Published by Springer Nature in Annals of Operations Research
- Vol. 235 (1) , 85-101
Nearest neighbors methods for support vector machines
- 3 October 2013
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 56 (3) , 573-597
A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
- 3 October 2013
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 56 (3) , 573-597
A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
- 1 January 2011
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 21 (1) , 361-390
An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
An affine-scaling algorithm (ASL) for optimization problems with a single linear equality constraint and box restrictions is developed. The algorithm has the property that each iterate lies in the relative interior of the feasible set. The search direction is obtained by approximating the Hessian of the objective function in Newton's method by a multiple of the identity matrix. The algorithm is particularly well suited for optimization problems where the Hessian of the objective function is a large, dense, and possibly ill-conditioned matrix. Global convergence to a stationary point is established for a nonmonotone line search. When the objective function is strongly convex, ASL converges R-linearly to the global optimum provided the constraint multiplier is unique and a nondegeneracy condition holds. A specific implementation of the algorithm is developed in which the Hessian approximation is given by the cyclic Barzilai-Borwein (CBB) formula. The algorithm is evaluated numerically using support vector machine test problems.
- 1 January 2011
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 21 (1) , 361-390
An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
An affine-scaling algorithm (ASL) for optimization problems with a single linear equality constraint and box restrictions is developed. The algorithm has the property that each iterate lies in the relative interior of the feasible set. The search direction is obtained by approximating the Hessian of the objective function in Newton's method by a multiple of the identity matrix. The algorithm is particularly well suited for optimization problems where the Hessian of the objective function is a large, dense, and possibly ill-conditioned matrix. Global convergence to a stationary point is established for a nonmonotone line search. When the objective function is strongly convex, ASL converges R-linearly to the global optimum provided the constraint multiplier is unique and a nondegeneracy condition holds. A specific implementation of the algorithm is developed in which the Hessian approximation is given by the cyclic Barzilai-Borwein (CBB) formula. The algorithm is evaluated numerically using support vector machine test problems.