Results 141 to 150 of about 7,842 (187)

Crossmodal counterpoint: from music to multimedia - incongruency, cognitive dissonance, irony, and surrealism. [PDF]

Front Psychol
Spence C, Di Stefano N.
europepmc   +1 more source

Information Geometry-Based Two-Stage Track-Before-Detect Algorithm for Multi-Target Detection in Sea Clutter. [PDF]

Entropy (Basel)
Liu J, Wu H, Yang Z, Hua X, Cheng Y.
europepmc   +1 more source

Born's Rule from Contextual Relative-Entropy Minimization. [PDF]

Entropy (Basel)
Zaghi A.
europepmc   +1 more source

Achieving well-informed decision-making in drug discovery: a comprehensive calibration study using neural network-based structure-activity models. [PDF]

J Cheminform
Friesacher HR, Engkvist O, Mervin L, Moreau Y, Arany A.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Functional Bregman divergence

2008 IEEE International Symposium on Information Theory, 2008
To characterize the differences between two positive functions or two distributions, a class of distortion functions has recently been defined termed the functional Bregman divergences. The class generalizes the standard Bregman divergence defined for vectors, and includes total squared difference and relative entropy.
Bela A. Frigyik, Santosh Srivastava, Maya R. Gupta   +2 more
openaire   +1 more source

Clustering with Bregman Divergences

Proceedings of the 2004 SIAM International Conference on Data Mining, 2004
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In this paper, we propose and analyze parametric hard and soft clustering algorithms based on a large class of distortion functions known as Bregman divergences.
Arindam Banerjee, Srujana Merugu, Inderjit Dhillon, Joydeep Ghosh   +3 more
openaire   +1 more source

Cost-Sensitive Sequences of Bregman Divergences

IEEE Transactions on Neural Networks and Learning Systems, 2012
The minimization of the empirical risk based on an arbitrary Bregman divergence is known to provide posterior class probability estimates in classification problems, but the accuracy of the estimate for a given value of the true posterior depends on the specific choice of the divergence.
Santos-Rodriguez, Raúl, Cid-Sueiro, Jesús   +1 more
openaire   +3 more sources

Bregman Divergences and Surrogates for Learning

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009
Bartlett et al. (2006) recently proved that a ground condition for surrogates, classification calibration, ties up their consistent minimization to that of the classification risk, and left as an important problem the algorithmic questions about their minimization.
Richard, Nock, Frank, Nielsen
openaire   +2 more sources

Quasiconvex Jensen Divergences and Quasiconvex Bregman Divergences

2021
We first introduce the class of strictly quasiconvex and strictly quasiconcave Jensen divergences which are asymmetric distances, and study some of their properties. We then define the strictly quasiconvex Bregman divergences as the limit case of scaled and skewed quasiconvex Jensen divergences, and report a simple closed-form formula which shows that ...
Frank Nielsen, Gaëtan Hadjeres
openaire   +1 more source