The nature of statistical learning theory
The nature of statistical learning theory
Making large-scale support vector machine learning practical
Advances in kernel methods
Swarm intelligence
Evolving Connectionist Systems: Methods and Applications in Bioinformatics, Brain Study and Intelligent Machines
Membership authentication in the dynamic group by face classification using SVM ensemble
Pattern Recognition Letters
Transductive Inference for Text Classification using Support Vector Machines
ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
Learning with progressive transductive support vector machine
Pattern Recognition Letters
Unsupervised word sense disambiguation rivaling supervised methods
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Estimation of Dependences Based on Empirical Data: Springer Series in Statistics (Springer Series in Statistics)
Diversity of ability and cognitive style for group decision processes
Information Sciences: an International Journal
Hierarchical Text Categorization in a Transductive Setting
ICDMW '08 Proceedings of the 2008 IEEE International Conference on Data Mining Workshops
Error bounds of multi-graph regularized semi-supervised classification
Information Sciences: an International Journal
Nearest neighbor editing aided by unlabeled data
Information Sciences: an International Journal
Spanning SVM Tree for Personalized Transductive Learning
ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part I
Semi-Supervised Learning
NFI: a neuro-fuzzy inference method for transductive reasoning
IEEE Transactions on Fuzzy Systems
Nearest neighbor pattern classification
IEEE Transactions on Information Theory
IEEE Transactions on Neural Networks
Nonlinear mappings in problem solving and their PSO-based development
Information Sciences: an International Journal
MicroCBR: A case-based reasoning architecture for the classification of microarray data
Applied Soft Computing
Agent personalized call center traffic prediction and call distribution
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Learning very fast decision tree from uncertain data streams with positive and unlabeled samples
Information Sciences: an International Journal
idMAS-SQL: Intrusion Detection Based on MAS to Detect and Block SQL injection through data mining
Information Sciences: an International Journal
An efficient classification approach for large-scale mobile ubiquitous computing
Information Sciences: an International Journal
A vector-valued support vector machine model for multiclass problem
Information Sciences: an International Journal
Recognizing architecture styles by hierarchical sparse coding of blocklets
Information Sciences: an International Journal
Compressed classification learning with Markov chain samples
Neural Networks
Theoretical aspects of mapping to multidimensional optimal regions as a multi-classifier
Intelligent Data Analysis
Hi-index | 0.07 |
Personalized transductive learning (PTL) builds a unique local model for classification of individual test samples and is therefore practically neighborhood dependant; i.e. a specific model is built in a subspace spanned by a set of samples adjacent to the test sample. While existing PTL methods usually define the neighborhood by a predefined (dis)similarity measure, this paper introduces a new concept of a knowledgeable neighborhood and a transductive Support Vector Machine (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 is systematically aggregated into a t-SVMT. Compared to a regular SVM and other SVMTs, a t-SVMT, by virtue of the aggregation of SVMs, has an inherent superiority in classifying class-imbalanced datasets. The t-SVMT has also solved the over-fitting problem of all previous SVMTs since it aggregates neighborhood knowledge and thus significantly reduces the size of the SVM tree. The properties of the t-SVMT are evaluated through experiments on a synthetic dataset, eight bench-mark cancer diagnosis datasets, as well as a case study of face membership authentication.