Information theoretic learning with adaptive kernels

DOI10.1016/J.SIGPRO.2010.06.023MaRDI QIDQ612575zbMATH OpenOpenAlexFDO

Authors Abhishek Singh, José C. Príncipe

Publication date 29 December 2010

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.sigpro.2010.06.023

zbMATH Keywords

adaptive system traininginformation theoretic learningkernel widthKullback Leibler divergenceminimum error entropy

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Information theory (general) (94A15) Measures of information, entropy (94A17)

Recommendations

• Kernel gradient descent algorithm for information theoretic learning
• Information theoretic learning. Renyi's entropy and kernel perspectives
• Learning from examples with information theoretic criteria
• scientific article; zbMATH DE number 1694978
• Online minimum error entropy algorithm with unbounded sampling

Cites work

• A Method for Selecting the Bin Size of a Time Histogram
• Deterministic Nonperiodic Flow
• Histogram bin width selection for time-dependent Poisson processes
• scientific article; zbMATH DE number 3789676 (Why is no real title available?)
• scientific article; zbMATH DE number 4001209 (Why is no real title available?)
• On Estimation of a Probability Density Function and Mode
• On Kullback-Leibler loss and density estimation
• On the Choice of Smoothing Parameters for Parzen Estimators of Probability Density Functions

Cited in

(8)

• Block-sparsity regularized maximum correntropy criterion for structured-sparse system identification
• Kernel gradient descent algorithm for information theoretic learning
• A Reproducing Kernel Hilbert Space Framework for Information-Theoretic Learning
• Information theoretic learning. Renyi's entropy and kernel perspectives
• On the Combination of Information-Theoretic Kernels with Generative Embeddings
• Radius selection using kernel density estimation for the computation of nonlinear measures
• The C-loss function for pattern classification
• Regularized discriminant entropy analysis

This page was built for publication: Information theoretic learning with adaptive kernels

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