The DOI matches its Crossref record; 346 of the 346 references it cites were found in a registry or an index.
Online learning: A comprehensive survey
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
Advances in neural information processing systems 7
Cios, K., & Shields, M. (1997) · Neurocomputing · doi:10.1016/s0925-2312(97)90018-7 · Cited by 22,059
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Density Estimation for Statistics and Data Analysis
Silverman, B. W. (2018) · Routledge eBooks · doi:10.1201/9781315140919 · Cited by 15,796
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
The perceptron: A probabilistic model for information storage and organization in the brain.
Rosenblatt, F. (1958) · Psychological Review · doi:10.1037/h0042519 · Cited by 12,280
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
(2010) · Cited by 8,261
An overview of statistical learning theory
Vapnik, V. N. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.788640 · Cited by 6,266
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
Large-Scale Machine Learning with Stochastic Gradient Descent
Bottou, L. (2010) · Proceedings of COMPSTAT'2010 · doi:10.1007/978-3-7908-2604-3_16 · Cited by 5,795
Proceedings of the 25th international conference on Machine learning
Cohen, W. W., McCallum, A., & Roweis, S. T. (2008) · Cited by 5,691
Fast Training of Support Vector Machines Using Sequential Minimal Optimization
Platt, J. C. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0016 · Cited by 5,437
Semi-Supervised Learning Literature Survey
Zhu, X. (2005) · Minds at UW (University of Wisconsin) · Cited by 4,506
A Learning Algorithm for Continually Running Fully Recurrent Neural Networks
Williams, R. J., & Zipser, D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.270 · Cited by 4,369
(2006) · Cited by 3,624
A Survey of Collaborative Filtering Techniques
Su, X., & Khoshgoftaar, T. M. (2009) · Advances in Artificial Intelligence · doi:10.1155/2009/421425 · Cited by 3,602
Semi-supervised learning using Gaussian fields and harmonic functions
Zhu, X., Zoubin Ghahramani, A., & Lafferty, J. (2003) · Cited by 3,509
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
Continual lifelong learning with neural networks: A review
Parisi, G. I., Kemker, R., Part, J. L., Kanan, C., & Wermter, S. (2019) · Neural Networks · doi:10.1016/j.neunet.2019.01.012 · Cited by 3,117
A Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
Advances in Neural Information Processing Systems 37
(2024) · doi:10.52202/079017 · Cited by 2,791
Random Features for Large-Scale Kernel Machines
Rahimi, A., & Recht, B. (2007) · Cited by 2,783
THOMPSON, W. R. (1933) · Biometrika · doi:10.1093/biomet/25.3-4.285 · Cited by 2,712
A contextual-bandit approach to personalized news article recommendation
Li, L., Chu, W., Langford, J., & Schapire, R. E. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772758 · Cited by 2,562
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
Asymptotically efficient adaptive allocation rules
Lai, T. L., & Robbins, H. (1985) · Advances in Applied Mathematics · doi:10.1016/0196-8858(85)90002-8 · Cited by 2,406
(2002) · doi:10.1137/s0097539701398375 · Cited by 2,275
Some aspects of the sequential design of experiments
Robbins, H. (1952) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1952-09620-8 · Cited by 2,184
Information-theoretic metric learning
Davis, J. V., Kulis, B., Jain, P., Sra, S., & Dhillon, I. S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273523 · Cited by 2,006
Knowledge acquisition via incremental conceptual clustering
Fisher, D. H. (1987) · Machine Learning · doi:10.1007/bf00114265 · Cited by 1,991
The Weighted Majority Algorithm
Littlestone, N., & Warmuth, M. K. (1994) · Information and Computation · doi:10.1006/inco.1994.1009 · Cited by 1,975
Carpenter, G. A., Grossberg, S., Markuzon, N., Reynolds, J. H., & Rosen, D. B. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.159059 · Cited by 1,975
A Fast and Accurate Online Sequential Learning Algorithm for Feedforward Networks
Liang, N.-Y., Huang, G.-B., Saratchandran, P., & Sundararajan, N. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.880583 · Cited by 1,965
Learning to rank: from pairwise approach to listwise approach
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273513 · Cited by 1,960
Introduction to Semi-Supervised Learning
Zhu, X., & Goldberg, A. B. (2009) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01548-9 · Cited by 1,766
(2003) · Cited by 1,733
Online Passive-Aggressive Algorithms
Crammer, K., Dekel, O., Keshet, J., Shalev‐Shwartz, S., & Singer, Y. (2003) · Cited by 1,665
Using the Nyström Method to Speed Up Kernel Machines
Williams, C. K. I., & Seeger, M. (2000) · Cited by 1,646
A Generalized Representer Theorem
Schölkopf, B., Herbrich, R., & Smola, A. J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_27 · Cited by 1,589
Google news personalization: scalable online collaborative filtering
Das, A. S., Datar, M., Garg, A., & Rajaram, S. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242610 · Cited by 1,511
Bandit processes and dynamic allocation indices
Gittins, J. C. (1979) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1979.tb01068.x · Cited by 1,487
Pegasos: primal estimated sub-gradient solver for SVM
Shalev-Shwartz, S., Singer, Y., Srebro, N., & Cotter, A. (2011) · Mathematical Programming · doi:10.1007/s10107-010-0420-4 · Cited by 1,477
Regularized multi--task learning
Evgeniou, T., & Pontil, M. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014067 · Cited by 1,433
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Bubeck, S. (2012) · now publishers, Inc. eBooks · doi:10.1561/9781601986276 · Cited by 1,404
A Resource-Allocating Network for Function Interpolation
Platt, J. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.213 · Cited by 1,354
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Bubeck, S., & Cesa-Bianchi, N. (2012) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000024 · Cited by 1,295
Mining concept-drifting data streams using ensemble classifiers
Wang, H., Fan, W., Yu, P. S., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956778 · Cited by 1,256
Online Learning and Online Convex Optimization
Shalev-Shwartz, S. (2012) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000018 · Cited by 1,246
Using confidence bounds for exploitation-exploration trade-offs
Auer, P. L. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944941 · Cited by 1,229
Large Scale Multiple Kernel Learning
Sonnenburg, S., Rätsch, G., Schäfer, C., & Schölkopf, B. (2006) · MPG.PuRe (Max Planck Society) · doi:10.5555/1248547.1248604 · Cited by 1,201
IEEE Transactions on Neural Networks and Learning Systems
(2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.5962385 · Cited by 1,147
Time Series Prediction Using Support Vector Machines: A Survey
Sapankevych, N., & Sankar, R. (2009) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2009.932254 · Cited by 1,129
The Tradeoffs of Large-Scale Learning
Bottou, L., & Bousquet, O. (2011) · Optimization for Machine Learning · doi:10.7551/mitpress/8996.003.0015 · Cited by 1,128
Caruana, R. (1998) · Cited by 1,110
Selective Sampling Using the Query by Committee Algorithm
Freund, Y., Seung, H. S., Shamir, E., & Tishby, N. (1997) · Machine Learning · doi:10.1023/a:1007330508534 · Cited by 1,097
Online Learning and Online Convex Optimization
Shalev-Shwartz, S. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985477 · Cited by 1,095
Large margin classification using the perceptron algorithm
Freund, Y., & Schapire, R. E. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279985 · Cited by 1,071
Chatfield, C. (2000) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420036206 · Cited by 1,040
Density-Based Clustering over an Evolving Data Stream with Noise
Cao, F., Estert, M., Qian, W., & Zhou, A. (2006) · Proceedings of the 2006 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972764.29 · Cited by 1,016
Kivinen, J., Smola, A. J., & Williamson, R. C. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.830991 · Cited by 1,004
Outlier Detection for Temporal Data: A Survey
Gupta, M., Gao, J., Aggarwal, C. C., & Han, J. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.184 · Cited by 1,001
(2011) · Cited by 1,000
Multi-Armed Bandit Allocation Indices.
Bather, J. A., & Gittins, J. C. (1990) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2982809 · Cited by 998
Carpenter, G. A., Grossberg, S., & Reynolds, J. H. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90012-t · Cited by 980
Incremental Learning of Concept Drift in Nonstationary Environments
Elwell, R., & Polikar, R. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2011.2160459 · Cited by 931
Improved Algorithms for Linear Stochastic Bandits
Abbasi-Yadkori, Y., Pál, D., & Szepesvári, C. (2011) · Cited by 919
LeCun, Y., Bottou, L., Orr, G. B., & Müller, K. R. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49430-8_2 · Cited by 919
Online Passive-Aggressive Algorithms
CrammerKoby, DekelOfer, KeshetJoseph, Shalev-ShwartzShai, & SingerYoram (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248566 · Cited by 894
Learn++: an incremental learning algorithm for supervised neural networks
Polikar, R., Upda, L., Upda, S. S., & Honavar, V. (2001) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/5326.983933 · Cited by 888
Clustering data streams: theory and practice
Guha, S., Meyerson, A., Mishra, N., Motwani, R., & O'Callaghan, L. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1198387 · Cited by 882
A survey of multi-view machine learning
Sun, S. (2013) · Neural Computing and Applications · doi:10.1007/s00521-013-1362-6 · Cited by 878
Forecasting Economic Time Series
Clements, M., & Hendry, D. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511599286 · Cited by 857
Primal-dual subgradient methods for convex problems
Nesterov, Y. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0149-x · Cited by 835
Logarithmic regret algorithms for online convex optimization
Hazan, E., Agarwal, A., & Kale, S. (2007) · Machine Learning · doi:10.1007/s10994-007-5016-8 · Cited by 828
Analysis of Thompson Sampling for the multi-armed bandit problem
Agrawal, S., & Goyal, N. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1111.1797 · Cited by 819
Introduction to Online Convex Optimization
Hazan, E. (2016) · now publishers, Inc. eBooks · doi:10.1561/9781680831719 · Cited by 813
Deep Learning for Content-Based Image Retrieval: A Comprehensive Study
Wan, J., Wang, D., Hoi, S. C. H., Wu, P., Zhu, J., Zhang, Y., & Li, J. (2014) · Proceedings of the 22nd ACM international conference on Multimedia · doi:10.1145/2647868.2654948 · Cited by 811
Self-citationShi, Y., Larson, M., & Hanjalic, A. (2014) · ACM Computing Surveys · doi:10.1145/2556270 · Cited by 806
Michalski, R. S., Mozetič, I., Hong, J., & Nada Lavrač, A. (1986) · National Conference on Artificial Intelligence · Cited by 747
Introduction to Online Convex Optimization
Hazan, E. (2016) · Foundations and Trends in Optimization · doi:10.1561/2400000013 · Cited by 747
Gambling in a rigged casino: The adversarial multi-armed bandit problem
Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492488 · Cited by 742
Efficient Online and Batch Learning Using Forward Backward Splitting
Duchi, J. C., & Singer, Y. (2009) · Journal of Machine Learning Research · Cited by 687
Multi‐Armed Bandit Allocation Indices
Gittins, J., Glazebrook, K., & Weber, R. (2011) · Wiley eBooks · doi:10.1002/9780470980033 · Cited by 684
Machine Learning for Sequential Data: A Review
Dietterich, T. G. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-70659-3_2 · Cited by 666
Contextual Bandits with Linear Payoff Functions
Chu, W., Li, L. C., Reyzin, L., & Schapire, R. E. (2011) · Cited by 633
DATA CLUSTERING: Algorithms and Applications
Aggarwal, C. C. (2013) · Chapman & Hall/CRC eBooks · doi:10.1201/b15410 · Cited by 624
Guha, S., Mishra, N., Motwani, R., & O'Callaghan, L. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892124 · Cited by 623
Large Margin Classification Using the Perceptron Algorithm
Freund, Y., & Schapire, R. E. (1999) · Machine Learning · doi:10.1023/a:1007662407062 · Cited by 604
Thompson Sampling for Contextual Bandits with Linear Payoffs
Agrawal, S., & Goyal, N. (2012) · arXiv · doi:10.48550/arxiv.1209.3352 · Cited by 600
Efficient algorithms for online decision problems
Kalai, A., & Vempala, S. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2004.10.016 · Cited by 591
Caruana, R. (1998) · Learning to Learn · doi:10.1007/978-1-4615-5529-2_5 · Cited by 577
Streaming-data algorithms for high-quality clustering
O'Callaghan, L., Mishra, N., Meyerson, A., Guha, S., & Motwani, R. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994785 · Cited by 577
Dual Averaging Method for Regularized Stochastic Learning and Online Optimization
Xiao, L. (2009) · Cited by 574
Density-based clustering for real-time stream data
Chen, Y., & Tu, L. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281210 · Cited by 572
Exploration–exploitation tradeoff using variance estimates in multi-armed bandits
Audibert, J.-Y., Munos, R., & Szepesvári, C. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.01.016 · Cited by 569
Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing
Lapata, M., & Ng, H. T. (2008) · Cited by 567
On-line Learning and Stochastic Approximations
Bottou, L. (1999) · On-Line Learning in Neural Networks · doi:10.1017/cbo9780511569920.003 · Cited by 564
The Relaxation Method for Linear Inequalities
Agmon, S. (1954) · Canadian Journal of Mathematics · doi:10.4153/cjm-1954-037-2 · Cited by 549
Crammer, K., & Singer, Y. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0087 · Cited by 538
(2007) · The MIT Press eBooks · doi:10.7551/mitpress/7443.001.0001 · Cited by 525
A Framework for Projected Clustering of High Dimensional Data Streams
Aggarwal, C. C., Han, J., Wang, J., & Yu, P. S. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50075-9 · Cited by 519
Adaptive Game Playing Using Multiplicative Weights
Freund, Y., & Schapire, R. E. (1999) · Games and Economic Behavior · doi:10.1006/game.1999.0738 · Cited by 515
Multi-armed Bandit Algorithms and Empirical Evaluation
Vermorel, J., & Mohri, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564096_42 · Cited by 513
Optimal Distributed Online Prediction using Mini-Batches
Dekel, O., Gilad-Bachrach, R., Shamir, O., & Xiao, L. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.1367 · Cited by 512
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Littlestone, N. (1988) · Machine Learning · doi:10.1007/bf00116827 · Cited by 497
Multivariate Density Estimation: Theory, Practice, and Visualization.
Weiss, R., & Scott, D. W. (1994) · Journal of the American Statistical Association · doi:10.2307/2291242 · Cited by 495
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence
Ma, W., Luo, X., & Liu, W. (2014) · National Conference on Artificial Intelligence · Cited by 477
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
Chang, Y.-W., Hsieh, C., Chang, K., Ringgaard, M., & Lin, C. (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1859899 · Cited by 472
Twenty-Ninth AAAI Conference on Artificial Intelligence
Albrecht, S. V., Crandall, J. W., & Ramamoorthy, R. (2015) · National Conference on Artificial Intelligence · Cited by 464
Support vector learning for ordinal regression
Herbrich, R. (1999) · 9th International Conference on Artificial Neural Networks: ICANN '99 · doi:10.1049/cp:19991091 · Cited by 448
The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information
Langford, J. C., & Zhang, T. (2007) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 446
Linearly Parameterized Bandits
Rusmevichientong, P., & Tsitsiklis, J. N. (2010) · Mathematics of Operations Research · doi:10.1287/moor.1100.0446 · Cited by 427
On the Generalization Ability of On-Line Learning Algorithms
Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.833339 · Cited by 426
Online Learning: Theory, Algorithms, and Applications
Shalev‐Shwartz, S. (2007) · Cited by 418
Learning algorithms with optimal stability in neural networks
Krauth, W., & Mezard, M. (1987) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/20/11/013 · Cited by 415
A modern Bayesian look at the multi‐armed bandit
Scott, S. L. (2010) · Applied Stochastic Models in Business and Industry · doi:10.1002/asmb.874 · Cited by 406
On‐Line Portfolio Selection Using Multiplicative Updates
Helmbold, D. P., Schapire, R. E., Singer, Y., & Warmuth, M. K. (1998) · Mathematical Finance · doi:10.1111/1467-9965.00058 · Cited by 387
Confidence-weighted linear classification
Dredze, M., Crammer, K., & Pereira, F. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390190 · Cited by 375
Online Choice of Active Learning Algorithms
Baram, Y., El‐Yaniv, R., & Luz, K. (2003) · International Conference on Machine Learning · Cited by 369
D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
Mota, J. F. C., Xavier, J. M. F., Aguiar, P. M. Q., & Puschel, M. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2254478 · Cited by 363
(1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0029561 · Cited by 361
A Short Introduction to Learning to Rank
LI, H. (2011) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.e94.d.1854 · Cited by 348
Adaptive regularization of weight vectors
Crammer, K., Kulesza, A., & Dredze, M. (2013) · Machine Learning · doi:10.1007/s10994-013-5327-x · Cited by 337
Proceedings of the 19th International Conference on Extending Database Technology, EDBT
Pitoura, E., Maabout, S., Koutrika, G., et al. (2016) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 337
The Multi-Armed Bandit Problem: Decomposition and Computation
Katehakis, M. N., & Veinott, A. F. (1987) · Mathematics of Operations Research · doi:10.1287/moor.12.2.262 · Cited by 333
Two view learning: SVM-2K, Theory and Practice
Farquhar, J. D. R., Hardoon, D. R., Meng, H., Shawe-Taylor, J. S., & Szedmák, S. (2005) · Brunel University Research Archive (BURA) (Brunel University London) · Cited by 325
Online Deep Learning: Learning Deep Neural Networks on the Fly
Sahoo, D., Pham, Q., Lu, J., & Hoi, S. C. H. (2018) · Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/369 · Cited by 323
Self-citationCesa-Bianchi, N., & Lugosi, G. (2012) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2012.01.001 · Cited by 319
Proceedings of the 2020 SIAM International Conference on Data Mining
(2020) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611976236 · Cited by 312
Online and batch learning of pseudo-metrics
Shalev-Shwartz, S., Singer, Y., & Ng, A. Y. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015376 · Cited by 301
StreamKM++: A clustering algorithm for data streams
Ackermann, M. R., Märtens, M., Raupach, C., Swierkot, K., Lammersen, C., & Sohler, C. (2012) · ACM Journal of Experimental Algorithmics · doi:10.1145/2133803.2184450 · Cited by 294
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
Kleinberg, R. (2004) · Cited by 294
Incremental nonlinear dimensionality reduction by manifold learning
Law, M. H. C., & Jain, A. K. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.56 · Cited by 284
Online Feature Selection and Its Applications
Wang, J., Zhao, P., Hoi, S. C. H., & Jin, R. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.32 · Cited by 275
Self-citationDimension Reduction: A Guided Tour
Burges, C. J. C. (2009) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000002 · Cited by 271
ELLA: An Efficient Lifelong Learning Algorithm
Ruvolo, P., & Eaton, E. (2013) · Cited by 267
Fast Anomaly Detection for Streaming Data
Tan, S. C., Ting, K. M., & Liu, F. T. (2011) · International Joint Conference on Artificial Intelligence · doi:10.5591/978-1-57735-516-8/ijcai11-254 · Cited by 261
A New Approximate Maximal Margin Classification Algorithm
Gentile, C. (2000) · neural information processing systems · Cited by 260
Albers, S. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0436-0 · Cited by 259
Efficient algorithms for ranking with SVMs
Chapelle, O., & Keerthi, S. S. (2010) · Information Retrieval · doi:10.1007/s10791-009-9109-9 · Cited by 250
Detecting distance-based outliers in streams of data
Angiulli, F., & Fassetti, F. (2007) · Proceedings of the sixteenth ACM conference on Conference on information and knowledge management · doi:10.1145/1321440.1321552 · Cited by 243
Online portfolio selection: A survey
Li, B., & Hoi, S. C. H. (2014) · ACM Computing Surveys · doi:10.1145/2512962 · Cited by 241
Self-citationStochastic Methods for l 1 -regularized Loss Minimization
Shalev-ShwartzShai, & TewariAmbuj (2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2021059 · Cited by 240
Can We Learn to Beat the Best Stock
Borodin, A., El-Yaniv, R., & Gogan, V. (2004) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1336 · Cited by 237
PAMR: Passive aggressive mean reversion strategy for portfolio selection
Li, B., Zhao, P., Hoi, S. C. H., & Gopalkrishnan, V. (2012) · Machine Learning · doi:10.1007/s10994-012-5281-z · Cited by 233
Self-citationAlgorithms for portfolio management based on the Newton method
Agarwal, A., Hazan, E., Kale, S., & Schapire, R. E. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143846 · Cited by 230
The Relaxed Online Maximum Margin Algorithm
Li, Y., & Long, P. M. (2002) · Machine Learning · doi:10.1023/a:1012435301888 · Cited by 225
Additive versus exponentiated gradient updates for linear prediction
Kivinen, J., & Warmuth, M. K. (1995) · Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 · doi:10.1145/225058.225121 · Cited by 223
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered ArmsPreprint
CHENWei, WangYajun, YuanYang, & WangQinshi (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.8339 · Cited by 223
Composite objective mirror descent
Duchi, J. C., Shalev‐Shwartz, S., Singer, Y., & Tewari, A. (2010) · Cited by 221
Bottou, L. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28650-9_7 · Cited by 219
Proceedings of the 24th Annual International Conference on Machine Learning (ICML 2007)
Jaeger, M. (2007) · Cited by 218
Training Connectionist Networks with Queries and Selective Sampling
Atlas, L., Cohn, D. A., & Ladner, R. E. (1989) · neural information processing systems · Cited by 217
Bubeck, S., Munos, R., Stoltz, G., & Szepesvári, C. (2011) · Journal of Machine Learning Research · Cited by 214
Optimistic bayesian sampling in contextual-bandit problems
May, B. C., Korda, N., Lee, A., & Leslie, D. S. (2012) · Lancaster EPrints (Lancaster University) · doi:10.82444/warw.33678499 · Cited by 213
On Bayesian Upper Confidence Bounds for Bandit Problems
Kaufmann, E., Garivier, A., & Paristech, T. (2012) · Cited by 213
Interactive machine learning: letting users build classifiers
WARE, M., FRANK, E., HOLMES, G., HALL, M., & WITTEN, I. H. (2001) · International Journal of Human-Computer Studies · doi:10.1006/ijhc.2001.0499 · Cited by 207
On Density-Based Data Streams Clustering Algorithms: A Survey
Amini, A., Wah, T. Y., & Saboohi, H. (2014) · Journal of Computer Science and Technology · doi:10.1007/s11390-014-1416-y · Cited by 200
Zhao, P., Hoi, S. C. H., Wang, J., & Li, B. (2014) · Artificial Intelligence · doi:10.1016/j.artint.2014.06.003 · Cited by 199
Self-citationEfficient Online and Batch Learning Using Forward Backward Splitting
DuchiJohn, & SingerYoram (2009) · Journal of Machine Learning Research · doi:10.5555/1577069.1755882 · Cited by 199
Multivariate online kernel density estimation with Gaussian kernels
Kristan, M., Leonardis, A., & Skočaj, D. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2011.03.019 · Cited by 197
A Second-Order Perceptron Algorithm
Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539703432542 · Cited by 196
Competing in the dark: An efficient algorithm for bandit linear optimization
Abernethy, J., Hazan, E., & Rakhlin, A. (2008) · Cited by 193
Online Metric Learning and Fast Similarity Search
Jain, P., Kulis, B., Dhillon, I. S., et al. (2008) · Cited by 193
Online ARIMA Algorithms for Time Series Prediction
Liu, C., Hoi, S. C. H., Zhao, P., & Sun, J. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10257 · Cited by 191
Self-citationLIBOL: a library for online learning algorithms
Hoi, S. C. H., Wang, J., & Zhao, P. (2014) · DR-NTU (Nanyang Technological University) · Cited by 189
Self-citationSparse Online Learning via Truncated Gradient
Langford, J. C., Li, L., & Zhang, T. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0806.4686 · Cited by 184
On Kernelized Multi-armed BanditsPreprint
Chowdhury, S. R., & Gopalan, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.00445 · Cited by 184
Adaptive Online Gradient Descent
Hazan, E., Rakhlin, A., & Bartlett, P. L. (2007) · neural information processing systems · Cited by 182
Regularized Distance Metric Learning:Theory and Algorithm
Jin, R., Wang, S., & Zhou, Y. (2009) · Cited by 177
Online multimodal deep similarity learning with application to image retrieval
Wu, P., Hoi, S. C. H., Xia, H., Zhao, P., Wang, D., & Miao, C. (2013) · Proceedings of the 21st ACM international conference on Multimedia · doi:10.1145/2502081.2502112 · Cited by 172
Self-citationA primal-dual perspective of online learning algorithms
Shalev-Shwartz, S., & Singer, Y. (2007) · Machine Learning · doi:10.1007/s10994-007-5014-x · Cited by 168
Sequential Kernel Density Approximation and Its Application to Real-Time Visual Tracking
Han, B., Comaniciu, D., Zhu, Y., & Davis, L. S. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70771 · Cited by 168
Efficient bandit algorithms for online multiclass prediction
Kakade, S. M., Shalev-Shwartz, S., & Tewari, A. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390212 · Cited by 168
Some Aspects of the Sequential Design of Experiments
Robbins, H. E. (1985) · Springer eBooks · doi:10.1007/978-1-4612-5110-1_13 · Cited by 168
On-Line Algorithms in Machine Learning
Blum, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0029575 · Cited by 162
CORN: Correlation-driven nonparametric learning approach for portfolio selection
Li, B., Hoi, S. C. H., & Gopalkrishnan, V. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961193 · Cited by 162
Self-citationAlgorithms for Infinitely Many-Armed Bandits
Wang, Y., Audibert, J.-Y., & Munos, R. (2008) · Cited by 160
DroidEvolver: Self-Evolving Android Malware Detection System
Xu, K., Li, Y., Deng, R., Chen, K., & Xu, J. (2019) · 2019 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2019.00014 · Cited by 160
A Survey on Contextual Multi-armed BanditsPreprint
Zhou, L. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1508.03326 · Cited by 157
Batch-Incremental versus Instance-Incremental Learning in Dynamic and Evolving Data
Read, J., Bifet, A., Pfahringer, B., & Holmes, G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34156-4_29 · Cited by 156
Efficient anomaly monitoring over moving object trajectory streams
Bu, Y., Chen, L., Fu, A. W.-C., & Liu, D. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557043 · Cited by 154
An Extended Level Method for Efficient Multiple Kernel Learning
Xu, Z., Jin, R., King, I., et al. (2008) · Cited by 152
Proceedings of the 21st ACM international conference on Multimedia
(2013) · doi:10.1145/2502081 · Cited by 151
Moving average reversion strategy for on-line portfolio selection
Li, B., Hoi, S. C. H., Sahoo, D., & Liu, Z. (2015) · Artificial Intelligence · doi:10.1016/j.artint.2015.01.006 · Cited by 146
Self-citationFrom On-line to Batch Learning
Littlestone, N. (1989) · Elsevier eBooks · doi:10.1016/b978-0-08-094829-4.50022-2 · Cited by 146
Neighbor-based pattern detection for windows over streaming data
Yang, D., Rundensteiner, E. A., & Ward, M. O. (2009) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/1516360.1516422 · Cited by 145
Provably Optimal Algorithms for Generalized Linear Contextual BanditsPreprint
Li, L., Lu, Y., & Zhou, D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.00048 · Cited by 141
Cited by
A Survey on Deep Learning for Named Entity Recognition
Li, J., Sun, A., Han, J., & Li, C. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2981314 · Cited by 1,567
Alzubaidi, L., Bai, J., Al-Sabaawi, A., Santamaría, J., Albahri, A. S., Al-dabbagh, B. S. N., Fadhel, M. A., Manoufali, M., Zhang, J., Al-Timemy, A. H., et al. (2023) · Journal of Big Data · doi:10.1186/s40537-023-00727-2 · Cited by 907
Khan, A. A., Chaudhari, O., & Chandra, R. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122778 · Cited by 530
Deep learning: systematic review, models, challenges, and research directions
Talaei Khoei, T., Ould Slimane, H., & Kaabouch, N. (2023) · Neural Computing and Applications · doi:10.1007/s00521-023-08957-4 · Cited by 411
A comprehensive survey of loss functions and metrics in deep learning
Terven, J., Cordova-Esparza, D.-M., Romero-González, J.-A., Ramírez-Pedraza, A., & Chávez-Urbiola, E. A. (2025) · Artificial Intelligence Review · doi:10.1007/s10462-025-11198-7 · Cited by 343
Metadata
- Authors
- Hoi, S. C. H., Sahoo, D., Lu, J., & Zhao, P.
- Venue
- Neurocomputing
- Publisher
- Elsevier BV
- Published
- 2021-10
- Volume
- 459
- Pages
- 249-289
- ISSN
- 0925-2312 (ISSN-L)
- OpenAlex
- W3159243351
- Cited by
- 746
- References
- 346
- FWCI
- 40.14
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.