Search

Your search keyword '"Pérez-Ortega, Joaquín"' showing total 31 results
Start Over Author "Pérez-Ortega, Joaquín"
31 results on '"Pérez-Ortega, Joaquín"'

2. Prediction of Diabetes Mortality in Mexico City Applying Data Science

Author

Pérez-Ortega, Joaquín, Vega-Villalobos, Andrea, Almanza-Ortega, Nelva Nely, Pazos-Rangel, Rodolfo A., Zavala-Díaz, José Crispín, Rodríguez-Lélis, José María, Hernández, Yazmín, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Hernández Heredia, Yanio, editor, Milián Núñez, Vladimir, editor, and Ruiz Shulcloper, José, editor

Published
2021
Full Text
View/download PDF

3. Hybrid Fuzzy C-Means Clustering Algorithm, Improving Solution Quality and Reducing Computational Complexity.

Author

Pérez-Ortega, Joaquín, Moreno-Calderón, Carlos Fernando, Roblero-Aguilar, Sandra Silvia, Almanza-Ortega, Nelva Nely, Frausto-Solís, Juan, Pazos-Rangel, Rodolfo, and Martínez-Rebollar, Alicia

Subjects
*COMPUTATIONAL complexity, *FUZZY algorithms, *HEURISTIC, *INSTITUTIONAL repositories, *CLUSTERING algorithms
Abstract

Fuzzy C-Means is a clustering algorithm widely used in many applications. However, its computational complexity is very large, which prevents its use for large problem instances. Therefore, a hybrid improvement is proposed for the algorithm, which considerably reduces the number of iterations and, in many cases, improves the solution quality, expressed as the value of the objective function. This improvement integrates two heuristics, one in the initialization phase and the other in the convergence phase or the convergence criterion. This improvement was called HPFCM. A set of experiments was designed to validate this proposal; to this end, four sets of real data were solved from a prestigious repository. The solutions obtained by HPFCM were compared against those of the Fuzzy C-Means algorithm. In the best case, reductions of an average of 97.65% in the number of required iterations and an improvement in quality solution of 82.42% were observed when solving the SPAM dataset. Finally, we consider that the proposed heuristics may inspire improvements in other specific purpose variants of Fuzzy C-Means. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

7. The K-Means Algorithm Evolution

Author

Pérez-Ortega, Joaquín, primary, Nely Almanza-Ortega, Nelva, additional, Vega-Villalobos, Andrea, additional, Pazos-Rangel, Rodolfo, additional, Zavala-Díaz, Crispín, additional, and Martínez-Rebollar, Alicia, additional

Published
2020
Full Text
View/download PDF

21. Surveying the Optimization Problems of Water Distribution Networks

Author

Ruiz-Vanoye, Jorge, primary, Barrera-Cámara, Ricardo, additional, Díaz-Parra, Ocotlán, additional, Fuentes-Penna, Alejandro, additional, Pérez Ortega, Joaquín, additional, Bernabe Loranca, Beatriz, additional, Canepa Saenz, Ana, additional, and Santiago-Pérez, Judith del Carmen, additional

Published
2018
Full Text
View/download PDF

22. Matrix multiplication with a hypercube algorithm on multi-core processor cluster

Author

Zavala-Díaz, José Crispín, Pérez-Ortega, Joaquín, Salazar-Reséndiz, Efraín, and Guadarrama-Rogel, Luis César

Subjects
Matrix multiplication, Algoritmo Hipercubo, Hypercube algorithm, cluster de procesadores multi-core, Multiplicación de matrices, multi-core processor cluster
Abstract

The algorithm of multiplication of matrices of Dekel, Nassimi and Sahani or Hypercube is analysed, modified and implemented on multi-core processor cluster, where the number of processors used is less than that required by the algorithm n³. 2³, 4³ and 8³ processing units are used to multiply matrices of the order of 10x10, 10²x10² and 10³X10³. The results of the mathematical model of the modified algorithm and those obtained from the computational experiments show that it is possible to reach acceptable speedup and parallel efficiencies, based on the number of used processor units. It also shows that the influence of the external communication link among the nodes is reduced if a combination of the available communication channels among the cores in a multi-core cluster is used. Se analiza, modifica e implementa el algoritmo de multiplicación de matrices de Dekel, Nassimi y Sahani o hipercubo en un cluster de procesadores multi-core, donde el número de procesadores utilizado es menor al requerido por el algoritmo de n³. Se utilizan 2³, 4³ y 8³ unidades procesadoras para multiplicar matrices de orden de magnitud de 10X10, 10²X10² y 10³X10³. Los resultados del modelo matemático del algoritmo modificado y los obtenidos de la experimentación computacional muestran que es posible alcanzar rapidez y eficiencias paralelas aceptables, en función del número de unidades procesadoras utilizadas. También se muestra que la influencia del enlace externo de comunicación entre los nodos disminuye si se utiliza una combinación de los canales de comunicación disponibles entre los núcleos en un cluster multi-core.

Published
2015

23. Editorial for Volume 10 Number 3: Can Machines Play Musical Instruments?

Author

Ruiz-Vanoye, Jorge A., Díaz-Parra, Ocotlán, Fuentes-Penna, Alejandro, Cámara, Ricardo A. Barrera, Ruiz-Jaimes, Miguel A., and Pérez-Ortega, Joaquín

Subjects
MUSICAL instruments, MUSICALS, ROBOT design & construction, HUMAN beings, MACHINING, BAGGAGE handling in airports
Abstract

The robots are designed to help with difficult tasks for the human being, currently carried out activities that were a main feature of the human how to perform surgeries, injections, run musical instruments among others. This paper aims to highlight the Musical Artificial Intelligent and the history of the Musicians Robots. [ABSTRACT FROM AUTHOR]

Published
2019

27. Complexity of Instances for Combinatorial Optimization Problems

Author

Ruiz-Vanoye, Jorge A., Díaz-Parra, Ocotlán, Pérez-Ortega, Joaquín, Pazos R., Rodolfo A., Reyes Salgado, Gerardo, González-Barbosa, Juan Javier, Ruiz-Vanoye, Jorge A., Díaz-Parra, Ocotlán, Pérez-Ortega, Joaquín, Pazos R., Rodolfo A., Reyes Salgado, Gerardo, and González-Barbosa, Juan Javier

Published
2010
Full Text
View/download PDF

29. Application of formal languages in polynomial transformations of instances between NP-complete problems.

Author

Ruiz-Vanoye, Jorge, Pérez-Ortega, Joaquín, Pazos Rangel, Rodolfo, Díaz-Parra, Ocotlán, Fraire-Huacuja, Héctor, Frausto-Solís, Juan, Reyes-Salgado, Gerardo, and Cruz-Reyes, Laura

Abstract

We propose the usage of formal languages for expressing instances of NP-complete problems for their application in polynomial transformations. The proposed approach, which consists of using formal language theory for polynomial transformations, is more robust, more practical, and faster to apply to real problems than the theory of polynomial transformations. In this paper we propose a methodology for transforming instances between NP-complete problems, which differs from Garey and Johnson's. Unlike most transformations which are used for proving that a problem is NP-complete based on the NP-completeness of another problem, the proposed approach is intended for extrapolating some known characteristics, phenomena, or behaviors from a problem A to another problem B. This extrapolation could be useful for predicting the performance of an algorithm for solving B based on its known performance for problem A, or for taking an algorithm that solves A and adapting it to solve B. [ABSTRACT FROM AUTHOR]

Published
2013
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results