Block-quantized support vector ordinal regression

IEEE Transactions on Neural Networks

Volumn 20, Issue 5, 2009, Pages 882-890

  Zhao, Bin ^a   Wang, Fei ^a   Zhang, Changshui ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Block quantization; Clustering; Ordinal regression (OR); Support vector machine (SVM)

Indexed keywords

APPROXIMATION ACCURACY; BLOCK QUANTIZATION; CLUSTERING; DATA SAMPLE; DATA SET SIZE; KERNEL MATRICES; NUMBER OF CLUSTERS; OPTIMIZATION PROBLEMS; ORDINAL REGRESSION; ORDINAL REGRESSION (OR); REAL WORLD DATA; SUPPORT VECTOR; SUPPORT VECTOR MACHINE (SVM); TRAINING SETS;

CLUSTER ANALYSIS; COMPUTATIONAL COMPLEXITY; IMAGE RETRIEVAL; REGRESSION ANALYSIS; SUPPORT VECTOR MACHINES; VECTORS;

SET THEORY;

EID: 67349191704     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2009.2017533     Document Type: Article

References (29)

1. E. Frank and M. Hall, "A simple approach to ordinal classification," in Proc. 12th Eur. Conf. Mach. Learn., 2001, vol. 12, pp. 145-165.
2. S. Clemencon and N. Vayatis, "Ranking the best instances," J. Mach. Learn. Res., vol. 8, pp. 2671-2699, 2007.
3. Z. Cao, T. Qin, T. Liu, M. Tsai, and H. Li, "Learning to rank: From pairwise approach to listwise approach," in Proc. 24th Int. Conf. Mach. Learn., 2007, pp. 129-136.
4. J. Xu, Y. Cao, H. Li, and Y. Huang, "Cost-sensitive learning of SVM for ranking," in Proc. 17th Eur. Conf. Mach. Learn., 2006, pp. 833-840.
5. A. Agresti, Categorical Data Analysis, 2nd ed. New York: Wiley, 2002.
6. W. Chu and S. S. Keerthi, "Support vector ordinal regression," Neural Comput., vol. 19, pp. 792-815, 2007.
7. W. Chu and Z. Ghahramani, "Gaussian processes for ordinal regression," J. Mach. Learn. Res., vol. 6, pp. 1019-1041, 2005.
8. T. Joachims, "Training linear SVMs in linear time," in Proc. 12th ACM SIGKDD Int. Conf. Knowl. Disc. Data Mining, 2006, pp. 217-226.
9. H. Lin and L. Li, "Large-margin thresholded ensembles for ordinal regression: Theory and practice," in Proc. 17th Int. Conf. Algorithmic Learn. Theory, 2006, pp. 319-333.
10. S. Kramer, G. Widmer, B. Pfahringer, and M. DeGroeve, "Prediction of ordinal classes using regression trees," Fundamenta Informaticae, vol. 47, pp. 1-13, 2001.
11. S. Har-Peled, D. Roth, and D. Zimak, "Constraint classification: A new approach to multiclass classification and ranking," Neural Inf. Process. Syst., vol. 15, pp. 785-792, 2002.
12. R. Herbrich, T. Graepel, and K. Obermayer, "Lrage margin rank boundaries for ordinal regression," in Advances in Large Margin Classifiers. Cambridge, MA: MIT Press, 2000, pp. 115-132.
13. P. McCullagh and J. A. Nelder, Generalized Linear Models. London, U.K.: Chapman & Hall, 1983.
14. P. McCullagh, "Regression models for ordinal data," J. Roy. Statist. Soc. B, vol. 42, no. 2, pp. 109-142, 1980.
15. V. E. Johnson and J. H. Albert, Ordinal Data Modeling (Statistics for Social Science and Public Policy). New York: Springer-Verlag, 1999.
16. A. Shashua and A. Levin, "Ranking with large margin principle: Two approaches," Neural Inf. Process. Syst., vol. 15, pp. 937-944, 2002.
17. H. Yu, J. Yang, and J. Han, "Classifying large data sets using SVMs with hierarchical clusters," in Proc. 9th ACM SIGKDD Int. Conf. Knowl. Disc. Data Mining, 2003, pp. 306-315.
18. D. Boley and D. Cao, "Training support vector machine using adaptive clustering," in Proc. 4th SIAM Int. Conf. Data Mining, 2004, pp. 126-137.
19. J. Wang, X. Wu, and C. Zhang, "Support vector machines based on k means clustering for real-time business intelligence systems," Int. J. Business Intell. Data Mining, vol. 1, no. 1, pp. 54-64, 2005.
20. J. Yuan, J. Li, and B. Zhang, "Learning concepts from large scale imbalanced data sets using support cluster machines," in Proc. 14th Annu. ACM Int. Conf. Multimedia, 2006, pp. 441-450.
21. M. Almeida, A. Braga, and J. Braga, "SVM-KM: Speeding SVMs learning with a priori cluster selection and k-means," in Proc. 6th Brazilian Symp. Neural Netw., 2000, pp. 162-167.
22. H. Yu, J. Yang, J. Han, and X. Li, "Making svms scalable to large data sets using hierarchical cluster indexing," Data Mining Knowl. Disc. vol. 11, no. 3, pp. 295-321, 2005.
23. Z. Xu, K. Yu, V. Tresp, X. Xu, and J. Wang, "Representative sampling for text classification using support vector machines," in Proc. 25th Eur. Conf. Inf. Retrieval Res., 2003, pp. 393-407.
24. K. Zhang and J. T. Kwok, "Block-quantized kernel matrix for fast spectral embedding," in Proc. 23rd Int. Conf. Mach. Learn., 2006, vol. 23, pp. 1097-1104.
25. R. Bellman, Introduction to Matrix Analysis, 2nd ed. Philadelphia, PA: SIAM, 1997.
26. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu, "An efficient k-means clustering algorithm: Analysis and implementation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 7, pp. 881-892, Jul. 2002.
27. I. S. Dhillon, Y. Guan, and B. Kulis, "Weighted graph cuts without eigenvectors: A multilevel approach," IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 11, pp. 1944-1957, Nov. 2007.
28. W. Waegeman, B. Baets, and L. Boullart, "Roc analysis in ordinal regression learning," Pattern Recognit. Lett., vol. 29, pp. 1-9, 2008.
29. J. Rennie and N. Srebro, "Loss functions for preference levels: Regression with discrete, ordered labels," in Proc. IJCAI Multidisciplinary Workshop Adv. Preference Handling, 2005, pp. 180-186.