Secure semi-supervised vector quantization for dissimilarity data

Authors:
Xibin Zhu;Frank-Michael Schleif;Barbara Hammer
Affiliations:
CITEC - Centre of Excellence, Bielefeld University, Bielefeld, Germany;CITEC - Centre of Excellence, Bielefeld University, Bielefeld, Germany;CITEC - Centre of Excellence, Bielefeld University, Bielefeld, Germany
Venue:
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I
Year:
2013

Citing 7
Cited 0

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithmic Learning in a Random World

Algorithmic Learning in a Random World
Edit distance-based kernel functions for structural pattern classification

Pattern Recognition
Semisupervised learning from dissimilarity data

Computational Statistics & Data Analysis
Introduction to Semi-Supervised Learning

Introduction to Semi-Supervised Learning
Sparse conformal predictors

Statistics and Computing
Semi-Supervised Learning

Semi-Supervised Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The amount and complexity of data increase rapidly, however, due to time and cost constrains, only few of them are fully labeled. In this context non-vectorial relational data given by pairwise (dis-)similarities without explicit vectorial representation, like score- values in sequences alignments, are particularly challenging. Existing semi-supervised learning (SSL) algorithms focus on vectorial data given in Euclidean space. In this paper we extend a prototype-based classifier for dissimilarity data to non i.i.d. semi-supervised tasks. Using conformal prediction the 'secure region' of unlabeled data can be used to improve the trained model based on labeled data while adapting the model complexity to cover the 'insecure region' of labeled data. The proposed method is evaluated on some benchmarks from the SSL domain.