A fast linear separability test by projection of positive points on subspaces

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 713-720

  Yogananda, A P ^a   Murthy, M Narasimha ^a   Gopal, Lakshmi ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; MATRIX ALGEBRA; NEURAL NETWORKS; PROBLEM SOLVING; SUPPORT VECTOR MACHINES;

CONVEX HULL ALGORITHMS; FINITE SET OF POINTS; LINEAR SEPARABILITY TEST; SUBSPACES; TIME COMPLEXITY;

LINEAR STABILITY ANALYSIS;

EID: 34547987947     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273586     Document Type: Conference Paper

References (9)

1. Barber, C. B., Dobkin, D. P., & Huhdanpaa, H. (1996). The quickhull algorithm for convex hulls. ACM Transactions on Mathematical Software, 22, 469-483.
2. Cristianini, N., & Taylor, J. S. (2000). An introduction to support vector machines. Cambridge: Cambridge University Press.
3. Duda, R. O., Hart, P. E., & Stork, D. G. (2000). Pattem classification. New York: Wiley-Interscience.
4. Elizondo, D. (2006). The linear separability problem: Some testing methods. IEEE Transactions on Neural Networks, 17, 330-344.
5. 3L) operations. In N. Megiddo (Ed.), Progress in mathematical programming, 1-28. Springer-Verlag.
6. Joachims, T. (1999). Making large-Scale SVM learning practical. In B. Schlkopf, C. Burges and A. Smola (Eds.), Advances in Kernel Methods - Support Vector Learning. MIT-Press.
7. Newman, D., Hettich, S., Blake, C., & Merz, C. (1998). UCI repository of machine learning databases.
8. Tsang, I. W., Kwok, J. T., & Cheung, P.-M. (2005). Core vector machines: Fast SVM Training on Very Large Data Sets. Journal of Machine Learning Research, 6, 363-392.
9. Wasserman, P. (1989). Neural computing theory and practice. Van Nostrand Reinhold.