z-logo
open-access-imgOpen Access
Genomic Similarity and Kernel Methods I: Advancements by Building on Mathematical and Statistical Foundations
Author(s) -
Daniel J. Schaid
Publication year - 2010
Publication title -
human heredity
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.423
H-Index - 62
eISSN - 1423-0062
pISSN - 0001-5652
DOI - 10.1159/000312641
Subject(s) - kernel (algebra) , similarity (geometry) , computer science , kernel method , nonparametric statistics , machine learning , data mining , mathematics , support vector machine , artificial intelligence , statistics , combinatorics , image (mathematics)
Measures of genomic similarity are the basis of many statistical analytic methods. We review the mathematical and statistical basis of similarity methods, particularly based on kernel methods. A kernel function converts information for a pair of subjects to a quantitative value representing either similarity (larger values meaning more similar) or distance (smaller values meaning more similar), with the requirement that it must create a positive semidefinite matrix when applied to all pairs of subjects. This review emphasizes the wide range of statistical methods and software that can be used when similarity is based on kernel methods, such as nonparametric regression, linear mixed models and generalized linear mixed models, hierarchical models, score statistics, and support vector machines. The mathematical rigor for these methods is summarized, as is the mathematical framework for making kernels. This review provides a framework to move from intuitive and heuristic approaches to define genomic similarities to more rigorous methods that can take advantage of powerful statistical modeling and existing software. A companion paper reviews novel approaches to creating kernels that might be useful for genomic analyses, providing insights with examples [1].

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here