Online Learning: A Comprehensive Survey

Online learning represents an important family of machine learning algorithms, in which a learner attempts to resolve an online prediction (or any type of decision-making) task by learning a model/hypothesis from a sequence of data instances one at a time. The goal of online learning is to ensure that the online learner would make a sequence of accurate predictions (or correct decisions) given the knowledge of correct answers to previous prediction or learning tasks and possibly additional information. This is in contrast to many traditional batch learning or offline machine learning algorithms that are often designed to train a model in batch from a given collection of training data instances. This survey aims to provide a comprehensive survey of the online machine learning literatures through a systematic review of basic ideas and key principles and a proper categorization of different algorithms and techniques. Generally speaking, according to the learning type and the forms of feedback information, the existing online learning works can be classified into three major categories: (i) supervised online learning where full feedback information is always available, (ii) online learning with limited feedback, and (iii) unsupervised online learning where there is no feedback available. Due to space limitation, the survey will be mainly focused on the first category, but also briefly cover some basics of the other two categories. Finally, we also discuss some open issues and attempt to shed light on potential future research directions in this field.

[1]  W. Krauth,et al.  Learning algorithms with optimal stability in neural networks , 1987 .

[2]  Tong Zhang Data Dependent Concentration Bounds for Sequential Prediction Algorithms , 2005, COLT.

[3]  Rong Jin,et al.  DUOL: A Double Updating Approach for Online Learning , 2009, NIPS.

[4]  John Langford,et al.  The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information , 2007, NIPS.

[5]  Chunyan Miao,et al.  Online multimodal deep similarity learning with application to image retrieval , 2013, ACM Multimedia.

[6]  Steven C. H. Hoi,et al.  Transaction cost optimization for online portfolio selection , 2018 .

[7]  Wei Chu,et al.  Contextual Bandits with Linear Payoff Functions , 2011, AISTATS.

[8]  Bin Li,et al.  Online multiple kernel regression , 2014, KDD.

[9]  Aditya Gopalan,et al.  On Kernelized Multi-armed Bandits , 2017, ICML.

[10]  Xiaojin Zhu,et al.  Semi-Supervised Learning Literature Survey , 2005 .

[11]  L. Eon Bottou Online Learning and Stochastic Approximations , 1998 .

[12]  Bin Li,et al.  Moving average reversion strategy for on-line portfolio selection , 2015, Artif. Intell..

[13]  Teh Ying Wah,et al.  DENGRIS-Stream: A Density-Grid based Clustering Algorithm for Evolving Data Streams over Sliding Window , 2012 .

[14]  Claudio Gentile,et al.  Learning Probabilistic Linear-Threshold Classifiers via Selective Sampling , 2003, COLT.

[15]  Tie-Yan Liu,et al.  Learning to rank: from pairwise approach to listwise approach , 2007, ICML '07.

[16]  Siwei Lyu,et al.  Stochastic Online AUC Maximization , 2016, NIPS.

[17]  Akshay Krishnamurthy,et al.  An Online Hierarchical Algorithm for Extreme Clustering , 2017, ArXiv.

[18]  Ji Wan,et al.  Online Learning to Rank for Content-Based Image Retrieval , 2015, IJCAI.

[19]  Ohad Shamir,et al.  Optimal Distributed Online Prediction Using Mini-Batches , 2010, J. Mach. Learn. Res..

[20]  Y. Freund,et al.  Adaptive game playing using multiplicative weights , 1999 .

[21]  Nenghai Yu,et al.  SOL: A Library for Scalable Online Learning Algorithms , 2017, Neurocomputing.

[22]  Avishek Saha,et al.  Online Learning of Multiple Tasks and Their Relationships , 2011, AISTATS.

[23]  Rong Jin,et al.  Regularized Distance Metric Learning: Theory and Algorithm , 2009, NIPS.

[24]  Narasimhan Sundararajan,et al.  A Fast and Accurate Online Sequential Learning Algorithm for Feedforward Networks , 2006, IEEE Transactions on Neural Networks.

[25]  Shipra Agrawal,et al.  Analysis of Thompson Sampling for the Multi-armed Bandit Problem , 2011, COLT.

[26]  David A. Cohn,et al.  Training Connectionist Networks with Queries and Selective Sampling , 1989, NIPS.

[27]  Steven C. H. Hoi,et al.  Online Passive Aggressive Active Learning and Its Applications , 2014, ACML.

[28]  Zoubin Ghahramani,et al.  Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions , 2003, ICML 2003.

[29]  Hans-Peter Kriegel,et al.  Density-based Projected Clustering over High Dimensional Data Streams , 2012, SDM.

[30]  Csaba Szepesvári,et al.  Improved Algorithms for Linear Stochastic Bandits , 2011, NIPS.

[31]  Jing Gao,et al.  An Incremental Data Stream Clustering Algorithm Based on Dense Units Detection , 2005, PAKDD.

[32]  Peter Auer,et al.  Using Confidence Bounds for Exploitation-Exploration Trade-offs , 2003, J. Mach. Learn. Res..

[33]  Yoram Singer,et al.  The Forgetron: A Kernel-Based Perceptron on a Fixed Budget , 2005, NIPS.

[34]  Sudipto Guha,et al.  Clustering Data Streams: Theory and Practice , 2003, IEEE Trans. Knowl. Data Eng..

[35]  Haipeng Luo,et al.  Efficient Second Order Online Learning by Sketching , 2016, NIPS.

[36]  Benjamin Van Roy,et al.  An Information-Theoretic Analysis of Thompson Sampling , 2014, J. Mach. Learn. Res..

[37]  Yi Li,et al.  The Relaxed Online Maximum Margin Algorithm , 1999, Machine Learning.

[38]  Steven C. H. Hoi,et al.  Large Scale Online Kernel Learning , 2016, J. Mach. Learn. Res..

[39]  Koby Crammer,et al.  New Adaptive Algorithms for Online Classification , 2010, NIPS.

[40]  Yoram Singer,et al.  Pegasos: primal estimated sub-gradient solver for SVM , 2011, Math. Program..

