• español
    • English
  • English 
    • español
    • English
  • Login
View Item 
  •   DSpace Home
  • Producción Científica
  • Artículos, capítulos, libros...UCO
  • View Item
  •   DSpace Home
  • Producción Científica
  • Artículos, capítulos, libros...UCO
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Alzheimer Identification through DNA Methylation and Artificial Intelligence Techniques

Thumbnail
View/Open
mathematics-09-02482.pdf (255.1Kb)
Author
Alfonso Pérez, Gerardo
Caballero-Villarraso, Javier
Publisher
MDPI
Date
2021
Subject
Algorithm
Identification
Alzheimer
METS:
Mostrar el registro METS
PREMIS:
Mostrar el registro PREMIS
Metadata
Show full item record
Abstract
A nonlinear approach to identifying combinations of CpGs DNA methylation data, as biomarkers for Alzheimer (AD) disease, is presented in this paper. It will be shown that the presented algorithm can substantially reduce the amount of CpGs used while generating forecasts that are more accurate than using all the CpGs available. It is assumed that the process, in principle, can be non-linear; hence, a non-linear approach might be more appropriate. The proposed algorithm selects which CpGs to use as input data in a classification problem that tries to distinguish between patients suffering from AD and healthy control individuals. This type of classification problem is suitable for techniques, such as support vector machines. The algorithm was used both at a single dataset level, as well as using multiple datasets. Developing robust algorithms for multi-datasets is challenging, due to the impact that small differences in laboratory procedures have in the obtained data. The approach that was followed in the paper can be expanded to multiple datasets, allowing for a gradual more granular understanding of the underlying process. A 92% successful classification rate was obtained, using the proposed method, which is a higher value than the result obtained using all the CpGs available. This is likely due to the reduction in the dimensionality of the data obtained by the algorithm that, in turn, helps to reduce the risk of reaching a local minima.
URI
http://hdl.handle.net/10396/21855
Fuente
Mathematics 9(19), 2482 (2021)
Versión del Editor
https://doi.org/10.3390/math9192482
Collections
  • DBBM-Artículos, capítulos, libros...
  • Artículos, capítulos, libros...UCO

DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback
© Biblioteca Universidad de Córdoba
Biblioteca  UCODigital
 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Statistics

View Usage Statistics

De Interés

Archivo Delegado/AutoarchivoAyudaPolíticas de Helvia

Compartir


DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback
© Biblioteca Universidad de Córdoba
Biblioteca  UCODigital