CESA BIANCHI, NICOLO' ANTONIO
 Distribuzione geografica
Continente #
EU - Europa 4.633
NA - Nord America 3.646
AS - Asia 2.305
SA - Sud America 52
Continente sconosciuto - Info sul continente non disponibili 21
AF - Africa 18
OC - Oceania 12
Totale 10.687
Nazione #
US - Stati Uniti d'America 3.617
GB - Regno Unito 2.033
CN - Cina 1.574
IT - Italia 953
SE - Svezia 371
DE - Germania 270
IE - Irlanda 170
UA - Ucraina 161
KR - Corea 159
IN - India 154
FR - Francia 144
SG - Singapore 140
RU - Federazione Russa 129
TR - Turchia 113
FI - Finlandia 94
PL - Polonia 94
NL - Olanda 77
EU - Europa 68
ID - Indonesia 66
CO - Colombia 43
DK - Danimarca 43
HK - Hong Kong 30
JP - Giappone 29
BE - Belgio 26
CA - Canada 24
CH - Svizzera 19
ES - Italia 11
IL - Israele 10
VN - Vietnam 10
AT - Austria 8
TW - Taiwan 8
IR - Iran 7
NZ - Nuova Zelanda 7
BW - Botswana 6
AU - Australia 5
BG - Bulgaria 5
BR - Brasile 5
GR - Grecia 5
PT - Portogallo 5
SC - Seychelles 5
DM - Dominica 3
DZ - Algeria 3
HU - Ungheria 3
NO - Norvegia 3
RO - Romania 3
CL - Cile 2
CM - Camerun 2
MY - Malesia 2
PE - Perù 2
LI - Liechtenstein 1
LT - Lituania 1
LU - Lussemburgo 1
MX - Messico 1
NG - Nigeria 1
NI - Nicaragua 1
PS - Palestinian Territory 1
RS - Serbia 1
SA - Arabia Saudita 1
SI - Slovenia 1
SK - Slovacchia (Repubblica Slovacca) 1
TH - Thailandia 1
ZA - Sudafrica 1
Totale 10.734
Città #
Southend 1.940
Hangzhou 717
Brooklyn 381
Milan 305
Chandler 292
Seattle 265
Beijing 259
Ashburn 238
Princeton 231
Wilmington 228
Dublin 167
Jacksonville 140
Phoenix 117
Nanjing 115
Sunnyvale 109
Ann Arbor 99
Redmond 93
Mountain View 89
Fairfield 87
Des Moines 79
Medford 72
Singapore 69
Bengaluru 67
Serra 62
Dearborn 55
Redwood City 55
Andover 50
Sakarya 50
Cambridge 49
Woodbridge 48
Somerville 46
Gdansk 44
Warsaw 44
Bogotá 42
Jakarta 42
Houston 40
Boardman 39
Shenyang 37
Hebei 33
Berlin 31
Shanghai 31
Nanchang 30
Jinan 27
Los Angeles 26
Guangzhou 25
Philadelphia 24
Brussels 22
Daejeon 21
Changsha 18
Mcallen 18
Kunming 17
New York 16
Tianjin 15
Eitensheim 14
Pune 14
Washington 13
Hamburg 12
San Diego 12
Wuhan 11
Zhengzhou 11
Central District 10
Helsinki 10
Rome 10
Bühl 9
Chicago 9
Florence 9
Lanzhou 9
Seoul 9
Falls Church 8
Ningbo 8
San Martino in Strada 8
Taipei 8
Taizhou 8
Auburn Hills 7
Bitonto 7
Fremont 7
London 7
Norwalk 7
Pittsburgh 7
Saint Petersburg 7
Trento 7
Turin 7
Bergamo 6
Hefei 6
Ithaca 6
Jiaxing 6
Mumbai 6
Nuremberg 6
Odernheim 6
Trieste 6
Amsterdam 5
Boston 5
Cormano 5
Dong Ket 5
Kowloon 5
Kwai Chung 5
Mahé 5
Monza 5
Monção 5
Paris 5
Totale 7.579
Nome #
Regret analysis of stochastic and nonstochastic multi-armed bandit problems 405
Prediction, Learning, and Games 382
A correlation clustering approach to link classification in signed networks 360
Linear Algorithms for Online Multitask Classification 327
Action editor di Machine Learning 282
Better algorithms for selective sampling 257
Active Incremental Recognition of Human Activities in a Streaming Context 207
Tracking the Best Hyperplane with a Simple Budget Perceptron 196
Fast and optimal prediction on a labeled tree 194
Multitask Protein Function Prediction Through Task Dissimilarity 181
Multi-armed Bandit Problem 174
A second-order Perceptron algorithm 165
Functional inference in FunCat through the combination of hierarchical ensembles with data fusion methods 161
Towards Highly Adaptive Services for Mobile Computing 145
Responsabile scientifico unità di ricerca di Pattern Analysis, Statistical Modelling and Computational Learning 132
Towards minimax policies for online linear optimization with bandit feedback 130
Incremental Algorithms for Hierarchical Classification 127
Worst-Case Analysis of Selective Sampling for Linear Classification 127
Combinatorial bandits 127
Minimizing Regret with Label Efficient Prediction 126
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback 116
PAC-Bayes-Bernstein inequality for martingales and its application to multiarmed bandits 115
Worst-case analysis of selective sampling for linear-threshold algorithms 114
A distributed architecture for management and retrieval of extended points of interest 113
Online graph prediction with random trees 112
Presidente di Association for Computational Learning 111
Synergy of multi-label hierarchical ensembles, data fusion, and cost-sensitive methods for gene functional inference 111
Genome-­wide hierarchical classification of gene function 109
Cooperative Online Learning: Keeping your Neighbors Updated 108
Incremental algorithms for hierarchical classification 107
A distributed voting scheme to maximize preferences 107
Improved second-order bounds for prediction with expert advice 105
On the generalization ability of on-line learning algorithms 105
Regret minimization for branching experts 105
Action Editor di Machine Learning 103
HCGene: a software tool to support the hierarchical classification of genes 102
Improved second-order bounds for prediction with expert advice 100
Foreword 100
A gang of bandits 100
Responsabile scientifico unità di ricerca di Statistical Multilingual Analysis for Retrieval and Translation 99
OM-2 : an online multi-class multi-kernel learning algorithm 98
Applications of regularized least squares to classification problems 97
Active learning on trees and graphs 96
Associate editor IEEE Transactions on Information Theory 96
Regret minimization under partial monitoring 95
Hierarchical cost-sensitive algorithms for genome-wide gene function prediction 95
Delay and Cooperation in Nonstochastic Bandits 95
Dynamic Pricing with Finitely Many Unknown Valuations 94
Hierarchical cost-sensitive algorithms for genome-wide gene function prediction 92
Online Learning Algorithms 91
Hierarchical Classification: Combining Bayes with SVM 90
Learning noisy linear classifiers via adaptive and selective sampling 88
Efficient Linear Bandits through Matrix Sketching 88
Improved risk tail bounds for on-line algorithms 86
Linear Classification and Selective Sampling Under Low Noise Conditions 86
Quantity makes quality: learning with partial views 85
The ABACOC algorithm: a novel approach for nonparametric classification of data streams 85
Distribution-Dependent Analysis of Gibbs-ERM Principle 85
Combinatorial bandits 84
From bandits to experts : a tale of domination and independence 84
Random spanning trees and the prediction of weighted graphs 83
Random spanning trees and the prediction of weighted graphs 83
Online learning of noisy data with kernels 82
Linear algorithms for online multitask classification 82
Bandit Regret Scaling with the Effective Loss Range 81
Efficient learning with partially observed attributes 79
Efficient second order online learning by sketching 79
Online action recognition via nonparametric incremental learning 78
Regret minimization for reserve prices in second-price auctions 76
Delay and cooperation in nonstochastic bandits 75
Online learning with feedback graphs : beyond bandits 72
On the complexity of learning with kernels 72
Improved risk tail bounds for on-Line algorithms 71
Predicting the labels of an unknown graph via adaptive exploration 70
Online learning with switching costs and other adaptive adversaries 70
A linear time active learning algorithm for link classification 69
A generalized online mirror descent with applications to classification and regression 69
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning 69
Advances in Neural Information Processing Systems 31 69
Nonstochastic Bandits with Composite Anonymous Feedback 66
Guest Editorial: Learning from multiple sources 66
Mirror descent meets fixed share (and feels no regret) 65
Efficient learning with partially observed attributes 65
Splitting with confidence in decision trees with application to stream mining 65
See the tree through the lines : the Shazoo algorithm 64
A Regret Analysis of Bilateral Trade 64
Online learning of noisy data 62
Beyond logarithmic bounds in online learning 60
On the troll-trust model for edge sign prediction in social networks 59
Correlation Clustering with Adaptive Similarity Queries 59
PAC-Bayesian Inequalities for Martingales 57
Confidence decision trees via online and active learning for streaming data 56
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs 56
Efficient online learning via randomized rounding 55
Nonstochastic Bandits with Composite Anonymous Feedback 55
Bandits with heavy tail 53
Nonstochastic Multiarmed Bandits with Unrestricted Delays 53
Stochastic Bandits with Delay-Dependent Payoffs 53
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries 53
Regret minimization for reserve prices in second-price auctions 51
Totale 10.823
Categoria #
all - tutte 27.877
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 27.877


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/201990 0 0 0 0 0 0 0 0 0 0 0 90
2019/20201.398 142 33 138 80 124 101 179 78 207 143 105 68
2020/20211.063 98 66 77 13 137 92 48 41 98 116 243 34
2021/20221.078 65 69 29 67 75 74 123 51 65 82 82 296
2022/20231.516 176 100 129 138 187 293 32 88 227 48 81 17
2023/2024944 25 84 37 24 118 211 41 33 47 65 118 141
Totale 11.446