[41]  Himanshu S. Bhatt,et al.  Matching cross-resolution face images using co-transfer learning , 2012, 2012 19th IEEE International Conference on Image Processing.

[42]  Gábor Lugosi,et al.  Minimizing regret with label efficient prediction , 2004, IEEE Transactions on Information Theory.

[43]  Danijel Skocaj,et al.  Multivariate online kernel density estimation with Gaussian kernels , 2011, Pattern Recognit..

[44]  Koby Crammer,et al.  Online Ranking by Projecting , 2005, Neural Computation.

[45]  이화영 X , 1960, Chinese Plants Names Index 2000-2009.

[46]  Steven C. H. Hoi,et al.  Active Learning with Expert Advice , 2013, UAI.

[47]  Tengyuan Liang,et al.  Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP , 2017, ICML.

[48]  Gökhan BakIr,et al.  Predicting Structured Data , 2008 .

[49]  Yi Ding,et al.  Large Scale Kernel Methods for Online AUC Maximization , 2017, 2017 IEEE International Conference on Data Mining (ICDM).

[50]  Craig B. Borkowf,et al.  Time-Series Forecasting , 2002, Technometrics.

[51]  Rich Caruana,et al.  Multitask Learning , 1998, Encyclopedia of Machine Learning and Data Mining.

[52]  Christian Sohler,et al.  StreamKM++: A clustering algorithm for data streams , 2010, JEAL.

[53]  Ambuj Tewari,et al.  Stochastic methods for l1 regularized loss minimization , 2009, ICML '09.

[54]  Andrew W. Moore,et al.  Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..

[55]  Claudio Gentile,et al.  Tracking the best hyperplane with a simple budget Perceptron , 2006, Machine Learning.

[56]  Koby Crammer,et al.  Breaking the curse of kernelization: budgeted stochastic gradient descent for large-scale SVM training , 2012, J. Mach. Learn. Res..

[57]  Ira Assent,et al.  The ClusTree: indexing micro-clusters for anytime stream mining , 2011, Knowledge and Information Systems.

[58]  Lihong Li,et al.  An Empirical Evaluation of Thompson Sampling , 2011, NIPS.

[59]  Shie Mannor,et al.  Online Learning for Time Series Prediction , 2013, COLT.

[60]  Léon Bottou,et al.  Stochastic Learning , 2003, Advanced Lectures on Machine Learning.

[61]  Steven C. H. Hoi,et al.  Online Portfolio Selection , 2015 .

[62]  Steven C. H. Hoi,et al.  Online Deep Learning: Learning Deep Neural Networks on the Fly , 2017, IJCAI.

[63]  Martin J. Wainwright,et al.  Distributed Dual Averaging In Networks , 2010, NIPS.

[64]  Mikhail Belkin,et al.  Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples , 2006, J. Mach. Learn. Res..

[65]  Atsuyoshi Nakamura,et al.  Algorithms for Adversarial Bandit Problems with Multiple Plays , 2010, ALT.

[66]  Bin Li,et al.  CORN: Correlation-driven nonparametric learning approach for portfolio selection , 2011, TIST.

[67]  Gang Chen,et al.  Beyond Banditron: A Conservative and Efficient Reduction for Online Multiclass Prediction with Bandit Setting Model , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[68]  Haipeng Luo,et al.  Achieving All with No Parameters: AdaNormalHedge , 2015, COLT.

[69]  Philip S. Yu,et al.  A Framework for Projected Clustering of High Dimensional Data Streams , 2004, VLDB.

[70]  Gábor Lugosi,et al.  Prediction, learning, and games , 2006 .

[71]  Koby Crammer,et al.  Multiclass classification with bandit feedback using adaptive regularization , 2012, Machine Learning.

[72]  Feifei Li,et al.  Quality and efficiency for kernel density estimates in large data , 2013, SIGMOD '13.

[73]  Wouter M. Koolen,et al.  Second-order Quantile Methods for Experts and Combinatorial Games , 2015, COLT.

[74]  Ambuj Tewari,et al.  Composite objective mirror descent , 2010, COLT 2010.

[75]  Edward F. Harrington,et al.  Online Ranking/Collaborative Filtering Using the Perceptron Algorithm , 2003, ICML.

[76]  T. Cover Universal Portfolios , 1996 .

[77]  F ROSENBLATT,et al.  The perceptron: a probabilistic model for information storage and organization in the brain. , 1958, Psychological review.

[78]  Ian H. Witten,et al.  Interactive machine learning: letting users build classifiers , 2002, Int. J. Hum. Comput. Stud..

[79]  Trung Le,et al.  Dual Space Gradient Descent for Online Learning , 2016, NIPS.

[80]  Chunyan Miao,et al.  High-Dimensional Data Stream Classification via Sparse Online Learning , 2014, 2014 IEEE International Conference on Data Mining.

[81]  MiaoChunyan,et al.  Online Multi-Modal Distance Metric Learning with Application to Image Retrieval , 2016 .

[82]  Steven C. H. Hoi,et al.  Cost-sensitive online active learning with application to malicious URL detection , 2013, KDD.

[83]  Jieping Ye,et al.  Online learning by ellipsoid method , 2009, ICML '09.

[84]  Mu-Song Chen,et al.  Online transductive support vector machines for classification , 2012, 2012 International Conference on Information Security and Intelligent Control.

[85]  John Langford,et al.  Sparse Online Learning via Truncated Gradient , 2008, NIPS.

[86]  Jinfeng Yi,et al.  Online Kernel Selection: Algorithms and Evaluations , 2012, AAAI.

[87]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[88]  Barbara Caputo,et al.  Bounded Kernel-Based Online Learning , 2009, J. Mach. Learn. Res..

[89]  Claudio Gentile,et al.  A New Approximate Maximal Margin Classification Algorithm , 2002, J. Mach. Learn. Res..

[90]  Jiadong Ren,et al.  Density-Based Data Streams Clustering over Sliding Windows , 2009, 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery.

[91]  Wei Chu,et al.  A contextual-bandit approach to personalized news article recommendation , 2010, WWW '10.

[92]  Matthew J. Streeter,et al.  Tighter Bounds for Multi-Armed Bandits with Expert Advice , 2009, COLT.

