IRIS Institutional Research Information System - AIR Archivio Istituzionale della Ricerca

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2017/2018245 0000 00 00 0015689
2018/20191345 36713310449 16157 18356 97563790
2019/20201398 1423313880 124101 17978 20714310568
2020/20211063 98667713 13792 4841 9811624334
2021/20221078 65692967 7574 12351 658282296
2022/20231488 176100129138 187293 3488 23052610
Totale 10474