GENTILE, CLAUDIO
 Distribuzione geografica
Continente #
NA - Nord America 3.432
EU - Europa 2.806
AS - Asia 606
SA - Sud America 8
Continente sconosciuto - Info sul continente non disponibili 3
AF - Africa 1
Totale 6.856
Nazione #
US - Stati Uniti d'America 3.431
IT - Italia 1.574
UA - Ucraina 578
TR - Turchia 213
SE - Svezia 201
VN - Vietnam 182
FI - Finlandia 141
CN - Cina 130
IE - Irlanda 117
DE - Germania 89
GB - Regno Unito 64
SG - Singapore 52
IN - India 27
FR - Francia 21
BE - Belgio 12
BR - Brasile 8
EU - Europa 3
NL - Olanda 3
RO - Romania 2
DK - Danimarca 1
GR - Grecia 1
HR - Croazia 1
HU - Ungheria 1
JP - Giappone 1
PA - Panama 1
PH - Filippine 1
ZA - Sudafrica 1
Totale 6.856
Città #
Milan 1.208
Fairfield 452
Jacksonville 442
Woodbridge 331
Houston 256
Ashburn 223
Wilmington 206
Ann Arbor 202
Chandler 192
Seattle 169
Princeton 146
Cambridge 144
Izmir 132
Dublin 117
Nyköping 111
Rome 92
Dong Ket 83
Dearborn 81
Boardman 78
Beijing 52
San Mateo 52
Singapore 41
Como 36
San Diego 32
Ogden 20
Santa Clara 16
Chicago 14
Brussels 12
Hefei 12
Verona 11
Washington 11
Düsseldorf 10
Nanjing 9
Kunming 8
New York 7
Norwalk 7
Auburn Hills 6
Chengdu 6
Helsinki 6
London 6
Bangalore 5
Los Angeles 5
Guangzhou 4
Kilburn 4
Baotou 3
Fuzhou 3
Ho Chi Minh City 3
Nanchang 3
Shenyang 3
Wuhan 3
Bollate 2
Changsha 2
Dallas 2
Espoo 2
Hebei 2
Jinan 2
Nanning 2
Philadelphia 2
Phoenix 2
Pieve a Nievole 2
Quzhou 2
Redmond 2
Sete Lagoas 2
Timisoara 2
Zhengzhou 2
Acton 1
Amsterdam 1
Athens 1
Bitonto 1
Bologna 1
Budapest 1
Cape Town 1
Catania 1
Changping 1
Chaoyang 1
Chiswick 1
Copenhagen 1
Edinburgh 1
Fremont 1
Harbin 1
Indiana 1
Itaguaí 1
Jiaxing 1
Maasbommel 1
Manila 1
Maringá 1
Nuremberg 1
Panama City 1
Portland 1
Pune 1
Redwood City 1
Ribeirão Preto 1
Rio de Janeiro 1
Rocca Massima 1
Sandston 1
Seriate 1
Shaoxing 1
Shenzhen 1
Southwark 1
São Paulo 1
Totale 5.140
Nome #
Regret minimization for reserve prices in second-price auctions 161
P-sufficient statistics for PAC learning k-term-DNF formulas through enumeration 152
Multiclass classification with bandit feedback using adaptive regularization 149
Sample size lower bounds in PAC learning by algorithmic complexity theory 145
On multilabel classification and ranking with bandit feedback 140
An Evaluation of Function Point Counting Based on Measurement-Oriented Models 132
Collaborative Filtering Bandits 130
The robustness of the p-norm algorithms 129
Multiclass classification with bandit feedback using adaptive regularization 129
A second-order Perceptron algorithm 128
Identification of mobile phones using the built-in magnetometers stimulated by motion patterns 128
Adaptive and self-confident on-line learning algorithms 127
Learning Noisy Linear Classifiers via Adaptive and Selective Sampling 125
Measures to address the lack of portability of the RF fingerprints for radiometric identification 125
A second-order perceptron algorithm 120
Learning probabilistic linear-threshold classifiers via selective sampling 117
Robust bounds for classification via selective sampling 115
Tracking the best hyperplane with a simple budget perceptron 113
Regret Minimization for Reserve Prices in Second-Price Auctions 112
Improved lower bounds for learning from noisy examples: an information-theoretic approach 111
Predicting the labels of an unknown graph via adaptive exploration 111
Tracking the best hyperplane with a simple budget perceptron 110
Improved risk tail bounds for on-line algorithms 108
Fast and optimal prediction of a labeled tree 108
On the generalization ability of on-line learning algorithms 108
Online Similarity Prediction of Networked Data from Known and Unknown Graphs 108
Improved lower bounds for learning from noisy examples: an information-theoretic approach 106
Adaptive and self-confident on-line learning algorithms 105
Improved risk tail bounds for on-line algorithms 103
Algorithmic learning theory: 26th international conference, ALT 2015 Banff, AB, Canada, october 4-6, 2015 proceedings 103
Comparison of techniques for radiometric identification based on deep convolutional neural networks 103
The robustness of the p-norm algorithms 102
Regret bounds for hierarchical classification with linear-threshold functions 100
On the generalization ability of on-line learning algorithms 98
Selective sampling and active learning from single and multiple teachers 92
Online Clustering of Bandits 92
Machine Learning, special issue on Colt 2007 91
From Bandits to Experts: A Tale of Domination and Independence 91
Incremental algorithms for hierarchical classification 88
Nonstochastic multi-armed bandits with graph-structured feedback 86
null 84
20th Conference on Learning Theory 84
A new approximate maximal margin clasification algorithm 80
Worst-Case Analysis of Selective sampling for linear-threshold algorithms 80
Kernel Methods for Document Filtering 79
Machine Learning, special issue on Colt 2001 74
Delay and Cooperation in Nonstochastic Bandits 74
Active learning on trees and graphs 73
A Correlation clustering approach to link classification in signed networks 71
Hierarchical classification: combining Bayes with SVM 70
Incremental algorithms for hierarchical classification 70
Random spanning trees and the prediction of weighted graphs 69
Rete d'Eccellenza PASCAL 68
Linear algorithms for online multitask classification 68
Worst-case analysis of selective sampling for linear-threshold algorithms 68
Algorithmic chaining and the role of partial feedback in online nonparametric learning. 67
Fast feature selection from microarray expression data via multiplicative large margin algorithms 65
On Context-Dependent Clustering of Bandits. 65
A new approximate maximal margin clasification algorithm 64
Margin-based algorithms for information filtering 63
A linear time active learning algorithm for link classification 62
Linear classification and selective sampling under low noise conditions 61
Regret Minimization for Branching Experts 61
Beyond logarithmic bounds in online learning 60
Linear algorithms for online multitask classification 60
Kernel methods for document filtering 59
Linear hinge loss and average margin 58
Random spanning trees and the prediction of weighted graphs 56
Learning unknown graphs 56
Robust Selective Sampling from Single and Multiple Teachers 56
On multilabel classification and ranking with partial feedback 56
See the tree through the lines: the Shazoo algorithm 55
On higher-order Perceptron algorithms 55
A gang of Bandits 53
Online graph prediction with random trees 36
Totale 6.881
Categoria #
all - tutte 24.195
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 24.195


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020857 0 0 0 0 70 117 162 171 97 115 32 93
2020/20211.047 19 100 51 98 48 135 42 90 169 34 93 168
2021/2022578 73 67 54 11 15 25 23 46 23 97 54 90
2022/2023650 77 0 43 51 48 179 0 91 104 20 10 27
2023/20241.704 302 286 327 308 319 103 6 9 35 4 1 4
2024/2025199 0 2 163 13 21 0 0 0 0 0 0 0
Totale 6.881