[93]  David S. Leslie,et al.  Optimistic Bayesian Sampling in Contextual-Bandit Problems , 2012, J. Mach. Learn. Res..

[94]  Léon Bottou,et al.  Large-Scale Machine Learning with Stochastic Gradient Descent , 2010, COMPSTAT.

[95]  Steven C. H. Hoi,et al.  Online multi-modal distance learning for scalable multimedia retrieval , 2013, WSDM.

[96]  Sören Sonnenburg,et al.  COFFIN: A Computational Framework for Linear SVMs , 2010, ICML.

[97]  Jing-Yu Yang,et al.  Density-based hierarchical clustering for streaming data , 2012, Pattern Recognit. Lett..

[98]  Ambuj Tewari,et al.  Efficient bandit algorithms for online multiclass prediction , 2008, ICML '08.

[99]  Charu C. Aggarwal,et al.  Outlier Detection for Temporal Data: A Survey , 2014, IEEE Transactions on Knowledge and Data Engineering.

[100]  Barbara Caputo,et al.  Leveraging over prior knowledge for online learning of visual categories , 2012, BMVC.

[101]  Sharma Chakravarthy,et al.  Clustering data streams using grid-based synopsis , 2013, Knowledge and Information Systems.

[102]  Steven C. H. Hoi,et al.  PAMR: Passive aggressive mean reversion strategy for portfolio selection , 2012, Machine Learning.

[103]  John C. Platt,et al.  Fast training of support vector machines using sequential minimal optimization, advances in kernel methods , 1999 .

[104]  Steven C. H. Hoi,et al.  Online multi-task collaborative filtering for on-the-fly recommender systems , 2013, RecSys.

[105]  Tao Mei,et al.  Massive-scale Online Feature Selection for Sparse Ultra-high Dimensional Data , 2014, ArXiv.

[106]  Koby Crammer,et al.  Active Learning with Confidence , 2008, ACL.

[107]  Chunyan Miao,et al.  SOAL: Second-Order Online Active Learning , 2016, 2016 IEEE 16th International Conference on Data Mining (ICDM).

[108]  H. Robbins,et al.  Asymptotically efficient adaptive allocation rules , 1985 .

[109]  Vasant Honavar,et al.  Learn++: an incremental learning algorithm for supervised neural networks , 2001, IEEE Trans. Syst. Man Cybern. Part C.

[110]  Ramesh C. Jain,et al.  Micro-blogging Sentiment Detection by Collaborative Online Learning , 2010, 2010 IEEE International Conference on Data Mining.

[111]  John Shawe-Taylor,et al.  Two view learning: SVM-2K, Theory and Practice , 2005, NIPS.

[112]  Ming-Syan Chen,et al.  Efficient Kernel Approximation for Large-Scale Support Vector Machine Classification , 2011, SDM.

[113]  David P. Helmbold,et al.  Some label efficient learning results , 1997, COLT '97.

[114]  Dan Roth,et al.  Sequential Learning of Classifiers for Structured Prediction Problems , 2009, AISTATS.

[115]  Peter Auer,et al.  The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..

[116]  Bin Li,et al.  Online Transfer Learning , 2014, Artif. Intell..

[117]  VARUN CHANDOLA,et al.  Anomaly detection: A survey , 2009, CSUR.

[118]  Kai Ming Ting,et al.  Fast Anomaly Detection for Streaming Data , 2011, IJCAI.

[119]  Steven C. H. Hoi,et al.  BDUOL: Double Updating Online Learning on a Fixed Budget , 2012, ECML/PKDD.

[120]  Wouter M. Koolen,et al.  MetaGrad: Multiple Learning Rates in Online Learning , 2016, NIPS.

[121]  Nathan Srebro,et al.  Stochastic Optimization of PCA with Capped MSG , 2013, NIPS.

[122]  Inderjit S. Dhillon,et al.  Online Metric Learning and Fast Similarity Search , 2008, NIPS.

[123]  Sanjeev Arora,et al.  The Multiplicative Weights Update Method: a Meta-Algorithm and Applications , 2012, Theory Comput..

[124]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[125]  Douglas H. Fisher,et al.  Knowledge Acquisition Via Incremental Conceptual Clustering , 1987, Machine Learning.

[126]  Robert D. Kleinberg,et al.  Online decision problems with large strategy sets , 2005 .

[127]  Philip S. Yu,et al.  Density-based clustering of data streams at multiple resolutions , 2009, TKDD.

[128]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[129]  Himanshu S. Bhatt,et al.  Submitted to Ieee Transactions on Image Processing 1 Improving Cross-resolution Face Matching Using Ensemble Based Co-transfer Learning , 2022 .

[130]  Michael R. Lyu,et al.  Online learning for multi-task feature selection , 2010, CIKM '10.

[131]  Steven C. H. Hoi,et al.  LIBOL: a library for online learning algorithms , 2014, J. Mach. Learn. Res..

[132]  Hal Daumé,et al.  Learning Task Grouping and Overlap in Multi-task Learning , 2012, ICML.

[133]  Manfred K. Warmuth,et al.  Additive versus exponentiated gradient updates for linear prediction , 1995, STOC '95.

[134]  Elad Hazan,et al.  Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization , 2008, COLT.

[135]  Manfred K. Warmuth,et al.  The Weighted Majority Algorithm , 1994, Inf. Comput..

[136]  H. Sebastian Seung,et al.  Query by committee , 1992, COLT '92.

[137]  Yi Ding,et al.  An Adaptive Gradient Method for Online AUC Maximization , 2015, AAAI.

[138]  Claudio Gentile,et al.  Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms , 2004, NIPS.

[139]  Ran El-Yaniv,et al.  Online Choice of Active Learning Algorithms , 2003, J. Mach. Learn. Res..

[140]  Claudio Gentile,et al.  Worst-Case Analysis of Selective Sampling for Linear Classification , 2006, J. Mach. Learn. Res..

[141]  Taghi M. Khoshgoftaar,et al.  A Survey of Collaborative Filtering Techniques , 2009, Adv. Artif. Intell..

