Continuum versus discrete networks,graph Laplacians,and reproducing kernel Hilbert spaces |
| |
Authors: | Palle ET Jorgensen Erin PJ Pearse |
| |
Institution: | 1. University of Iowa, Iowa City, IA 52246-1419, USA;2. California State Polytechnic University, San Luis Obispo, CA 93405-0403, USA |
| |
Abstract: | Motivated by applications to machine learning, we construct a reversible and irreducible Markov chain whose state space is a certain collection of measurable sets of a chosen l.c.h. space . We study the resulting network (connected undirected graph), including transience, Royden and Riesz decompositions, and kernel factorization. We describe a construction for Hilbert spaces of signed measures which comes equipped with a new notion of reproducing kernels and there is a unique solution to a regularized optimization problem involving the approximation of functions by functions of finite energy. The latter has applications to machine learning (for Markov random fields, for example). |
| |
Keywords: | Markov chain Graph Laplacian Continuum network Reproducing kernel Hilbert space Machine learning Induced signed measure |
本文献已被 ScienceDirect 等数据库收录! |
|