Secure semi-supervised vector quantization for dissimilarity data

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zhu, X., Schleif, F. M., & Hammer, B. (2013). Secure semi-supervised vector quantization for dissimilarity data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7902 LNCS, pp. 347–356). https://doi.org/10.1007/978-3-642-38679-4_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free