[142]  I. J. Schoenberg,et al.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[143]  Yoav Freund,et al.  Large Margin Classification Using the Perceptron Algorithm , 1998, COLT' 98.

[144]  Hang Li Learning to Rank , 2017, Encyclopedia of Machine Learning and Data Mining.

[145]  Shuai Li,et al.  On Context-Dependent Clustering of Bandits , 2016, ICML.

[146]  B. Silverman Density estimation for statistics and data analysis , 1986 .

[147]  Chunyan Miao,et al.  Online Multitask Relative Similarity Learning , 2017, IJCAI.

[148]  B. Mercier,et al.  A dual algorithm for the solution of nonlinear variational problems via finite element approximation , 1976 .

[149]  Bin Li,et al.  Confidence Weighted Mean Reversion Strategy for Online Portfolio Selection , 2011, TKDD.

[150]  Shai Shalev-Shwartz,et al.  Online learning: theory, algorithms and applications (למידה מקוונת.) , 2007 .

[151]  Steven C. H. Hoi,et al.  Online portfolio selection: A survey , 2012, CSUR.

[152]  Tao Jin,et al.  Collaborative topic regression for online recommender systems: an online and Bayesian approach , 2017, Machine Learning.

[153]  Christian M. Ernst,et al.  Multi-armed Bandit Allocation Indices , 1989 .

[154]  John N. Tsitsiklis,et al.  Linearly Parameterized Bandits , 2008, Math. Oper. Res..

[155]  Geoff Holmes,et al.  Batch-Incremental versus Instance-Incremental Learning in Dynamic and Evolving Data , 2012, IDA.

[156]  Nathan Srebro,et al.  Stochastic optimization for PCA and PLS , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[157]  Rémi Munos,et al.  Algorithms for Infinitely Many-Armed Bandits , 2008, NIPS.

[158]  Zhong Chen,et al.  CSTG: An Effective Framework for Cost-sensitive Sparse Online Learning , 2017, SDM.

[159]  Mehryar Mohri,et al.  Multi-armed Bandit Algorithms and Empirical Evaluation , 2005, ECML.

[160]  Shipra Agrawal,et al.  Thompson Sampling for Contextual Bandits with Linear Payoffs , 2012, ICML.

[161]  Allan Borodin,et al.  Can We Learn to Beat the Best Stock , 2003, NIPS.

[162]  Arindam Banerjee,et al.  Online Alternating Direction Method , 2012, ICML.

[163]  Marius Kloft,et al.  Security analysis of online centroid anomaly detection , 2010, J. Mach. Learn. Res..

[164]  Li Tu,et al.  Density-based clustering for real-time stream data , 2007, KDD '07.

[165]  W. R. Thompson ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES , 1933 .

[166]  Sudipto Guha,et al.  Clustering Data Streams , 2000, FOCS.

[167]  Eric Eaton,et al.  ELLA: An Efficient Lifelong Learning Algorithm , 2013, ICML.

[168]  Michael R. Lyu,et al.  Kernelized Online Imbalanced Learning with Fixed Budgets , 2015, AAAI.

[169]  Ambuj Tewari,et al.  Online Learning: Random Averages, Combinatorial Parameters, and Learnability , 2010, NIPS.

[170]  Yue M. Lu,et al.  The scaling limit of high-dimensional online independent component analysis , 2017, NIPS.

[171]  Paul Honeine,et al.  Online Kernel Principal Component Analysis: A Reduced-Order Model , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[172]  Gábor Lugosi,et al.  Regret in Online Combinatorial Optimization , 2012, Math. Oper. Res..

[173]  Steven C. H. Hoi,et al.  Exact Soft Confidence-Weighted Learning , 2012, ICML.

[174]  S. Sathiya Keerthi,et al.  Efficient algorithms for ranking with SVMs , 2010, Information Retrieval.

[175]  Rong Jin,et al.  Online Multiple Kernel Similarity Learning for Visual Search , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[176]  H. Sebastian Seung,et al.  Selective Sampling Using the Query by Committee Algorithm , 1997, Machine Learning.

[177]  John C. Platt A Resource-Allocating Network for Function Interpolation , 1991, Neural Computation.

[178]  Aoying Zhou,et al.  Density-Based Clustering over an Evolving Data Stream with Noise , 2006, SDM.

[179]  Jun-Ming Xu,et al.  OASIS: Online Active Semi-Supervised Learning , 2011, AAAI.

[180]  Alex M. Andrew,et al.  Reinforcement Learning: : An Introduction , 1998 .

[181]  Martin Zinkevich,et al.  Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.

[182]  Min Wu,et al.  Cost-Sensitive Online Classification with Adaptive Regularization and Its Applications , 2015, 2015 IEEE International Conference on Data Mining.

[183]  Min Zhao,et al.  Online evolutionary collaborative filtering , 2010, RecSys '10.

[184]  Zhi-Hua Zhou,et al.  Online Stochastic Linear Optimization under One-bit Feedback , 2015, ICML.

[185]  Qiang Yang,et al.  A Survey on Transfer Learning , 2010, IEEE Transactions on Knowledge and Data Engineering.

[186]  Tong Zhang,et al.  Solving large scale linear prediction problems using stochastic gradient descent algorithms , 2004, ICML.

[187]  Koby Crammer,et al.  Multi-Class Confidence Weighted Algorithms , 2009, EMNLP.

[188]  Alexandre Proutière,et al.  Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms , 2014, COLT.

[189]  Slobodan Vucetic,et al.  Online Passive-Aggressive Algorithms on a Budget , 2010, AISTATS.

[190]  Matthew O. Ward,et al.  Neighbor-based pattern detection for windows over streaming data , 2009, EDBT '09.

[191]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[192]  Dawei Liu,et al.  Efficient anomaly monitoring over moving object trajectory streams , 2009, KDD.

[193]  Kannan Ramchandran,et al.  The Sample Complexity of Online One-Class Collaborative Filtering , 2017, ICML.

[194]  Claudio Gentile,et al.  Linear Classification and Selective Sampling Under Low Noise Conditions , 2008, NIPS.

