On-line off-line ranking support vector machine and analysis

Proceedings of the International Joint Conference on Neural Networks

Volumn , Issue , 2008, Pages 1364-1369

  Gu, Bin ^a   Wang, Jiandong ^a   Chen, Haiyan ^a  

^a NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; CURVE FITTING; EDUCATION; ELECTRIC NETWORK ANALYSIS; IMAGE RETRIEVAL; LEARNING SYSTEMS; NEURAL NETWORKS; SUPPORT VECTOR MACHINES; VECTORS;

CONVEX QUADRATIC PROGRAMMINGS; FINITE CONVERGENCES; LEARNING PROBLEMS; ON-LINE LEARNINGS; SUPPORT VECTORS; THEORETICAL ANALYSES;

LEARNING ALGORITHMS;

EID: 56349156232     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IJCNN.2008.4633975     Document Type: Conference Paper

References (14)

1. R. Herbrich, T. Graepel and K. Obermayer, "Support vector learning for ordinal regression," In Proc.Proceedings of the International Conference on Artificial Neural Networks, 1999.
2. K. Crammer, Y. Singer "Online Ranking by Projecting," Neural Computation, vol. 17, pp. 145-175, 2005.
3. B. E. Boser, I. Guyon, and V. N. Vapnik,"A training algorithm for optimal margin classifiers," In Proc. the 5th Annual ACM Workshop on Computational Learning Theory, pp. 144-152, 1992.
4. V. N. Vapnik, Statistical Learning Theory. Wiley, New York, 1998.
5. E. Osuna, R. Freund, and F. Girosi, "An Improved Training Algorithm for Support Vector Machines," n Proc.Proceedings of the International Conference on Artificial Neural Networks, pp. 276-285, 1997.
6. T. Joachims, Advances in Kernel Methods- Support Vector Learning. B. Scholkopf, C.J.C. Burges and A.J. Smola (eds.), MIT Press, Cambridge MA, pp. 169-184, 1998.
7. J. C. Platt, "Fast Training of Support Vector Machines Using Sequential Minimum optimization," B. Scholkopf, C.J.C. Burges and A.J. Smola (eds.), MIT Press, Cambridge MA, pp. 169-184, 1998.
8. T. T. Frieß, N. Cristianini and C. Campbell, "The Kernel Adatron Algorithm: A Fast and Simple Learning Procedure for Support Vector Machines," In Proc. 15th Int. Conf. Machine Learning,Morgan Kaufman, 1998.
9. G. Cauwenberghs and T. Poggio, "Incremental and decremental support vector machine learning," K. L. Todd, G. D. Thomas and T. Volker (eds.),Advances in Neural Information Processing Systems MIT Press, pp. 409-415, 2001.
10. K. Crammer and Y. Singer, "Pranking with ranking," In Proc. Neural Info. Proc. Systems, 2002.
11. A. Shashua and A. Levin, "A new k-winners-take-all neural network and its array architecture," Taxonomy of Large Margin Principle Algorithms for Ordinal Regression Problems. Technical Report 2002-39, Leibniz Center for Research, School of Computer Science and Eng., the Hebrew University of Jerusalem.
12. P. Laskov, C. Gehl, S. Krüger and K.R. Müller, "IncrementalSupport VectorLearning: Analysis,Implementation and Applications," Journal of Machine LearningResearch, vol. 7, pp. 1909-1936, Sept. 2006.
13. C. J. Lin, "On the Convergence of the Decomposition Method for Support Vector Machines," IEEE Transactions on Neural Networks, vol. 12, no. 6, pp. 288-1298, Nov. 2001.
14. P.H. Chen, R.E. Fan and C.J Lin, "A Study on SMO-type Decomposition Methods for Support Vector Machines," IEEE Transactions on Circuits and Systems, vol. 17, no. 4, pp. 893-908, 2006.