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

DOI10.1016/j.jfranklin.2006.03.018zbMath1105.93001OpenAlexW2031774932MaRDI QIDQ860375

Deniz Erdogmus, Jose C. Principe, Robert Jenssen, 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)

Related Items (6)

Multiscale principle of relevant information for hyperspectral image classification ⋮ The Kullback-Leibler divergence between lattice Gaussian distributions ⋮ Inequality-induced similarity measures for radial electronic probability densities in hydrogenic atoms ⋮ Divergence-Based Vector Quantization ⋮ 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

Uses Software

• KernSmooth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• A mutual information extension to the matched filter
• On bandwidth variation in kernel estimates. A square root law
• Blind source separation using Renyi's \(\alpha\)-marginal entropies.
• Improved variable window kernel estimates of probability densities
• Support-vector networks
• Smoothing methods in statistics
• A Brief Survey of Bandwidth Selection for Density Estimation
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Minimax Mutual Information Approach for Independent Component Analysis
• Stochastic blind equalization based on PDF fitting using Parzen estimator
• On Estimation of a Probability Density Function and Mode
• On Information and Sufficiency
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Learning from examples with information theoretic criteria

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