Nonextensive information theoretic kernels on measures
zbMATH Open1235.68174MaRDI QIDQ2880916FDOQ2880916
Authors: André F. T. Martins, Noah A. Smith, Eric P. Xing, Pedro M. Q. Aguiar, Mário A. T. Figueiredo
Publication date: 17 April 2012
Published in: Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)
Full work available at URL: http://www.jmlr.org/papers/v10/martins09a.html
Recommendations
Jensen-Shannon divergenceTsallis entropypositive definite kernelsstring kernelsnonextensive information theory
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Measures of information, entropy (94A17)
Cited In (11)
- Graph similarity through entropic manifold alignment
- Graph ambiguity
- Title not available (Why is that?)
- The Cauchy--Schwarz divergence and Parzen windowing: Connections to graph theory and Mercer kernels
- Information theoretic measures in one-dimensional Dunkl oscillator
- Depth-based complexity traces of graphs
- A quantum Jensen-Shannon graph kernel for unattributed graphs
- Deformed statistics Kullback-Leibler divergence minimization within a scaled Bregman framework
- Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels
- Optimal guessing under nonextensive framework and associated moment bounds
- Graph kernels from the Jensen-Shannon divergence
This page was built for publication: Nonextensive information theoretic kernels on measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880916)