Probabilistic vector machine: Scalability through clustering hybridization

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

Abstract

In this paper, a hybrid clustering and classification algorithm is obtained by exploring the specific statistical model of a hyperplane classifier. We show how the seamless integration of the clustering component allows a substantial cost decrease in the training stage, without impairing the performance of the classifier. The algorithm is also robust to outliers and deals with training errors in a natural and efficient manner. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Cimpoeşu, M., Sucilǎ, A., & Luchian, H. (2013). Probabilistic vector machine: Scalability through clustering hybridization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8154 LNAI, pp. 187–198). https://doi.org/10.1007/978-3-642-40669-0_17

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