SVM Venn Machine with k-Means Clustering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

SVM Venn Machine with k-Means Clustering


In this paper, we introduce a new method of designing Venn Machine taxonomy based on Support Vector Machines and k-means clustering for both binary and multi-class problems. We compare this algorithm to some other multi-probabilistic predictors including SVM Venn Machine with homogeneous intervals and a recently developed algorithm called Venn-ABERS predictor. These algorithms were tested on a range of real-world data sets. Experimental results are presented and discussed.
Fichier principal
Vignette du fichier
978-3-662-44722-2_27_Chapter.pdf (248.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01391052 , version 1 (02-11-2016)





Chenzhe Zhou, Ilia Nouretdinov, Zhiyuan Luo, Alex Gammerman. SVM Venn Machine with k-Means Clustering. 10th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), Sep 2014, Rhodes, Greece. pp.251-260, ⟨10.1007/978-3-662-44722-2_27⟩. ⟨hal-01391052⟩
257 View
107 Download



Gmail Facebook X LinkedIn More