• DocumentCode
    2335582
  • Title

    Incremental support vector machine construction

  • Author

    Domeniconi, Carlotta ; Gunopulos, Dimitrios

  • Author_Institution
    Dept. of Comput. Sci., California Univ., Riverside, CA, USA
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    589
  • Lastpage
    592
  • Abstract
    SVMs (support vector machines) suffer from the problem of large memory requirement and CPU time when trained in batch mode on large data sets. We overcome these limitations, and at the same time make SVMs suitable for learning with data streams, by constructing incremental learning algorithms. We first introduce and compare different incremental learning techniques, and show that they are capable of producing performance results similar to the batch algorithm, and in some cases superior condensation properties. We then consider the problem of training SVMs using stream data. Our objective is to maintain an updated representation of recent batches of data. We apply incremental schemes to the problem and show that their accuracy is comparable to the batch algorithm
  • Keywords
    batch processing (computers); data analysis; learning (artificial intelligence); learning automata; very large databases; CPU time; SVMs; batch algorithm; batch mode; condensation properties; data streams; incremental learning algorithms; incremental schemes; incremental support vector machine construction; large data sets; large memory requirement; stream data; updated representation; Computer science; Marketing and sales; Partitioning algorithms; Solids; Support vector machine classification; Support vector machines; Telephony; Training data;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on
  • Conference_Location
    San Jose, CA
  • Print_ISBN
    0-7695-1119-8
  • Type

    conf

  • DOI
    10.1109/ICDM.2001.989572
  • Filename
    989572