Kernel-based online machine learning and support vector reduction

被引:51
作者
Agarwal, Sumeet [2 ]
Saradhi, V. Vijaya [1 ]
Karnick, Harish [1 ]
机构
[1] Indian Inst Technol, Dept Comp Sci & Engn, Kanpur 208016, Uttar Pradesh, India
[2] Univ Oxford, Syst Biol Doctoral Training Ctr, Oxford OX1 2JD, England
关键词
support vector machines; span of support vectors; classifier complexity reduction; budget algorithm; online SVMs;
D O I
10.1016/j.neucom.2007.11.023
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We apply kernel-based machine learning methods to online learning situations, and look at the related requirement of reducing the complexity of the learnt classifier. Online methods are particularly useful in situations which involve streaming data, such as medical or financial applications. We show that the concept of span of support vectors can be used to build a classifier that performs reasonably well while satisfying given space and time constraints, thus making it potentially suitable for such online situations. The span-based heuristic is observed to be effective under stringent memory limits (that is when the number of support vectors a machine can hold is very small). (c) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:1230 / 1237
页数:8
相关论文
共 20 条
  • [1] [Anonymous], 2005, INT C MACHINE LEARNI
  • [2] [Anonymous], ADV NEURAL INFORM PR
  • [3] [Anonymous], J MACHINE LEARNING R
  • [4] [Anonymous], 1998, Encyclopedia of Biostatistics
  • [5] [Anonymous], JMLR
  • [6] BURGES CJC, 1996, 13 INT C MACH LEARN, P71
  • [7] CAUWENBERGHS G, 2001, NEURAL INFORM PROCES
  • [8] Ultraconservative online algorithms for multiclass problems
    Crammer, K
    Singer, Y
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) : 951 - 991
  • [9] DEKEL O, 2007, ADV NEURAL INFORM PR
  • [10] Efficient SVM training using low-rank kernel representations
    Fine, S
    Scheinberg, K
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2002, 2 (02) : 243 - 264