[195]  Avrim Blum,et al.  On-line Algorithms in Machine Learning , 1996, Online Algorithms.

[196]  Rong Jin,et al.  Distance Metric Learning: A Comprehensive Survey , 2006 .

[197]  Steven C. H. Hoi,et al.  Fast Bounded Online Gradient Descent Algorithms for Scalable Kernel-Based Online Learning , 2012, ICML.

[198]  Koby Crammer,et al.  Learning via Gaussian Herding , 2010, NIPS.

[199]  Yurii Nesterov,et al.  Primal-dual subgradient methods for convex problems , 2005, Math. Program..

[200]  Yoram Singer,et al.  The Forgetron: A Kernel-Based Perceptron on a Budget , 2008, SIAM J. Comput..

[201]  Dimitris K. Tasoulis,et al.  Visualising the Cluster Structure of Data Streams , 2007, IDA.

[202]  Rong Jin,et al.  Online feature selection for mining big data , 2012, BigMine '12.

[203]  Claudio Gentile,et al.  Linear Algorithms for Online Multitask Classification , 2010, COLT.

[204]  Vladimir Vovk,et al.  Universal portfolio selection , 1998, COLT' 98.

[205]  Elad Hazan,et al.  Logarithmic regret algorithms for online convex optimization , 2006, Machine Learning.

[206]  Santosh S. Vempala,et al.  Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..

[207]  Steven C. H. Hoi,et al.  Large Scale Online Kernel Classification , 2013, IJCAI.

[208]  Yoav Freund,et al.  A Parameter-free Hedging Algorithm , 2009, NIPS.

[209]  Bin Li,et al.  On-Line Portfolio Selection with Moving Average Reversion , 2012, ICML.

[210]  Yoram Singer,et al.  Adaptive Subgradient Methods for Online Learning and Stochastic Optimization , 2011, J. Mach. Learn. Res..

[211]  Claudio Gentile,et al.  On the generalization ability of on-line learning algorithms , 2001, IEEE Transactions on Information Theory.

[212]  Nicolò Cesa-Bianchi,et al.  Gambling in a rigged casino: The adversarial multi-armed bandit problem , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[213]  C H HoiSteven,et al.  Confidence Weighted Mean Reversion Strategy for Online Portfolio Selection , 2013 .

[214]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[215]  András Urbán,et al.  Performance analysis of log-optimal portfolio strategies with transaction costs , 2011 .

[216]  Chunyan Miao,et al.  Online Multi-Modal Distance Metric Learning with Application to Image Retrieval , 2016, IEEE Transactions on Knowledge and Data Engineering.

[217]  Massimiliano Pontil,et al.  Regularized multi--task learning , 2004, KDD.

[218]  Claudio Gentile,et al.  A Second-Order Perceptron Algorithm , 2002, SIAM J. Comput..

[219]  Sham M. Kakade,et al.  Towards Minimax Policies for Online Linear Optimization with Bandit Feedback , 2012, COLT.

[220]  Vladimir Vapnik,et al.  An overview of statistical learning theory , 1999, IEEE Trans. Neural Networks.

[221]  Bohyung Han,et al.  Sequential Kernel Density Approximation and Its Application to Real-Time Visual Tracking , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[222]  Nicolò Cesa-Bianchi,et al.  Combinatorial Bandits , 2012, COLT.

[223]  Robert E. Schapire,et al.  Algorithms for portfolio management based on the Newton method , 2006, ICML.

[224]  Ji Wan,et al.  SOLAR: Scalable Online Learning Algorithms for Ranking , 2015, ACL.

[225]  James Hannan,et al.  4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY , 1958 .

[226]  Steven C. H. Hoi,et al.  Online Sparse Passive Aggressive Learning with Kernels , 2016, SDM.

[227]  Sudipto Guha,et al.  Streaming-data algorithms for high-quality clustering , 2002, Proceedings 18th International Conference on Data Engineering.

[228]  Cédric Archambeau,et al.  Adaptive Algorithms for Online Convex Optimization with Long-term Constraints , 2015, ICML.

[229]  Nick Littlestone,et al.  From on-line to batch learning , 1989, COLT '89.

[230]  Csaba Szepesvári,et al.  Exploration-exploitation tradeoff using variance estimates in multi-armed bandits , 2009, Theor. Comput. Sci..

[231]  Tianbao Yang,et al.  Online Asymmetric Active Learning with Imbalanced Data , 2016, KDD.

[232]  Alexander J. Smola,et al.  Online learning with kernels , 2001, IEEE Transactions on Signal Processing.

[233]  Peter L. Bartlett,et al.  Adaptive Online Gradient Descent , 2007, NIPS.

[234]  D. W. Scott,et al.  Multivariate Density Estimation, Theory, Practice and Visualization , 1992 .

[235]  Gerhard J. Woeginger,et al.  Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

[236]  Vladimir Vovk,et al.  Prediction with Advice of Unknown Number of Experts , 2010, UAI.

[237]  C H HoiSteven,et al.  Online portfolio selection , 2014 .

[238]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[239]  Li Wei,et al.  M-kernel merging: towards density estimation over data streams , 2003, Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings..

[240]  Han Liu,et al.  Online ICA: Understanding Global Dynamics of Nonconvex Optimization via Diffusion Processes , 2018, NIPS.

[241]  Albert B Novikoff,et al.  ON CONVERGENCE PROOFS FOR PERCEPTRONS , 1963 .

[242]  Rong Jin,et al.  Double Updating Online Learning , 2011, J. Mach. Learn. Res..

[243]  Christopher J. C. Burges,et al.  Dimension Reduction: A Guided Tour , 2010, Found. Trends Mach. Learn..

[244]  Yajun Wang,et al.  Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms , 2014, J. Mach. Learn. Res..

[245]  Francesco Orabona,et al.  Efficient Online Bandit Multiclass Learning with Õ(√T) Regret , 2017, ICML.

[246]  Jing Gao,et al.  On handling negative transfer and imbalanced distributions in multiple source transfer learning , 2014, SDM.

[247]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[248]  Léon Bottou,et al.  The Tradeoffs of Large Scale Learning , 2007, NIPS.

