Results 221 to 230 of about 4,564 (243)

On the Kernel of a Markov Projection on C(X)

Proceedings of the American Mathematical Society, 1985
Summary: Let X be a compact metric space and L a closed linear subspace of C(X), the real valued continuous functions on X. We give necessary and sufficient conditions of an algebraic nature for L to be the kernel of a Markov projection P on C(X). We also characterize compact spaces for which our result holds as those for which the Borsuk-Dugundji ...
openaire   +1 more source

Spatial Markov Kernels for Image Categorization and Annotation

IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2011
This paper presents a novel discriminative stochastic method for image categorization and annotation. We first divide the images into blocks on a regular grid and then generate visual keywords through quantizing the features of image blocks. The traditional Markov chain model is generalized to capture 2-D spatial dependence between visual keywords by ...
Zhiwu Lu 0001, Horace Ho-Shing Ip
openaire   +2 more sources

Weak Convergence of Markov Kernels

2015
As indicated in the previous chapter, stable convergence of random variables can be seen as suitable convergence of Markov kernels given by conditional distributions. The required facts from the theory of weak convergence of Markov kernels will be presented in this chapter.
Erich Häusler, Harald Luschgy
openaire   +1 more source

On Authorship Attribution via Markov Chains and Sequence Kernels

18th International Conference on Pattern Recognition (ICPR'06), 2006
We investigate the use of recently proposed character and word sequence kernels for the task of authorship attribution and compare their performance with two probabilistic approaches based on Markov chains of characters and words. Several configurations of the sequence kernels are studied using a relatively large dataset, where each author covered ...
C Sanderson
exaly   +3 more sources

Continuous Affine Functions on the Space of Markov Kernels

Theory of Probability & Its Applications, 1986
Reprint from Teor. Veroyatn. Primen. 30, No.3, 486-498 (1985; Zbl 0584.60005).
openaire   +2 more sources

Universal Markov Kernels for Quantum Observables

2019
We prove the existence of a universal Markov kernel, i.e., a Markov kernel µ such that every commutative POVM F is the smearing of a selfadjoint operator AF with the smearing realized through µ. The relevance of the smearing is illustrated in connection with the problem of the joint measurability of two quantum observables.
openaire   +2 more sources

Apnea Detection Based on Hidden Markov Model Kernel

2011
0 ...
Carlos M. Travieso, Jesús B. Alonso, Jaime Roberto Ticay-Rivas, Marcos del Pozo-Baños   +3 more
openaire   +2 more sources

Learning performance of kernel SVMC with Markov chain samples

2013 Ninth International Conference on Natural Computation (ICNC), 2013
Markov sampling is a natural sampling mechanism extensively used in applications, especially in the study of time sequence or content-based pattern recognition or biological sequence analysis. In this paper we generalize the study on the learning performance of support vector machine classification (SVMC) algorithm with Markov chain samples based on ...
Jie Xu 0006, Tao Luo 0006, Bin Zou 0002
openaire   +1 more source

Aspects of large random Markov kernels

Stochastics, 2009
We briefly review certain asymptotic properties of random Markov kernels on a finite state space. These models can be thought of as finite Markov chains in random environment. Here, the asymptotics are taken with respect to the cardinality of the state space. We study, for instance, the behaviour of the normalized invariant vector, the global behaviour
openaire   +1 more source

Nonlinear Transformations of Marginalisation Mappings for Kernels on Hidden Markov Models

2011 10th International Conference on Machine Learning and Applications and Workshops, 2011
Many problems in machine learning involve variable-size structured data, such as sets, sequences, trees, and graphs. Generative (i.e. model based) kernels are well suited for handling structured data since they are able to capture their underlying structure by allowing the inclusion of prior information via specification of the source models.
Anna Caterina Carli, Francesca P. Carli
openaire   +2 more sources