Jesús Soto
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
Jesús Soto has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Andrés Muñoz
University of Cadiz, Spain
5 shared publications - Andrés Bueno-Crespo
Universidad Católica de Murcia, Murcia, Spain
4 shared publications - Fernando Terroso-Saenz
Universidad Politécnica de Cartagena, Murcia, Spain
3 shared publications - Isabel Timón
Department of Sociosanitary Sciences, University of Murcia, 30120 Murcia, Spain
3 shared publications - José Maria Cecilia
Department of Computer Engineering (DISCA), Universitat Politécnica de Valencia (UPV), 46022 Valencia, Spain
3 shared publications - Raquel Martínez-España
Med AI Lab, University of Murcia, Murcia, Spain
3 shared publications
Latest Publications
- 12 March 2025
- Published by Universidad Internacional de La Rioja in International Journal of Interactive Multimedia and Artificial Intelligence
- Vol. 9 (6) , 28-37
PRESTO: A Recommender of Musical Collaborations Based on Heterogeneous Graph Neural Networks
The music industry is now more complex and competitive than ever before. In recent years, the search for collaborations with other artists has become a common strategy for musicians to maintain their presence in the sector. Besides, existing music streaming services such as Spotify have exposed large data feeds that can be used to develop innovative services within the realm of music. In this context, the present work introduces PRESTO, a novel recommendation system to suggest musicians for new collaborations with other artists by means of an ensemble of Graph Neural Networks. The system is fed with a heterogeneous graph representing the time evolution and the stationary aspects of a musician’s career. Finally, the proposal has been evaluated with a dataset comprising more than 200,000 artists, with an average F1 score above 0.75.
- 12 March 2025
- Published by Universidad Internacional de La Rioja in International Journal of Interactive Multimedia and Artificial Intelligence
- Vol. 9 (6) , 28-37
PRESTO: A Recommender of Musical Collaborations Based on Heterogeneous Graph Neural Networks
The music industry is now more complex and competitive than ever before. In recent years, the search for collaborations with other artists has become a common strategy for musicians to maintain their presence in the sector. Besides, existing music streaming services such as Spotify have exposed large data feeds that can be used to develop innovative services within the realm of music. In this context, the present work introduces PRESTO, a novel recommendation system to suggest musicians for new collaborations with other artists by means of an ensemble of Graph Neural Networks. The system is fed with a heterogeneous graph representing the time evolution and the stationary aspects of a musician’s career. Finally, the proposal has been evaluated with a dataset comprising more than 200,000 artists, with an average F1 score above 0.75.
- 1 December 2023
- Published by Springer Nature
- p. 185-209
SINATRA: A Music Genre Classifier Based on Clustering and Graph Analysis
- 1 December 2023
- Published by Springer Nature
- p. 185-209
SINATRA: A Music Genre Classifier Based on Clustering and Graph Analysis
- Open Access
- 21 July 2023
- Published by Springer Nature in Research Square
PRESTO: A Recommender of Musical Collaborations based on Heterogeneous Graph Neural Networks
The music industry is now more complex and competitive than ever before. In recent years, the search for collaborations with other artists has become a common strategy of musicians to maintain their presence in the sector. Besides, existing music streaming services such as Spotify have exposed large data feeds that can be used to develop innovative services within the realm of music. In this context, the present work introduces PRESTO, a novel recommendation system to suggest musicians new collaborations with other artists by means of an ensemble of Graph Neural Networks. The system is fed with an heterogeneous graph representing the time evolution and the stationary aspects of a musician's career. Finally, the proposal has been evaluated with a dataset comprising more than 200,000 artists, with an average F1 score above 0.75.
- 21 July 2023
- Published by Springer Nature in Research Square
Open AccessPRESTO: A Recommender of Musical Collaborations based on Heterogeneous Graph Neural Networks
The music industry is now more complex and competitive than ever before. In recent years, the search for collaborations with other artists has become a common strategy of musicians to maintain their presence in the sector. Besides, existing music streaming services such as Spotify have exposed large data feeds that can be used to develop innovative services within the realm of music. In this context, the present work introduces PRESTO, a novel recommendation system to suggest musicians new collaborations with other artists by means of an ensemble of Graph Neural Networks. The system is fed with an heterogeneous graph representing the time evolution and the stationary aspects of a musician's career. Finally, the proposal has been evaluated with a dataset comprising more than 200,000 artists, with an average F1 score above 0.75.
- Open Access
- 4 September 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (17) , 2156
Evaluation of Clustering Algorithms on HPC Platforms
Clustering algorithms are one of the most widely used kernels to generate knowledge from large datasets. These algorithms group a set of data elements (i.e., images, points, patterns, etc.) into clusters to identify patterns or common features of a sample. However, these algorithms are very computationally expensive as they often involve the computation of expensive fitness functions that must be evaluated for all points in the dataset. This computational cost is even higher for fuzzy methods, where each data point may belong to more than one cluster. In this paper, we evaluate different parallelisation strategies on different heterogeneous platforms for fuzzy clustering algorithms typically used in the state-of-the-art such as the Fuzzy C-means (FCM), the Gustafson–Kessel FCM (GK-FCM) and the Fuzzy Minimals (FM). The experimental evaluation includes performance and energy trade-offs. Our results show that depending on the computational pattern of each algorithm, their mathematical foundation and the amount of data to be processed, each algorithm performs better on a different platform.
- 4 September 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (17) , 2156
Open AccessEvaluation of Clustering Algorithms on HPC Platforms
Clustering algorithms are one of the most widely used kernels to generate knowledge from large datasets. These algorithms group a set of data elements (i.e., images, points, patterns, etc.) into clusters to identify patterns or common features of a sample. However, these algorithms are very computationally expensive as they often involve the computation of expensive fitness functions that must be evaluated for all points in the dataset. This computational cost is even higher for fuzzy methods, where each data point may belong to more than one cluster. In this paper, we evaluate different parallelisation strategies on different heterogeneous platforms for fuzzy clustering algorithms typically used in the state-of-the-art such as the Fuzzy C-means (FCM), the Gustafson–Kessel FCM (GK-FCM) and the Fuzzy Minimals (FM). The experimental evaluation includes performance and energy trade-offs. Our results show that depending on the computational pattern of each algorithm, their mathematical foundation and the amount of data to be processed, each algorithm performs better on a different platform.
- 1 January 2019
- Published by Elsevier in Biosystems Engineering
- Vol. 177, 101-108
Developing an intelligent system for the prediction of soil properties with a portable mid-infrared instrument
- 1 January 2019
- Published by Elsevier in Biosystems Engineering
- Vol. 177, 101-108
Developing an intelligent system for the prediction of soil properties with a portable mid-infrared instrument
- 21 June 2018
- Published by SAGE Publications in Journal of Ambient Intelligence and Smart Environments
- Vol. 10 (3) , 289-300
An unsupervised technique to discretize numerical values by fuzzy partitions
The numerical value discretization is a process that is performed in the data preprocessing phase of intelligent data analysis. Preprocessing phase is very relevant because the quality of the models obtained in data mining step depends on this phase.
- 21 June 2018
- Published by SAGE Publications in Journal of Ambient Intelligence and Smart Environments
- Vol. 10 (3) , 289-300
An unsupervised technique to discretize numerical values by fuzzy partitions
The numerical value discretization is a process that is performed in the data preprocessing phase of intelligent data analysis. Preprocessing phase is very relevant because the quality of the models obtained in data mining step depends on this phase.
- 9 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 19 (7) , 2246-2257
High-Throughput Infrastructure for Advanced ITS Services: A Case Study on Air Pollution Monitoring
Novel cooperative intelligent transportation systems (ITS) serve as the basis for the provision of a number of services for drivers, occupants, and third parties. The vast amount of information to be collected, especially in vehicle-to-infrastructure (V2I) communication services, requires new algorithms and hardware platforms to cope with real-time requirements; however, this combination is not properly addressed in the literature. In this paper, we introduce a high-throughput hardware-software infrastructure to gather information from vehicles and efficiently process it to provide novel ITS services. We propose a parallelization approach of a fuzzy clustering technique on heterogeneous servers based on CPU and several GPUs, tailored to classification problems in V2I. The infrastructure is empirically tested to offer a geo-located pollution information service through the periodical collection of both vehicle's position and status data. We offer a real service that correctly identifies highly polluting traffic areas and drivers. The results indicate a good performance of the system under high loads, and our scalability analysis reveals a good operation in real-ambitious deployments thanks to the use of the both CPU and multiple GPUs, showing that our proposal can efficiently host cooperative services involving high processing in the ITS context.
- 9 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 19 (7) , 2246-2257
High-Throughput Infrastructure for Advanced ITS Services: A Case Study on Air Pollution Monitoring
Novel cooperative intelligent transportation systems (ITS) serve as the basis for the provision of a number of services for drivers, occupants, and third parties. The vast amount of information to be collected, especially in vehicle-to-infrastructure (V2I) communication services, requires new algorithms and hardware platforms to cope with real-time requirements; however, this combination is not properly addressed in the literature. In this paper, we introduce a high-throughput hardware-software infrastructure to gather information from vehicles and efficiently process it to provide novel ITS services. We propose a parallelization approach of a fuzzy clustering technique on heterogeneous servers based on CPU and several GPUs, tailored to classification problems in V2I. The infrastructure is empirically tested to offer a geo-located pollution information service through the periodical collection of both vehicle's position and status data. We offer a real service that correctly identifies highly polluting traffic areas and drivers. The results indicate a good performance of the system under high loads, and our scalability analysis reveals a good operation in real-ambitious deployments thanks to the use of the both CPU and multiple GPUs, showing that our proposal can efficiently host cooperative services involving high processing in the ITS context.
- Open Access
- 7 November 2017
- Published by Walter de Gruyter GmbH in Journal of Hydrology and Hydromechanics
- Vol. 65 (4) , 359-365
A novel fuzzy clustering approach to regionalise watersheds with an automatic determination of optimal number of clusters
One of the most important problems faced in hydrology is the estimation of flood magnitudes and frequencies in ungauged basins. Hydrological regionalisation is used to transfer information from gauged watersheds to ungauged watersheds. However, to obtain reliable results, the watersheds involved must have a similar hydrological behaviour. In this study, two different clustering approaches are used and compared to identify the hydrologically homogeneous regions. Fuzzy C-Means algorithm (FCM), which is widely used for regionalisation studies, needs the calculation of cluster validity indices in order to determine the optimal number of clusters. Fuzzy Minimals algorithm (FM), which presents an advantage compared with others fuzzy clustering algorithms, does not need to know a priori the number of clusters, so cluster validity indices are not used. Regional homogeneity test based on L-moments approach is used to check homogeneity of regions identified by both cluster analysis approaches. The validation of the FM algorithm in deriving homogeneous regions for flood frequency analysis is illustrated through its application to data from the watersheds in Alto Genil (South Spain). According to the results, FM algorithm is recommended for identifying the hydrologically homogeneous regions for regional frequency analysis.
- 7 November 2017
- Published by Walter de Gruyter GmbH in Journal of Hydrology and Hydromechanics
- Vol. 65 (4) , 359-365
Open AccessA novel fuzzy clustering approach to regionalise watersheds with an automatic determination of optimal number of clusters
One of the most important problems faced in hydrology is the estimation of flood magnitudes and frequencies in ungauged basins. Hydrological regionalisation is used to transfer information from gauged watersheds to ungauged watersheds. However, to obtain reliable results, the watersheds involved must have a similar hydrological behaviour. In this study, two different clustering approaches are used and compared to identify the hydrologically homogeneous regions. Fuzzy C-Means algorithm (FCM), which is widely used for regionalisation studies, needs the calculation of cluster validity indices in order to determine the optimal number of clusters. Fuzzy Minimals algorithm (FM), which presents an advantage compared with others fuzzy clustering algorithms, does not need to know a priori the number of clusters, so cluster validity indices are not used. Regional homogeneity test based on L-moments approach is used to check homogeneity of regions identified by both cluster analysis approaches. The validation of the FM algorithm in deriving homogeneous regions for flood frequency analysis is illustrated through its application to data from the watersheds in Alto Genil (South Spain). According to the results, FM algorithm is recommended for identifying the hydrologically homogeneous regions for regional frequency analysis.
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 70, 172-175
Discretizing Numerical Values by a Fuzzy Clustering Technique
The numerical value discretization is an important task of the data preprocessing phase within the intelligent data analysis. This process allows us to reduce the number of values (among other advantages) with which techniques work, reducing the computational cost when it comes to working with large amounts of data. In this paper a numerical value discretization technique is proposed. Specifically, we discretize numerical values using a type of Cauchy distribution obtained from fuzzy clustering technique, being this technique a modification of the well-known Fuzzy C-Means clustering technique. Finally, to test the quality of the membership function we use a neural network technique over several datasets. The results obtained are compared and validated by means of statistical tests, obtaining satisfactory results.
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 70, 172-175
Discretizing Numerical Values by a Fuzzy Clustering Technique
The numerical value discretization is an important task of the data preprocessing phase within the intelligent data analysis. This process allows us to reduce the number of values (among other advantages) with which techniques work, reducing the computational cost when it comes to working with large amounts of data. In this paper a numerical value discretization technique is proposed. Specifically, we discretize numerical values using a type of Cauchy distribution obtained from fuzzy clustering technique, being this technique a modification of the well-known Fuzzy C-Means clustering technique. Finally, to test the quality of the membership function we use a neural network technique over several datasets. The results obtained are compared and validated by means of statistical tests, obtaining satisfactory results.
- 1 July 2017
- Published by Elsevier in Chemometrics and Intelligent Laboratory Systems
- Vol. 166, 1-6
Fuzzy clustering as rational partition method for QSAR
- 1 July 2017
- Published by Elsevier in Chemometrics and Intelligent Laboratory Systems
- Vol. 166, 1-6
Fuzzy clustering as rational partition method for QSAR