Logo do repositório
 
Publicação

Probabilistic vector machines

dc.contributor.authorSilva, A. Pedro Duarte
dc.date.accessioned2025-07-21T12:07:33Z
dc.date.available2025-07-21T12:07:33Z
dc.date.issued2025-11
dc.description.abstractThis paper proposes a novel Support Vector Machine (SVM) methodology for finding accurate probabilities of class memberships in supervised classification problems. Classical SVMs do not complement their class predictions with reliable confidence measures for each class assignment. For two-class problems this problem can be overcome by combining a sequence of weighted SVMs predictions into consistent class probabilities. In this work we show how a smart use of mathematical programming models can be used to extend this approach to the general multi-class classification problem. Previous attempts to tackle this problem either do not scale well with the number of different classes, or rely on sub-optimal partition strategies. Numerical experiments reveal the good scaling properties of the proposal, and the relative advantages of its class probability estimates over alternative approacheseng
dc.identifier.doi10.1016/j.cor.2025.107203
dc.identifier.eid105010952801
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/10400.14/53982
dc.identifier.wos001534598300001
dc.language.isoeng
dc.peerreviewedyes
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectSupport vector machines
dc.subjectClassification
dc.subjectSupervised learning
dc.subjectMulticlass probabilities
dc.titleProbabilistic vector machineseng
dc.typeresearch article
dspace.entity.typePublication
oaire.citation.titleComputers and Operations Research
oaire.citation.volume183
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85

Ficheiros

Principais
A mostrar 1 - 1 de 1
A carregar...
Miniatura
Nome:
124437067.pdf
Tamanho:
1.71 MB
Formato:
Adobe Portable Document Format
Licença
A mostrar 1 - 1 de 1
Miniatura indisponível
Nome:
license.txt
Tamanho:
3.44 KB
Formato:
Item-specific license agreed upon to submission
Descrição: