ResearchTrend.AI
Designing labeled graph classifiers by exploiting the Rényi entropy of the dissimilarity representation
v1v2v3v4v5v6v7 (latest)

Designing labeled graph classifiers by exploiting the Rényi entropy of the dissimilarity representation

L. Livi
ArXiv (abs)PDFHTML

Papers citing "Designing labeled graph classifiers by exploiting the Rényi entropy of the dissimilarity representation"

2 / 2 papers shown
Title
Classifying sequences by the optimized dissimilarity space embedding approach: a case study on the solubility analysis of the E. coli proteome
Classifying sequences by the optimized dissimilarity space embedding approach: a case study on the solubility analysis of the E. coli proteome
L. Livi
A. Rizzi
Alireza Sadeghian
40
1
0
17 Aug 2014
Entropic one-class classifiers
Entropic one-class classifiers
L. Livi
Alireza Sadeghian
Witold Pedrycz
86
24
0
28 Jul 2014