Spanning SVM Tree for Personalized Transductive Learning
Personalized Transductive Learning (PTL) builds a unique local model for classification of each test sample and therefore is practically neighborhood dependant. While existing PTL methods usually define the neighborhood by a predefined (dis)similarity measure, in this paper we introduce a new concept of knowledgeable neighborhood and a transductive SVM classification tree (t-SVMT) for PTL. The neighborhood of a test sample is constructed over the classification knowledge modelled by regional SVMs, and a set of such SVMs adjacent to the test sample are aggregated systematically into a t-SVMT. Compared to a regular SVM and other SVMTs, the proposed t-SVMT, by virtue of the aggregation of SVMs, has an inherent superiority on classifying class-imbalanced datasets. Furthermore, t-SVMT has solved the over-fitting problem of all previous SVMTs as it aggregates neighborhood knowledge and thus significantly reduces the size of the SVM tree.
Unable to display preview. Download preview PDF.
- 1.Vapnik, V.N.: The Nature of Statistical Learning Theory, 2nd edn., pp. 237–240, 263–265, 291–299. Springer, Berlin (1999)Google Scholar
- 2.Song, Q., Kasabov, N.: NFI: A Neuro-Fuzzy Inference Method for Transductive Resoning. IEEE Trans. on Fuzzy Systems 13(6), 799–808Google Scholar
- 3.Pang, S.: SVM Aggregation: SVM, SVM Ensemble, SVM Classification Tree. IEEE SMC eNewsletter (December 2005), http://www.ieeesmc.org/Newsletter/Dec2005/R11Pang.php
- 5.Schölkopf, J.C., Platt, J.C., Shawe-Taylor, J., Smola, A.J., Williamson, R.C.: Estimating the support of a high-dimensional distribution. Technical report, Microsoft Research, MSR-TR-99-87 (1999)Google Scholar
- 6.Joachims, T.: Transductive Inference for Text Classification using Support Vector Machines. In: Procs of the Sixteenth International Conference on Machine Learning, pp. 200–209 (1999)Google Scholar