Juan F. Huete
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Juan F. Huete has a total of 73 co-authors. Here are the top co-authors by number of shared publications:
- Juan Manuel Fernández Luna
Department of Computer Science and Artificial Intelligence, University of Granada
83 shared publications - Luis Miguel de Campos
Universidad de Granada
72 shared publications - Alfonso E. Romero
Department of Computer Science, Centre for Systems and Synthetic Biology, Royal Holloway, University of London, Egham, UK
7 shared publications Juan M. Fernández-Luna
Departamento de Ciencias de la Computación e Inteligencia Artificial E.T.S.I .I.T CITIC-UGR Universidad de Granada 18071- Granada Spain
6 shared publicationsSergio Cleger-Tamayo
Universidad de Holguín
6 shared publicationsCarlos Martín-Dancausa
Departamento de Ciencias de la Computación e Inteligencia Artificial, E.T.S.I. Informática y de Telecomunicación, Universidad de Granada, 18071 Granada, Spain
5 shared publications
Latest Publications
- 29 April 2026
- Published by Oxford University Press (OUP) in Digital Scholarship in the Humanities
- Vol. 41 (3) , 1301-1316
Determining whole–part relationships when cataloging nineteenth-century monographs
This article explores the process of determining whole–part relationships in cataloging digital libraries. In contemporary library practices, accurately determining how an entity or work relates to others in the collection is considered an essential task for effective information organization and retrieval. The “Biblioteca Nacional de España” (Spanish National Library) has made significant efforts to achieve this objective, but the results are far from optimal due to the extensive human efforts required. We present a methodology capable of automatically identifying whole–part relationships and propose an online navigation tool for analyzing the structure of authors’ works by users and researchers. To facilitate easy adoption and widespread use, our methodology directly utilizes text extracted by Optical Character Recognition (OCR) technologies, eliminating the need for further preprocessing. Additionally, we introduce and provide access to Spanish19BNE, a dataset containing approximately 12,000 books in Spanish written by 559 different authors, with their original manifestations held in the Biblioteca Nacional de España collection. This dataset can be used for digital library research and computational analysis. Experimental results on this dataset demonstrate the viability of the proposed approach.
- 29 April 2026
- Published by Oxford University Press (OUP) in Digital Scholarship in the Humanities
- Vol. 41 (3) , 1301-1316
Determining whole–part relationships when cataloging nineteenth-century monographs
This article explores the process of determining whole–part relationships in cataloging digital libraries. In contemporary library practices, accurately determining how an entity or work relates to others in the collection is considered an essential task for effective information organization and retrieval. The “Biblioteca Nacional de España” (Spanish National Library) has made significant efforts to achieve this objective, but the results are far from optimal due to the extensive human efforts required. We present a methodology capable of automatically identifying whole–part relationships and propose an online navigation tool for analyzing the structure of authors’ works by users and researchers. To facilitate easy adoption and widespread use, our methodology directly utilizes text extracted by Optical Character Recognition (OCR) technologies, eliminating the need for further preprocessing. Additionally, we introduce and provide access to Spanish19BNE, a dataset containing approximately 12,000 books in Spanish written by 559 different authors, with their original manifestations held in the Biblioteca Nacional de España collection. This dataset can be used for digital library research and computational analysis. Experimental results on this dataset demonstrate the viability of the proposed approach.
- Open Access
- 6 June 2024
- Published by Springer Nature in User Modeling and User-Adapted Interaction
- Vol. 34 (4) , 1431-1465
An explainable content-based approach for recommender systems: a case study in journal recommendation for paper submission
Explainable artificial intelligence is becoming increasingly important in new artificial intelligence developments since it enables users to understand and consequently trust system output. In the field of recommender systems, explanation is necessary not only for such understanding and trust but also because if users understand why the system is making certain suggestions, they are more likely to consume the recommended product. This paper proposes a novel approach for explaining content-based recommender systems by specifically focusing on publication venue recommendation. In this problem, the authors of a new research paper receive recommendations about possible journals (or other publication venues) to which they could submit their article based on content similarity, while the recommender system simultaneously explains its decisions. The proposed explanation ecosystem is based on various elements that support the explanation (topics, related articles, relevant terms, etc.) and is fully integrated with the underlying recommendation model. The proposed method is evaluated through a user study in the biomedical field, where transparency, satisfaction, trust, and scrutability are assessed. The obtained results suggest that the proposed approach is effective and useful for explaining the output of the recommender system to users.
- 6 June 2024
- Published by Springer Nature in User Modeling and User-Adapted Interaction
- Vol. 34 (4) , 1431-1465
Open AccessAn explainable content-based approach for recommender systems: a case study in journal recommendation for paper submission
Explainable artificial intelligence is becoming increasingly important in new artificial intelligence developments since it enables users to understand and consequently trust system output. In the field of recommender systems, explanation is necessary not only for such understanding and trust but also because if users understand why the system is making certain suggestions, they are more likely to consume the recommended product. This paper proposes a novel approach for explaining content-based recommender systems by specifically focusing on publication venue recommendation. In this problem, the authors of a new research paper receive recommendations about possible journals (or other publication venues) to which they could submit their article based on content similarity, while the recommender system simultaneously explains its decisions. The proposed explanation ecosystem is based on various elements that support the explanation (topics, related articles, relevant terms, etc.) and is fully integrated with the underlying recommendation model. The proposed method is evaluated through a user study in the biomedical field, where transparency, satisfaction, trust, and scrutability are assessed. The obtained results suggest that the proposed approach is effective and useful for explaining the output of the recommender system to users.
- Open Access
Predicting IR Personalization Performance using Pre-retrieval Query Predictors
Personalization generally improves the performance of queries but in a few cases it may also harms it. If we are able to predict and therefore to disable personalization for those situations, the overall performance will be higher and users will be more satisfied with personalized systems. We use some state-of-the-art pre-retrieval query performance predictors and propose some others including the user profile information for the previous purpose. We study the correlations among these predictors and the difference between the personalized and the original queries. We also use classification and regression techniques to improve the results and finally reach a bit more than one third of the maximum ideal performance. We think this is a good starting point within this research line, which certainly needs more effort and improvements.
Open AccessPredicting IR Personalization Performance using Pre-retrieval Query Predictors
Personalization generally improves the performance of queries but in a few cases it may also harms it. If we are able to predict and therefore to disable personalization for those situations, the overall performance will be higher and users will be more satisfied with personalized systems. We use some state-of-the-art pre-retrieval query performance predictors and propose some others including the user profile information for the previous purpose. We study the correlations among these predictors and the difference between the personalized and the original queries. We also use classification and regression techniques to improve the results and finally reach a bit more than one third of the maximum ideal performance. We think this is a good starting point within this research line, which certainly needs more effort and improvements.
- Open Access
- 23 January 2024
- Published by MDPI AG in Algorithms
- Vol. 17 (2) , 51
Information Retrieval and Machine Learning Methods for Academic Expert Finding
In the context of academic expert finding, this paper investigates and compares the performance of information retrieval (IR) and machine learning (ML) methods, including deep learning, to approach the problem of identifying academic figures who are experts in different domains when a potential user requests their expertise. IR-based methods construct multifaceted textual profiles for each expert by clustering information from their scientific publications. Several methods fully tailored for this problem are presented in this paper. In contrast, ML-based methods treat expert finding as a classification task, training automatic text classifiers using publications authored by experts. By comparing these approaches, we contribute to a deeper understanding of academic-expert-finding techniques and their applicability in knowledge discovery. These methods are tested with two large datasets from the biomedical field: PMSC-UGR and CORD-19. The results show how IR techniques were, in general, more robust with both datasets and more suitable than the ML-based ones, with some exceptions showing good performance.
- 23 January 2024
- Published by MDPI AG in Algorithms
- Vol. 17 (2) , 51
Open AccessInformation Retrieval and Machine Learning Methods for Academic Expert Finding
In the context of academic expert finding, this paper investigates and compares the performance of information retrieval (IR) and machine learning (ML) methods, including deep learning, to approach the problem of identifying academic figures who are experts in different domains when a potential user requests their expertise. IR-based methods construct multifaceted textual profiles for each expert by clustering information from their scientific publications. Several methods fully tailored for this problem are presented in this paper. In contrast, ML-based methods treat expert finding as a classification task, training automatic text classifiers using publications authored by experts. By comparing these approaches, we contribute to a deeper understanding of academic-expert-finding techniques and their applicability in knowledge discovery. These methods are tested with two large datasets from the biomedical field: PMSC-UGR and CORD-19. The results show how IR techniques were, in general, more robust with both datasets and more suitable than the ML-based ones, with some exceptions showing good performance.
- Open Access
On the selection of the correct number of terms for profile construction: theoretical and empirical analysis
In this paper, we examine the problem of building a user profile from a set of documents. This profile will consist of a subset of the most representative terms in the documents that best represent user preferences or interests. Inspired by the discrete concentration theory we have conducted an axiomatic study of seven properties that a selection function should fulfill: the minimum and maximum uncertainty principle, invariant to adding zeros, invariant to scale transformations, principle of nominal increase, transfer principle and the richest get richer inequality. We also present a novel selection function based on the use of similarity metrics, and more specifically the cosine measure which is commonly used in information retrieval, and demonstrate that this verifies six of the properties in addition to a weaker variant of the transfer principle, thereby representing a good selection approach. The theoretical study was complemented with an empirical study to compare the performance of different selection criteria (weight- and unweight-based) using real data in a parliamentary setting. In this study, we analyze the performance of the different functions focusing on the two main factors affecting the selection process: profile size (number of terms) and weight distribution. These profiles are then used in a document filtering task to show that our similarity-based approach performs well in terms not only of recommendation accuracy but also efficiency (we obtain smaller profiles and consequently faster recommendations).
Open AccessOn the selection of the correct number of terms for profile construction: theoretical and empirical analysis
In this paper, we examine the problem of building a user profile from a set of documents. This profile will consist of a subset of the most representative terms in the documents that best represent user preferences or interests. Inspired by the discrete concentration theory we have conducted an axiomatic study of seven properties that a selection function should fulfill: the minimum and maximum uncertainty principle, invariant to adding zeros, invariant to scale transformations, principle of nominal increase, transfer principle and the richest get richer inequality. We also present a novel selection function based on the use of similarity metrics, and more specifically the cosine measure which is commonly used in information retrieval, and demonstrate that this verifies six of the properties in addition to a weaker variant of the transfer principle, thereby representing a good selection approach. The theoretical study was complemented with an empirical study to compare the performance of different selection criteria (weight- and unweight-based) using real data in a parliamentary setting. In this study, we analyze the performance of the different functions focusing on the two main factors affecting the selection process: profile size (number of terms) and weight distribution. These profiles are then used in a document filtering task to show that our similarity-based approach performs well in terms not only of recommendation accuracy but also efficiency (we obtain smaller profiles and consequently faster recommendations).
- Open Access
Positive unlabeled learning for building recommender systems in a parliamentary setting
Our goal is to learn about the political interests and preferences of the Members of Parliament by mining their parliamentary activity, in order to develop a recommendation/filtering system that, given a stream of documents to be distributed among them, is able to decide which documents should receive each Member of Parliament. We propose to use positive unlabeled learning to tackle this problem, because we only have information about relevant documents (the own interventions of each Member of Parliament in the debates) but not about irrelevant documents, so that we cannot use standard binary classifiers trained with positive and negative examples. We have also developed a new algorithm of this type, which compares favourably with: a) the baseline approach assuming that all the interventions of other Members of Parliament are irrelevant, b) another well-known positive unlabeled learning method and c) an approach based on information retrieval methods that matches documents and legislators' representations. The experiments have been carried out with data from the regional Andalusian Parliament at Spain.
Open AccessPositive unlabeled learning for building recommender systems in a parliamentary setting
Our goal is to learn about the political interests and preferences of the Members of Parliament by mining their parliamentary activity, in order to develop a recommendation/filtering system that, given a stream of documents to be distributed among them, is able to decide which documents should receive each Member of Parliament. We propose to use positive unlabeled learning to tackle this problem, because we only have information about relevant documents (the own interventions of each Member of Parliament in the debates) but not about irrelevant documents, so that we cannot use standard binary classifiers trained with positive and negative examples. We have also developed a new algorithm of this type, which compares favourably with: a) the baseline approach assuming that all the interventions of other Members of Parliament are irrelevant, b) another well-known positive unlabeled learning method and c) an approach based on information retrieval methods that matches documents and legislators' representations. The experiments have been carried out with data from the regional Andalusian Parliament at Spain.
- Open Access
Automatic Construction of Multi-faceted User Profiles using Text Clustering and its Application to Expert Recommendation and Filtering Problems
In the information age we are living in today, not only are we interested in accessing multimedia objects such as documents, videos, etc. but also in searching for professional experts, people or celebrities, possibly for professional needs or just for fun. Information access systems need to be able to extract and exploit various sources of information (usually in text format) about such individuals, and to represent them in a suitable way usually in the form of a profile. In this article, we tackle the problems of profile-based expert recommendation and document filtering from a machine learning perspective by clustering expert textual sources to build profiles and capture the different hidden topics in which the experts are interested. The experts will then be represented by means of multi-faceted profiles. Our experiments show that this is a valid technique to improve the performance of expert finding and document filtering.
Open AccessAutomatic Construction of Multi-faceted User Profiles using Text Clustering and its Application to Expert Recommendation and Filtering Problems
In the information age we are living in today, not only are we interested in accessing multimedia objects such as documents, videos, etc. but also in searching for professional experts, people or celebrities, possibly for professional needs or just for fun. Information access systems need to be able to extract and exploit various sources of information (usually in text format) about such individuals, and to represent them in a suitable way usually in the form of a profile. In this article, we tackle the problems of profile-based expert recommendation and document filtering from a machine learning perspective by clustering expert textual sources to build profiles and capture the different hidden topics in which the experts are interested. The experts will then be represented by means of multi-faceted profiles. Our experiments show that this is a valid technique to improve the performance of expert finding and document filtering.
- Open Access
Publication venue recommendation using profiles based on clustering
In this paper we study the venue recommendation problem in order to help researchers to identify a journal or conference to submit a given paper. A common approach to tackle this problem is to build profiles defining the scope of each venue. Then, these profiles are compared against the target paper. In our approach we will study how clustering techniques can be used to construct topic-based profiles and use an Information Retrieval based approach to obtain the final recommendations. Additionally, we will explore how the use of authorship, representing a complementary piece of information, helps to improve the recommendations.
Open AccessPublication venue recommendation using profiles based on clustering
In this paper we study the venue recommendation problem in order to help researchers to identify a journal or conference to submit a given paper. A common approach to tackle this problem is to build profiles defining the scope of each venue. Then, these profiles are compared against the target paper. In our approach we will study how clustering techniques can be used to construct topic-based profiles and use an Information Retrieval based approach to obtain the final recommendations. Additionally, we will explore how the use of authorship, representing a complementary piece of information, helps to improve the recommendations.
- Open Access
Use of topical and temporal profiles and their hybridisation for content-based recommendation
In the context of content-based recommender systems, the aim of this paper is to determine how better profiles can be built and how these affect the recommendation process based on the incorporation of temporality, i.e. the inclusion of time in the recommendation process, and topicality, i.e. the representation of texts associated with users and items using topics and their combination. The main contribution of the paper is to present two different ways of hybridising these two dimensions and to evaluate and compare them with other alternatives.
Open AccessUse of topical and temporal profiles and their hybridisation for content-based recommendation
In the context of content-based recommender systems, the aim of this paper is to determine how better profiles can be built and how these affect the recommendation process based on the incorporation of temporality, i.e. the inclusion of time in the recommendation process, and topicality, i.e. the representation of texts associated with users and items using topics and their combination. The main contribution of the paper is to present two different ways of hybridising these two dimensions and to evaluate and compare them with other alternatives.
- Open Access
- 23 March 2023
- Published by MDPI AG in International Journal of Environmental Research and Public Health
- Vol. 20 (7) , 5246
Smartphone Apps for Domestic Violence Prevention: A Systematic Review
Smartphone applications or apps are increasingly being produced to help with protection against the risk of domestic violence. There is a need to formally evaluate their features. Objective: This study systematically reviewed app-based interventions for domestic violence prevention, which will be helpful for app developers. Methods: We overviewed all apps concerning domestic violence awareness and prevention without language restrictions, collating information about features and limitations. We conducted searches in Google, the Google Play Store, and the App Store (iOS) covering a 10-year time period (2012–2022). We collected data related to the apps from the developers’ descriptions, peer reviewed research articles, critical reviews in blogs, news articles, and other online sources. Results: The search identified 621 potentially relevant apps of which 136 were selected for review. There were five app categories: emergency assistance (n = 61, 44.9%), avoidance (n = 29, 21.3%), informative (n = 29, 21.3%), legal information (n = 10, 7.4%), and self-assessment (n = 7, 5.1%). Over half the apps (n = 97, 71%) were released in 2020–22. Around a half were from north-east America (n = 63, 46.3%). Where emergency alerts existed, they required triggering by the potential victim. There was no automation. Content analysis showed 20 apps with unique features, including geo-fences, accelerometer-based alert, shake-based alert, functionality under low resources, alert auto-cancellation, anonymous communication, and data encryption. None of the apps deployed artificial intelligence to assist the potential victims. Conclusions: Apps currently have many limitations. Future apps should focus on automation, making better use of artificial intelligence deploying multimedia (voice, video, image capture, text and sentiment analysis), speech recognition, and pitch detection to aid in live analysis of the situation and for accurately generating emergency alerts.
- 23 March 2023
- Published by MDPI AG in International Journal of Environmental Research and Public Health
- Vol. 20 (7) , 5246
Open AccessSmartphone Apps for Domestic Violence Prevention: A Systematic Review
Smartphone applications or apps are increasingly being produced to help with protection against the risk of domestic violence. There is a need to formally evaluate their features. Objective: This study systematically reviewed app-based interventions for domestic violence prevention, which will be helpful for app developers. Methods: We overviewed all apps concerning domestic violence awareness and prevention without language restrictions, collating information about features and limitations. We conducted searches in Google, the Google Play Store, and the App Store (iOS) covering a 10-year time period (2012–2022). We collected data related to the apps from the developers’ descriptions, peer reviewed research articles, critical reviews in blogs, news articles, and other online sources. Results: The search identified 621 potentially relevant apps of which 136 were selected for review. There were five app categories: emergency assistance (n = 61, 44.9%), avoidance (n = 29, 21.3%), informative (n = 29, 21.3%), legal information (n = 10, 7.4%), and self-assessment (n = 7, 5.1%). Over half the apps (n = 97, 71%) were released in 2020–22. Around a half were from north-east America (n = 63, 46.3%). Where emergency alerts existed, they required triggering by the potential victim. There was no automation. Content analysis showed 20 apps with unique features, including geo-fences, accelerometer-based alert, shake-based alert, functionality under low resources, alert auto-cancellation, anonymous communication, and data encryption. None of the apps deployed artificial intelligence to assist the potential victims. Conclusions: Apps currently have many limitations. Future apps should focus on automation, making better use of artificial intelligence deploying multimedia (voice, video, image capture, text and sentiment analysis), speech recognition, and pitch detection to aid in live analysis of the situation and for accurately generating emergency alerts.