Yasmín Hernández

Dr. Yasmín Hernández

orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 August 2023 in Healthcare
Verified
Journal Article
Open access
PDF file
PCPatricia Alejandra Cuevas Chavez
Patricia Alejandra Cuevas Chavez
YHYasmín Hernández
Yasmín Hernández
JOJavier Ortiz-Hernandez
Javier Ortiz-Hernandez
Eduardo Sanchez JimenezEduardo Sanchez Jimenez
Eduardo Sanchez Jimenez
GRGilberto Ruiz
Gilberto Ruiz
Gabriel Gonzalez SernaGabriel Gonzalez Serna
Gabriel Gonzalez Serna
According to the Pan American Health Organization, cardiovascular disease is the leading cause of death worldwide, claiming an estimated 17.9 million lives each year. This paper presents a systematic review to highlight the use of IoT, IoMT, and machine learning to detect, predict, or monitor cardiovascular disease. We had a final sample of 164 high-impact journal papers, focusing on two categories: cardiovascular disease detection using IoT/IoMT technologies and cardiovascular disease using machine learning techniques. For the first category, we found 82 proposals, while for the second, we found 85 proposals. The research highlights list of IoT/IoMT technologies, machine learning techniques, datasets, and the most discussed cardiovascular diseases. Neural networks have been popularly used, achieving an accuracy of over 90%, followed by random forest, XGBoost, k-NN, and SVM. Based on the results, we conclude that IoT/IoMT technologies can predict cardiovascular diseases in real time, ensemble techniques obtained one of the best performances in the accuracy metric, and hypertension and arrhythmia were the most discussed diseases. Finally, we identified the lack of public data as one of the main obstacles for machine learning approaches for cardiovascular disease prediction.

3 September 2018 in Computer Applications in Engineering Education
Verified
Journal Article
Closed access
PDF file
RBRaúl Oramas Bustillos
Raúl Oramas Bustillos
Ramón Zatarain CabadaRamón Zatarain Cabada
Ramón Zatarain Cabada
MARIA LUCIA BARRON ESTRADAMARIA LUCIA BARRON ESTRADA
MARIA LUCIA BARRON ESTRADA
YHYasmín Hernández
Yasmín Hernández

4 December 2018 in Journal of Ambient Intelligence and Humanized Computing
Verified
Journal Article
Closed access
PDF file
WSWendy Sanchez
Wendy Sanchez
ARAlicia Martinez Rebollar
Alicia Martinez Rebollar
YHYasmín Hernández
Yasmín Hernández
HEHugo Estrada Esquivel
Hugo Estrada Esquivel
Miguel Gonzalez-MendozaMiguel Gonzalez-Mendoza
Miguel Gonzalez-Mendoza

31 July 2022 in Axioms
Verified
Journal Article
Open access
PDF file
JPJoaquín Pérez-Ortega
Joaquín Pérez-Ortega
SASANDRA SILVIA Silvia AGUILAR
SANDRA SILVIA Silvia AGUILAR
NANelva Nely Almanza-Ortega
Nelva Nely Almanza-Ortega
Juan Frausto SolisJuan Frausto Solis
Juan Frausto Solis
JZJose Crispín Zavala-Diaz
Jose Crispín Zavala-Diaz
VLVanesa Landero
Vanesa Landero
A hybrid variant of the Fuzzy C-Means and K-Means algorithms is proposed to solve large datasets such as those presented in Big Data. The Fuzzy C-Means algorithm is sensitive to the initial values of the membership matrix. Therefore, a special configuration of the matrix can accelerate the convergence of the algorithm. In this sense, a new approach is proposed, which we call Hybrid OK-Means Fuzzy C-Means (HOFCM), and it optimizes the values of the membership matrix parameter. This approach consists of three steps: (a) generate a set of n solutions of an x dataset, applying a variant of the K-Means algorithm; (b) select the best solution as the basis for generating the optimized membership matrix; (c) resolve the x dataset with Fuzzy C-Means. The experimental results with four real datasets and one synthetic dataset show that HOFCM reduces the time by up to 93.94% compared to the average time of the standard Fuzzy C-Means. It is highlighted that the quality of the solution was reduced by 2.51% in the worst case.

15 March 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YHYasmín Hernández
Yasmín Hernández
ARAlicia Martinez Rebollar
Alicia Martinez Rebollar
HEHugo Estrada Esquivel
Hugo Estrada Esquivel
JOJavier Ortiz-Hernandez
Javier Ortiz-Hernandez
CACarlos Acevedo
Carlos Acevedo
Personality is a unique trait that distinguishes an individual. It includes an ensemble of peculiarities on how people think, feel, and behave that affects the interactions and relationships of people. Personality is useful in diverse areas such as marketing, training, education, and human resource management. There are various approaches for personality recognition and different psychological models. Preceding work indicates that linguistic analysis is a promising way to recognize personality. In this work, a proposal for personality recognition relying on the dominance, influence, steadiness, and compliance (DISC) model and statistical methods for language analysis is presented. To build the model, a survey was conducted with 120 participants. The survey consisted in the completion of a personality test and handwritten paragraphs. The study resulted in a dataset that was used to train several machine learning algorithms. It was found that the AdaBoost classifier achieved the best results followed by Random Forest. In both cases a feature selection pre-process with Pearson’s Correlation was conducted. AdaBoost classifier obtained the average scores: accuracy = 0.782, precision = 0.795, recall = 0.782, F-measure = 0.786, receiver operating characteristic (ROC) area = 0.939.

1 January 2017 in Scientific Programming
Verified
Journal Article
Open access
FPFernando Pech
Fernando Pech
ARAlicia Martinez Rebollar
Alicia Martinez Rebollar
HEHugo Estrada Esquivel
Hugo Estrada Esquivel
YHYasmín Hernández
Yasmín Hernández
There is a large amount of information in the form of unstructured documents which pose challenges in the information storage, search, and retrieval. This situation has given rise to several information search approaches. Some proposals take into account the contextual meaning of the terms specified in the query. Semantic annotation technique can help to retrieve and extract information in unstructured documents. We propose a semantic annotation strategy for unstructured documents as part of a semantic search engine. In this proposal, ontologies are used to determine the context of the entities specified in the query. Our strategy for extracting the context is focused on concepts similarity. Each relevant term of the document is associated with an instance in the ontology. The similarity between each of the explicit relationships is measured through the combination of two types of associations: the association between each pair of concepts and the calculation of the weight of the relationships.