[249]  Ning Chen,et al.  Mobile App Tagging , 2016, WSDM '16.

[250]  Steven L. Scott,et al.  A modern Bayesian look at the multi-armed bandit , 2010 .

[251]  Koby Crammer,et al.  Online Classification on a Budget , 2003, NIPS.

[252]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[253]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[254]  N. Littlestone Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[255]  Robert D. Kleinberg Nearly Tight Bounds for the Continuum-Armed Bandit Problem , 2004, NIPS.

[256]  Siu Cheung Hui,et al.  Two-View Online Learning , 2012, PAKDD.

[257]  Robi Polikar,et al.  Incremental Learning of Concept Drift in Nonstationary Environments , 2011, IEEE Transactions on Neural Networks.

[258]  Ronald J. Williams,et al.  A Learning Algorithm for Continually Running Fully Recurrent Neural Networks , 1989, Neural Computation.

[259]  João M. F. Xavier,et al.  D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization , 2012, IEEE Transactions on Signal Processing.

[260]  Tong Zhang,et al.  Projection-free Distributed Online Learning in Networks , 2017, ICML.

[261]  Francesco Orabona,et al.  Better Algorithms for Selective Sampling , 2011, ICML.

[262]  Thomas G. Dietterich Machine Learning for Sequential Data: A Review , 2002, SSPR/SPR.

[263]  Chen Jia,et al.  A Grid and Density-Based Clustering Algorithm for Processing Data Stream , 2008, 2008 Second International Conference on Genetic and Evolutionary Computing.

[264]  Klaus Obermayer,et al.  Support vector learning for ordinal regression , 1999 .

[265]  Martha Larson,et al.  Collaborative Filtering beyond the User-Item Matrix , 2014, ACM Comput. Surv..

[266]  Steven C. H. Hoi,et al.  Online Adaptive Passive-Aggressive Methods for Non-Negative Matrix Factorization and Its Applications , 2016, CIKM.

[267]  Bin Li,et al.  OLPS: A Toolbox for On-Line Portfolio Selection , 2016, J. Mach. Learn. Res..

[268]  Koby Crammer,et al.  Online Passive-Aggressive Algorithms , 2003, J. Mach. Learn. Res..

[269]  Shai Shalev-Shwartz,et al.  Online Learning and Online Convex Optimization , 2012, Found. Trends Mach. Learn..

[270]  Seshadhri Comandur,et al.  Efficient learning algorithms for changing environments , 2009, ICML '09.

[271]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[272]  Stephen Grossberg,et al.  ARTMAP: supervised real-time learning and classification of nonstationary data by a self-organizing neural network , 1991, [1991 Proceedings] IEEE Conference on Neural Networks for Ocean Engineering.

[273]  Rong Jin,et al.  Online Multiple Kernel Classification , 2013, Machine Learning.

[274]  장윤희,et al.  Y. , 2003, Industrial and Labor Relations Terms.

[275]  Rong Jin,et al.  Online AUC Maximization , 2011, ICML.

[276]  Steven C. H. Hoi,et al.  Soft Confidence-Weighted Learning , 2016, ACM Trans. Intell. Syst. Technol..

[277]  Michael R. Lyu,et al.  Online learning for collaborative filtering , 2012, The 2012 International Joint Conference on Neural Networks (IJCNN).

[278]  Ji Wan,et al.  SOML: Sparse Online Metric Learning with Application to Image Retrieval , 2014, AAAI.

[279]  Jason Weston,et al.  Online (and Offline) on an Even Tighter Budget , 2005, AISTATS.

[280]  Chunyan Miao,et al.  Learning Relative Similarity from Data Streams: Active Online Learning Approaches , 2015, CIKM.

[281]  Sébastien Bubeck,et al.  Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems , 2012, Found. Trends Mach. Learn..

[282]  Xiaojin Zhu,et al.  Introduction to Semi-Supervised Learning , 2009, Synthesis Lectures on Artificial Intelligence and Machine Learning.

[283]  Nenghai Yu,et al.  Large-Scale Online Feature Selection for Ultra-High Dimensional Sparse Data , 2014, ACM Trans. Knowl. Discov. Data.

[284]  Myra Spiliopoulou,et al.  C-DenStream: Using Domain Knowledge on a Data Stream , 2009, Discovery Science.

[285]  Shie Mannor,et al.  Online PCA for Contaminated Data , 2013, NIPS.

[286]  Xin Yao,et al.  Dealing with Multiple Classes in Online Class Imbalance Learning , 2016, IJCAI.

[287]  Charu C. Aggarwal,et al.  A Survey of Stream Clustering Algorithms , 2018, Data Clustering: Algorithms and Applications.

[288]  Aurélien Garivier,et al.  On Bayesian Upper Confidence Bounds for Bandit Problems , 2012, AISTATS.

[289]  Arnold P. Boedihardjo,et al.  A framework for estimating complex probability density structures in data streams , 2008, CIKM '08.

[290]  Robert D. Nowak,et al.  Scalable Generalized Linear Bandits: Online Computation and Hashing , 2017, NIPS.

[291]  Steven C. H. Hoi,et al.  A Framework of Sparse Online Learning and Its Applications , 2015, ArXiv.

[292]  Bin Li,et al.  Semi-Universal Portfolios with Transaction Costs , 2015, IJCAI.

[293]  Rong Jin,et al.  A Potential-based Framework for Online Multi-class Learning with Partial Feedback , 2010, AISTATS.

[294]  Csaba Szepesvári,et al.  Online Learning to Rank in Stochastic Click Models , 2017, ICML.

[295]  Lin Xiao,et al.  Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization , 2009, J. Mach. Learn. Res..

[296]  Koby Crammer,et al.  Confidence-weighted linear classification , 2008, ICML '08.

[297]  Yoram Singer,et al.  On‐Line Portfolio Selection Using Multiplicative Updates , 1998, ICML.

[298]  Steven C. H. Hoi,et al.  Online ARIMA Algorithms for Time Series Prediction , 2016, AAAI.

[299]  Steven C. H. Hoi,et al.  Sparse Passive-Aggressive Learning for Bounded Online Kernel Methods , 2018, ACM Trans. Intell. Syst. Technol..

