Results 111 to 120 of about 248 (141)

A Quantitative Measurement Method for Nuclear-Pleomorphism Scoring in Breast Cancer. [PDF]

Diagnostics (Basel)
Teoh CL, Tan XJ, Ab Rahman KS, Bakrin IH, Goh KM, Siet JJW, Wan Muhamad WZA.   +6 more
europepmc   +1 more source

Information Theory Meets Quantum Chemistry: A Review and Perspective. [PDF]

Entropy (Basel)
Zhao Y, Zhao D, Rong C, Liu S, Ayers PW.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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.
Frank Nielsen, Richard Nock
exaly   +3 more sources

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.
Raúl Santos-Rodríguez, Jesus Cid-Sueiro   +1 more
exaly   +4 more sources

Extending Sammon mapping with Bregman divergences

Information Sciences, 2012
The Sammon mapping has been one of the most successful nonlinear metric multidimensional scaling methods since its advent in 1969, but effort has been focused on algorithm improvement rather than on the form of the stress function. This paper further investigates using left Bregman divergences to extend the Sammon mapping and by analogy develops right ...
Malcolm Crowe, Colin Fyfe
exaly   +2 more sources

Bregman divergences in the -partitioning problem

Computational Statistics and Data Analysis, 2006
A method of fixed cardinality partition is examined. This methodology can be applied on many problems, such as the confidentiality protection, in which the protection of confidential information has to be ensured, while preserving the information content of the data.
Dimitris Fouskakis
exaly   +2 more sources

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 0001, Srujana Merugu, Inderjit S. Dhillon, Joydeep Ghosh   +3 more
openaire   +2 more sources