loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th International Conference on Pattern Recognition (ICPR'04) - Volume 1
Comparing Optimal Bounding Ellipsoid and Support Vector Machine Active Learning
Cambridge UK
August 23-August 26
ISBN: 0-7695-2128-2
ASCII Text
x 
 
Ibrahim Gokcen, Dale Joachim, Jack R. Deller, "Comparing Optimal Bounding Ellipsoid and Support Vector Machine Active Learning," Pattern Recognition, International Conference on, vol. 1, pp. 172-175, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 1, 2004.
 
 
BibTex
x
 
@article{ 10.1109/ICPR.2004.1334041,
author = {Ibrahim Gokcen and Dale Joachim and Jack R. Deller},
title = {Comparing Optimal Bounding Ellipsoid and Support Vector Machine Active Learning},
journal ={Pattern Recognition, International Conference on},
volume = {1},
year = {2004},
issn = {1051-4651},
pages = {172-175},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICPR.2004.1334041},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Pattern Recognition, International Conference on
TI - Comparing Optimal Bounding Ellipsoid and Support Vector Machine Active Learning
SN - 1051-4651
SP172
EP175
A1 - Ibrahim Gokcen,
A1 - Dale Joachim,
A1 - Jack R. Deller,
PY - 2004
KW - null
VL - 1
JA - Pattern Recognition, International Conference on
ER -
 
Ibrahim Gokcen, Tulane University, New Orleans, LA
Dale Joachim, Tulane University, New Orleans, LA
Jack R. Deller, Michigan State University, East Lansing, MI
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 an 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.
Citation:
Ibrahim Gokcen, Dale Joachim, Jack R. Deller, "Comparing Optimal Bounding Ellipsoid and Support Vector Machine Active Learning," icpr, vol. 1, pp.172-175, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 1, 2004
Usage of this product signifies your acceptance of the Terms of Use.