Open Access
Translator Disclaimer
2010 Regularization Techniques for Machine Learning on Graphs and Networks with Biological Applications
Charles DeLisi, Yue Fan, Shinuk Kim, Mark Kon, Louise Raphael
Commun. Math. Anal. 8(3): 136-145 (2010).

Abstract

The representation of a high dimensional machine learning (ML) feature space $F$ as a function space for the purpose of denoising data is introduced. We illustrate an application of such a representation of feature vectors by applying a local averaging denoising method for functions on Euclidean and metric spaces (together with its graph generalization) to the regularization of feature vectors in ML. We first discuss this technique for noisy functions on $\mathbb{R}$, and then extend it to functions defined on graphs and networks. This method exhibits a paradoxical property of the bias-variance problem in machine learning, namely, that as the scale over which averages are taken decreases, the error rate for classification first decreases and then increases. This approach is tested on two benchmark DNA microarray data sets used for classification of breast tumors based on predicted metastasis.

Citation

Download Citation

Charles DeLisi. Yue Fan. Shinuk Kim. Mark Kon. Louise Raphael. "Regularization Techniques for Machine Learning on Graphs and Networks with Biological Applications." Commun. Math. Anal. 8 (3) 136 - 145, 2010.

Information

Published: 2010
First available in Project Euclid: 17 August 2010

MathSciNet: MR2738337

Subjects:
Primary: 46N60 , 68Q32
Secondary: 92B05

Keywords: Bias-variance , Computational biology , functional analysis , gene expression array , machine learning

Rights: Copyright © 2010 Mathematical Research Publishers

JOURNAL ARTICLE
10 PAGES


SHARE
Vol.8 • No. 3 • 2010
Back to Top