[300]  Chih-Jen Lin,et al.  Training and Testing Low-degree Polynomial Data Mappings via Linear SVM , 2010, J. Mach. Learn. Res..

[301]  Koby Crammer,et al.  Adaptive regularization of weight vectors , 2009, Machine Learning.

[302]  Benjamin Recht,et al.  Random Features for Large-Scale Kernel Machines , 2007, NIPS.

[303]  Peilin Zhao,et al.  Kernel based online learning , 2013 .

[304]  John L. Kelly,et al.  A new interpretation of information rate , 1956, IRE Trans. Inf. Theory.

[305]  Warren B. Powell,et al.  Reinforcement Learning and Its Relationship to Supervised Learning , 2004 .

[306]  Bernhard Schölkopf,et al.  A Generalized Representer Theorem , 2001, COLT/EuroCOLT.

[307]  Klaus-Robert Müller,et al.  Efficient BackProp , 2012, Neural Networks: Tricks of the Trade.

[308]  Klaus Diepold,et al.  Truly Incremental Locally Linear Embedding , 2008 .

[309]  Qing Wang,et al.  Online Context-Aware Recommendation with Time Varying Multi-Armed Bandit , 2016, KDD.

[310]  Stephen Grossberg,et al.  Fuzzy ARTMAP: A neural network architecture for incremental supervised learning of analog multidimensional maps , 1992, IEEE Trans. Neural Networks.

[311]  Shiliang Sun,et al.  A survey of multi-view machine learning , 2013, Neural Computing and Applications.

[312]  Karhan Akcoglu,et al.  Fast Universalization of Investment Strategies , 2004, SIAM J. Comput..

[313]  Hai Huang,et al.  A three-step clustering algorithm over an evolving data stream , 2009, 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[314]  Xiangliang Zhang,et al.  KDE-Track: An Efficient Dynamic Density Estimator for Data Streams , 2017, IEEE Transactions on Knowledge and Data Engineering.

[315]  Prateek Jain,et al.  On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions , 2013, ICML.

[316]  Ji Wan,et al.  Sparse Online Learning of Image Similarity , 2017, ACM Trans. Intell. Syst. Technol..

[317]  Michael N. Katehakis,et al.  The Multi-Armed Bandit Problem: Decomposition and Computation , 1987, Math. Oper. Res..

[318]  Manfred K. Warmuth,et al.  Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension , 2008 .

[319]  Anil K. Jain,et al.  Incremental nonlinear dimensionality reduction by manifold learning , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[320]  Muqeet Ali,et al.  Parallel Collaborative Filtering for Streaming Data , 2011 .

[321]  Manfred K. Warmuth,et al.  Online kernel PCA with entropic matrix updates , 2007, ICML '07.

[322]  Liang Ge,et al.  OMS-TL: a framework of online multiple source transfer learning , 2013, CIKM.

[323]  Philip S. Yu,et al.  Mining concept-drifting data streams using ensemble classifiers , 2003, KDD '03.

[324]  J. Gittins Bandit processes and dynamic allocation indices , 1979 .

[325]  Chunyan Miao,et al.  Active Crowdsourcing for Annotation , 2015, 2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT).

[326]  Ying Wah Teh,et al.  On Density-Based Data Streams Clustering Algorithms: A Survey , 2014, Journal of Computer Science and Technology.

[327]  Gunnar Rätsch,et al.  Large Scale Multiple Kernel Learning , 2006, J. Mach. Learn. Res..

[328]  Eric P. Xing,et al.  Online Learning of Structured Predictors with Multiple Kernels , 2011, AISTATS.

[329]  Yuanxiang Li,et al.  Accelerated Online Learning for Collaborative Filtering and Recommender Systems , 2014, 2014 IEEE International Conference on Data Mining Workshop.

[330]  László Györfi,et al.  Nonparametric nearest neighbor based empirical portfolio selection strategies , 2008 .

[331]  Ravi Sankar,et al.  Time Series Prediction Using Support Vector Machines: A Survey , 2009, IEEE Computational Intelligence Magazine.

[332]  Yiming Yang,et al.  Adaptive Smoothed Online Multi-Task Learning , 2016, NIPS.

[333]  Roni Khardon,et al.  Generalization Bounds for Online Learning Algorithms with Pairwise Loss Functions , 2012, COLT.

[334]  Yehuda Koren,et al.  Matrix Factorization Techniques for Recommender Systems , 2009, Computer.

[335]  Slobodan Vucetic,et al.  Tighter Perceptron with improved dual use of cached data for model representation and validation , 2009, 2009 International Joint Conference on Neural Networks.

[336]  Rong Jin,et al.  Online Multiple Kernel Learning: Algorithms and Mistake Bounds , 2010, ALT.

[337]  Stefan Wermter,et al.  Continual Lifelong Learning with Neural Networks: A Review , 2019, Neural Networks.

[338]  Steven C. H. Hoi,et al.  Temporal Kernel Descriptors for Learning with Time-sensitive Patterns , 2016, SDM.

[339]  H. Robbins Some aspects of the sequential design of experiments , 1952 .

[340]  Koby Crammer,et al.  Pranking with Ranking , 2001, NIPS.

[341]  Abhinandan Das,et al.  Google news personalization: scalable online collaborative filtering , 2007, WWW '07.

[342]  Ming Li,et al.  Online Manifold Regularization: A New Learning Setting and Empirical Study , 2008, ECML/PKDD.

[343]  Steven C. H. Hoi,et al.  Online Passive-Aggressive Active learning , 2016, Machine Learning.

[344]  Steven C. H. Hoi,et al.  Cost-Sensitive Online Classification , 2012, 2012 IEEE 12th International Conference on Data Mining.

[345]  Ning Chen,et al.  SimApp: A Framework for Detecting Similar Mobile Applications by Online Kernel Learning , 2015, WSDM.

[346]  Li Tu,et al.  Stream data clustering based on grid density and attraction , 2009, TKDD.

[347]  Pierre Priouret,et al.  Adaptive Algorithms and Stochastic Approximations , 1990, Applications of Mathematics.

