• DocumentCode
    419456
  • Title

    Comparing optimal bounding ellipsoid and support vector machine active learning

  • Author

    Gokcen, Ibrahim ; Joachim, Dale ; Deller, Jack R.

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Tulane Univ., New Orleans, LA, USA
  • Volume
    1
  • fYear
    2004
  • fDate
    23-26 Aug. 2004
  • Firstpage
    172
  • Abstract
    In this paper we propose two active learning algorithms combining statistical active learning methods based on SVM and optimal bounding algorithms (OBE) of adaptive system identification. We unify SVM and OBE by demonstrating the similarities and representing SVM in the OBE interpretation. Samples are judiciously selected based on a volume measure provided by OBE using both simple heuristic and greedy optimal strategies. Preliminary experiments illustrate the effectiveness of the proposed algorithms as compared to similar methods.
  • Keywords
    adaptive systems; greedy algorithms; learning (artificial intelligence); optimisation; statistical analysis; support vector machines; SVM; adaptive system identification; greedy optimal algorithms; heuristic algorithms; optimal bounding ellipsoid algorithm; statistical active learning methods; support vector machine; Adaptive systems; Computer science; Ellipsoids; Learning systems; Lifting equipment; Machine learning; Machine learning algorithms; Support vector machines; System identification; Volume measurement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on
  • ISSN
    1051-4651
  • Print_ISBN
    0-7695-2128-2
  • Type

    conf

  • DOI
    10.1109/ICPR.2004.1334041
  • Filename
    1334041