Manuel Mejía-Lavalle
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
Manuel Mejía-Lavalle has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Alicia Martínez-Rebollar
Centro Nacional de Investigación y Desarrollo Tecnológico
3 shared publications - Dante Mújica-Vargas
Departamento de Ciencias Computacionales, Tecnológico Nacional de México, Centro Nacional de Investigación y Desarrollo Tecnológico, Cuernavaca 62490, Morelos, Mexico
2 shared publications Guillermo Rodriguez
Instituto de Investigaciones Eléctricas, México
2 shared publications- Alejandra Molina
Computer Science Department, National Centre for Research and Technology Development, Cuernavaca 62490, Mexico
1 shared publication Alicia Martínez
Centro Nacional de Investigación y Desarrollo Tecnológico (CENIDET)
1 shared publication- Carlos Pérez Cerón
Universidad Autónoma Metropolitana-Xochimilco
1 shared publication
Latest Publications
- 27 October 2019
- Published by Springer Nature
- p. 200-211
Pulsed Neural Network Plus Parallel Multi-core Approach to Solve Efficiently Big Shortest Path Problems
- 27 October 2019
- Published by Springer Nature
- p. 200-211
Pulsed Neural Network Plus Parallel Multi-core Approach to Solve Efficiently Big Shortest Path Problems
- Open Access
- 31 December 2017
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Research in Computing Science
- Vol. 140 (1) , 105-122
Estado del arte y elementos del reconocimiento automático de imágenes del cerebro
- 31 December 2017
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Research in Computing Science
- Vol. 140 (1) , 105-122
Open AccessEstado del arte y elementos del reconocimiento automático de imágenes del cerebro
- 2 August 2017
- Published by Springer Nature
- p. 473-480
Toward Optimal Pedagogical Action Patterns by Means of Partially Observable Markov Decision Process
- 2 August 2017
- Published by Springer Nature
- p. 473-480
Toward Optimal Pedagogical Action Patterns by Means of Partially Observable Markov Decision Process
- Open Access
- 31 December 2016
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Research in Computing Science
- Vol. 114 (1) , 151-160
Detección de texto en imágenes digitales como estrategia para mejorar la recuperación de imágenes por contenido
- 31 December 2016
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Research in Computing Science
- Vol. 114 (1) , 151-160
Open AccessDetección de texto en imágenes digitales como estrategia para mejorar la recuperación de imágenes por contenido
- Open Access
Emotion-Bracelet: A Web Service for Expressing Emotions through an Electronic Interface
The mechanisms to communicate emotions have dramatically changed in the last 10 years with social networks, where users massively communicate their emotional states by using the Internet. However, people with socialization problems have difficulty expressing their emotions verbally or interpreting the environment and providing an appropriate emotional response. In this paper, a novel solution called the Emotion-Bracelet is presented that combines a hardware device and a software system. The proposed approach identifies the polarity and emotional intensity of texts published on a social network site by performing real-time processing using a web service. It also shows emotions with a LED matrix using five emoticons that represent positive, very positive, negative, very negative, and neutral states. The Emotion-Bracelet is designed to help people express their emotions in a non-intrusive way, thereby expanding the social aspect of human emotions.
Open AccessEmotion-Bracelet: A Web Service for Expressing Emotions through an Electronic Interface
The mechanisms to communicate emotions have dramatically changed in the last 10 years with social networks, where users massively communicate their emotional states by using the Internet. However, people with socialization problems have difficulty expressing their emotions verbally or interpreting the environment and providing an appropriate emotional response. In this paper, a novel solution called the Emotion-Bracelet is presented that combines a hardware device and a software system. The proposed approach identifies the polarity and emotional intensity of texts published on a social network site by performing real-time processing using a web service. It also shows emotions with a LED matrix using five emoticons that represent positive, very positive, negative, very negative, and neutral states. The Emotion-Bracelet is designed to help people express their emotions in a non-intrusive way, thereby expanding the social aspect of human emotions.
- 21 May 2016
- Published by Springer Nature
- p. 64-73
An Effective Image De-noising Alternative Approach Based on Third Generation Neural Networks
- 21 May 2016
- Published by Springer Nature
- p. 64-73
An Effective Image De-noising Alternative Approach Based on Third Generation Neural Networks
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 52-57
Non-Myopic Feature Selection Method for Continuous Attributes and Discrete Class
Currently there exist diverse feature selection ranking methods and metrics for databases with pure discrete data (attributes and class), or pure continuous data. However, little work has been done for the case of continuous attributes with discrete class, and at the same time evaluating attribute subsets in a non-myopic fashion, considering its inter-dependencies or interactions. Normally what we can do is perform discretization, and then apply some traditional feature selection method; nevertheless the results vary depending on the discretization method that we utilized. Additionally, if we only evaluate isolated attributes, we probably obtain poor results, because we are not considering attribute inter-dependencies. We propose a metric and method for feature selection on continuous data with discrete class, inspired in the Shannon's entropy and the information gain, which overcomes the above problems. In the experiments that we realized, with synthetic and real databases, the proposed method has shown to be fast and produce near optimum solutions, selecting few attributes.
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 52-57
Non-Myopic Feature Selection Method for Continuous Attributes and Discrete Class
Currently there exist diverse feature selection ranking methods and metrics for databases with pure discrete data (attributes and class), or pure continuous data. However, little work has been done for the case of continuous attributes with discrete class, and at the same time evaluating attribute subsets in a non-myopic fashion, considering its inter-dependencies or interactions. Normally what we can do is perform discretization, and then apply some traditional feature selection method; nevertheless the results vary depending on the discretization method that we utilized. Additionally, if we only evaluate isolated attributes, we probably obtain poor results, because we are not considering attribute inter-dependencies. We propose a metric and method for feature selection on continuous data with discrete class, inspired in the Shannon's entropy and the information gain, which overcomes the above problems. In the experiments that we realized, with synthetic and real databases, the proposed method has shown to be fast and produce near optimum solutions, selecting few attributes.
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 318-323
Feature Selection with Interactions for Continuous Attributes and Discrete Class
Nowadays there exist diverse feature selection ranking methods and metrics for databases with pure discrete data (attributes and class), or pure continuous data. However, little work has been done for the case of continuous attributes with discrete class, and at the same time evaluating attribute subsets considering its inter- dependencies or interactions. Normally what we can do is perform discretization, and then apply some traditional feature selection method; nevertheless the results vary depending on the discretization method that we utilized. Additionally, if we only evaluate isolated attributes, we probably obtain poor results, because we are not considering attribute inter-dependencies. We propose a metric and method for feature selection on continuous data with discrete class, inspired in the Shannon's entropy and the Information Gain, which overcomes the above problems. In the experiments that we realized, with synthetic and real databases, the proposed method has shown to be fast and produce near optimum solutions, selecting few attributes.
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 318-323
Feature Selection with Interactions for Continuous Attributes and Discrete Class
Nowadays there exist diverse feature selection ranking methods and metrics for databases with pure discrete data (attributes and class), or pure continuous data. However, little work has been done for the case of continuous attributes with discrete class, and at the same time evaluating attribute subsets considering its inter- dependencies or interactions. Normally what we can do is perform discretization, and then apply some traditional feature selection method; nevertheless the results vary depending on the discretization method that we utilized. Additionally, if we only evaluate isolated attributes, we probably obtain poor results, because we are not considering attribute inter-dependencies. We propose a metric and method for feature selection on continuous data with discrete class, inspired in the Shannon's entropy and the Information Gain, which overcomes the above problems. In the experiments that we realized, with synthetic and real databases, the proposed method has shown to be fast and produce near optimum solutions, selecting few attributes.