[348]  Claudio Gentile,et al.  Improved Risk Tail Bounds for On-Line Algorithms , 2005, IEEE Transactions on Information Theory.

[349]  Ohad Shamir,et al.  Efficient Transductive Online Learning via Randomized Rounding , 2011, Empirical Inference.

[350]  Pavel Berkhin,et al.  A Survey of Clustering Data Mining Techniques , 2006, Grouping Multidimensional Data.

[351]  Max Welling,et al.  Asynchronous Distributed Learning of Topic Models , 2008, NIPS.

[352]  Koby Crammer,et al.  Confidence in Structured-Prediction Using Confidence-Weighted Models , 2010, EMNLP.

[353]  Stephen Taylor,et al.  Forecasting Economic Time Series , 1979 .

[354]  Steven C. H. Hoi,et al.  Second Order Online Collaborative Filtering , 2013, ACML.

[355]  Steven C. H. Hoi,et al.  Cost Sensitive Online Multiple Kernel Classification , 2016, ACML.

[356]  Ioannis Mitliagkas,et al.  Memory Limited, Streaming PCA , 2013, NIPS.

[357]  Bin Li,et al.  Robust Median Reversion Strategy for Online Portfolio Selection , 2013, IEEE Transactions on Knowledge and Data Engineering.

[358]  Haibo He,et al.  SOMKE: Kernel Density Estimation Over Data Streams by Sequences of Self-Organizing Maps , 2012, IEEE Transactions on Neural Networks and Learning Systems.

[359]  Yoram Singer,et al.  Online and batch learning of pseudo-metrics , 2004, ICML.

[360]  Gert Cauwenberghs,et al.  Incremental and Decremental Support Vector Machine Learning , 2000, NIPS.

[361]  John Shawe-Taylor,et al.  The Perceptron Algorithm with Uneven Margins , 2002, ICML.

[362]  Zenglin Xu,et al.  An Extended Level Method for Efficient Multiple Kernel Learning , 2008, NIPS.

[363]  Fabio Stella,et al.  Stochastic Nonstationary Optimization for Finding Universal Portfolios , 2000, Ann. Oper. Res..

[364]  Ming Yang,et al.  Multi-View Representation Learning: A Survey from Shallow Methods to Deep Methods , 2016, ArXiv.

[365]  Ambuj Tewari,et al.  On the Generalization Ability of Online Strongly Convex Programming Algorithms , 2008, NIPS.

[366]  Yoram Singer,et al.  Efficient Online and Batch Learning Using Forward Backward Splitting , 2009, J. Mach. Learn. Res..

[367]  Nada Lavrac,et al.  The Multi-Purpose Incremental Learning System AQ15 and Its Testing Application to Three Medical Domains , 1986, AAAI.

[368]  Trung Le,et al.  Large-scale Online Kernel Learning with Random Feature Reparameterization , 2017, IJCAI.

[369]  Hang Li,et al.  A Short Introduction to Learning to Rank , 2011, IEICE Trans. Inf. Syst..

[370]  Chun Chen,et al.  Efficient Online Learning for Large-scale Sparse Kernel Logistic Regression , 2022 .

[371]  Zhi-Hua Zhou,et al.  One-Pass AUC Optimization , 2013, ICML.

[372]  Jiadong Ren,et al.  Clustering over Data Streams Based on Grid Density and Index Tree , 2011 .

[373]  Eduardo Jaques Spinosa,et al.  Novelty detection with application to data streams , 2009, Intell. Data Anal..

[374]  Ming Yang,et al.  A Survey of Multi-View Representation Learning , 2019, IEEE Transactions on Knowledge and Data Engineering.

[375]  Lihong Li,et al.  Provable Optimal Algorithms for Generalized Linear Contextual Bandits , 2017, ArXiv.

[376]  Li Zhou,et al.  A Survey on Contextual Multi-armed Bandits , 2015, ArXiv.

[377]  Claudio Gentile,et al.  Robust bounds for classification via selective sampling , 2009, ICML '09.

[378]  Dacheng Tao,et al.  A Survey on Multi-view Learning , 2013, ArXiv.

[379]  Parikshit Shah,et al.  Online Ranking with Constraints: A Primal-Dual Algorithm and Applications to Web Traffic-Shaping , 2017, KDD.

[380]  Ling Huang,et al.  Online Semi-Supervised Learning on Quantized Graphs , 2010, UAI.

[381]  Ashok Cutkosky,et al.  Online Convex Optimization with Unconstrained Domains and Losses , 2017, NIPS.

[382]  Rong Jin,et al.  Online Feature Selection and Its Applications , 2014, IEEE Transactions on Knowledge and Data Engineering.

[383]  Alexandre Proutière,et al.  Combinatorial Bandits Revisited , 2015, NIPS.

[384]  Qiang Yang,et al.  Lifelong Machine Learning Systems: Beyond Learning Algorithms , 2013, AAAI Spring Symposium: Lifelong Machine Learning.

[385]  Steven C. H. Hoi,et al.  OTL: A Framework of Online Transfer Learning , 2010, ICML.

[386]  Ramesh C. Jain,et al.  Collaborative Online Multitask Learning , 2014, IEEE Transactions on Knowledge and Data Engineering.

[387]  Susanne Albers,et al.  Online algorithms: a survey , 2003, Math. Program..

[388]  Philip M. Long,et al.  Online Multitask Learning , 2006, COLT.

[389]  Tim Roughgarden,et al.  Online Prediction with Selfish Experts , 2017, NIPS.

[390]  Francesco Orabona,et al.  OM-2: An online multi-class Multi-Kernel Learning algorithm Luo Jie , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops.

[391]  Fabrizio Angiulli,et al.  Detecting distance-based outliers in streams of data , 2007, CIKM '07.

[392]  F. R. Rosendaal,et al.  Prediction , 2015, Journal of thrombosis and haemostasis : JTH.

[393]  Elad Hazan,et al.  Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction , 2011, NIPS.

[394]  Yoram Singer,et al.  A primal-dual perspective of online learning algorithms , 2007, Machine Learning.