The Cauchy--Schwarz divergence and Parzen windowing: Connections to graph theory and Mercer kernels

DOI10.1016/J.JFRANKLIN.2006.03.018MaRDI QIDQ860375zbMATH OpenOpenAlexFDO

Authors Robert Jenssen, José C. Príncipe, Deniz Erdogmus, Torbjørn Eltoft

Publication date 9 January 2007

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jfranklin.2006.03.018

zbMATH Keywords

information theoryspectral methodsgraph cutCauchy-Schwarz divergenceMercer kernel theoryParzen windowing

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Stochastic learning and adaptive control (93E35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to systems and control theory (93-01)

Recommendations

• Information Theoretic Learning and Kernel Methods
• Graph kernels from the Jensen-Shannon divergence
• Nonextensive information theoretic kernels on measures
• Kernel distribution embeddings: universal kernels, characteristic kernels and kernel metrics on distributions
• Information Divergence Geometry and the Application to Statistical Machine Learning

Cites work

• scientific article; zbMATH DE number 469135 (Why is no real title available?)
• scientific article; zbMATH DE number 4001209 (Why is no real title available?)
• scientific article; zbMATH DE number 837911 (Why is no real title available?)
• scientific article; zbMATH DE number 847282 (Why is no real title available?)
• scientific article; zbMATH DE number 1391397 (Why is no real title available?)
• A Brief Survey of Bandwidth Selection for Density Estimation
• A Mathematical Theory of Communication
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A mutual information extension to the matched filter
• Blind source separation using Renyi's -marginal entropies.
• Improved variable window kernel estimates of probability densities
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Learning from examples with information theoretic criteria
• Minimax Mutual Information Approach for Independent Component Analysis
• On Estimation of a Probability Density Function and Mode
• On Information and Sufficiency
• On bandwidth variation in kernel estimates. A square root law
• Open problems of Paul Erd�s in graph theory
• Smoothing methods in statistics
• Stochastic blind equalization based on PDF fitting using Parzen estimator
• Support-vector networks

Cited in

(8)

• Clustering in Hilbert's projective geometry: the case studies of the probability simplex and the elliptope of correlation matrices
• Extreme entropy machines: robust information theoretic classification
• The Kullback-Leibler divergence between lattice Gaussian distributions
• Incipient fault detection and isolation with Cauchy-Schwarz divergence: a probabilistic approach
• Similarity among quantum-mechanical states: analysis and applications for central potentials
• Divergence-based vector quantization
• Inequality-induced similarity measures for radial electronic probability densities in hydrogenic atoms
• Multiscale principle of relevant information for hyperspectral image classification

Describes a project that uses

Uses Software

• KernSmooth

This page was built for publication: The Cauchy--Schwarz divergence and Parzen windowing: Connections to graph theory and Mercer kernels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860375)