Designing Labeled Graph Classifiers by Exploiting the Rényi Entropy of the Dissimilarity Representation

Author： Livi Lorenzo  

Publisher： MDPI

E-ISSN： 1099-4300|19|5|216-216

ISSN： 1099-4300

Source： Entropy, Vol.19, Iss.5, 2017-05, pp. : 216-216

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

One-Parameter Fisher–Rényi Complexity: Notion and Hydrogenic Applications

By Toranzo Irene V.   Sánchez-Moreno Pablo   Rudnicki Łukasz   Dehesa Jesús S.  

Entropy, Vol. 19, Iss. 1, 2016-12 ,pp. : 16-16

MDPI

Access to resources Recommend Favorite

Some Remarks on Classical and Classical-Quantum Sphere Packing Bounds: Rényi vs. Kullback–Leibler †

By Dalai Marco  

Entropy, Vol. 19, Iss. 7, 2017-07 ,pp. : 355-355

MDPI

Access to resources Recommend Favorite

Quantum Probabilities and Maximum Entropy

By Schlatter Andreas  

Entropy, Vol. 19, Iss. 7, 2017-06 ,pp. : 304-304

MDPI

Access to resources Recommend Favorite

Entropy Analysis of Monetary Unions

By Mata Maria Eugénia   Tenreiro Machado Jose  

Entropy, Vol. 19, Iss. 6, 2017-05 ,pp. : 245-245

MDPI

Access to resources Recommend Favorite

On Interrelation of Time and Entropy

By Martyushev Leonid M.  

Entropy, Vol. 19, Iss. 7, 2017-07 ,pp. : 345-345

MDPI

Access to resources Recommend Favorite