| 2. | Ana C. Umaquinga-Criollo; Juan D. Tamayo Quintero, María N. Moreno-García adn Yahya Aalaila; Diego H. Peluffo-Ordóñez Developments on Support Vector Machines for Multiple-Expert Learning Conference International Conference on Intelligent Data Engineering and Automated Learning., vol. 13113 , no. 22, Intelligent Data Engineering and Automated Learning – IDEAL 2021 Spinger Intelligent Data Engineering and Automated Learning – IDEAL 2021, 2021, ISBN: 978-3-030-91607-7. @conference{umaquinga2021SVM,
title = {Developments on Support Vector Machines for Multiple-Expert Learning},
author = {Ana C. Umaquinga-Criollo and Juan D. Tamayo Quintero, María N. Moreno-García adn Yahya Aalaila and Diego H. Peluffo-Ordóñez },
editor = {Springer},
url = {https://link.springer.com/chapter/10.1007/978-3-030-91608-4_57},
doi = {https://doi.org/10.1007/978-3-030-91608-4_57},
isbn = {978-3-030-91607-7},
year = {2021},
date = {2021-11-23},
urldate = {2021-11-23},
booktitle = {International Conference on Intelligent Data Engineering and Automated Learning.},
volume = {13113 },
number = {22},
pages = { 587–598},
publisher = {Intelligent Data Engineering and Automated Learning – IDEAL 2021},
organization = {Spinger},
series = {Intelligent Data Engineering and Automated Learning – IDEAL 2021},
abstract = {In supervised learning scenarios, some applications require solve a classification problem wherein labels are not given as a single ground truth. Instead, the criteria of a set of experts is used to provide labels aimed at compensating for the erroneous influence with respect to a single labeler as well as the error bias (excellent or lousy) due to the level of perception and experience of each expert. This paper aims to briefly outline mathematical developments on support vector machines (SVM), and overview SVM-based approaches for multiple expert learning (MEL). Such MEL approaches are posed by modifying the formulation of a least-squares SVM, which enables to obtain a set of reliable, objective labels while penalizing the evaluation quality of each expert. Particularly, this work studies both two-class (binary) MEL classifier (BMLC) and its extension to multiclass through one-against all (OaA-MLC) including penalization of each expert’s influence. Formal mathematical developments are stated, as well as remarkable discussion on key aspects about the least-squares SVM formulation and penalty factors are provided.},
key = {Multiple expert learning, Supervised learning, Support vector machines},
keywords = {Multiple expert learning, Supervised Learning, Support Vector Machines},
pubstate = {published},
tppubtype = {conference}
}
In supervised learning scenarios, some applications require solve a classification problem wherein labels are not given as a single ground truth. Instead, the criteria of a set of experts is used to provide labels aimed at compensating for the erroneous influence with respect to a single labeler as well as the error bias (excellent or lousy) due to the level of perception and experience of each expert. This paper aims to briefly outline mathematical developments on support vector machines (SVM), and overview SVM-based approaches for multiple expert learning (MEL). Such MEL approaches are posed by modifying the formulation of a least-squares SVM, which enables to obtain a set of reliable, objective labels while penalizing the evaluation quality of each expert. Particularly, this work studies both two-class (binary) MEL classifier (BMLC) and its extension to multiclass through one-against all (OaA-MLC) including penalization of each expert’s influence. Formal mathematical developments are stated, as well as remarkable discussion on key aspects about the least-squares SVM formulation and penalty factors are provided. |
| 1. | Diego Hernán Peluffo-Ordóñez; Paul Rosero-Montalvo; Ana Umaquinga-Criollo; Luis Suárez-Zambrano; Hernan Domínguez-Limaico; Omar Oña-Rocha; Stefany Flores-Armas; Edgar Maya-Olalla Theoretical developments for interpreting kernel spectral clus- tering from alternative viewpoints Journal Article In: Advances in Science, Technology and Engineering Systems Journal, vol. 2, no. 3, pp. 1670-1676, 2017, ISSN: 2415-6698. @article{Pelu2017,
title = {Theoretical developments for interpreting kernel spectral clus- tering from alternative viewpoints},
author = {Diego Hernán Peluffo-Ordóñez and Paul Rosero-Montalvo and Ana Umaquinga-Criollo and Luis Suárez-Zambrano and Hernan Domínguez-Limaico and Omar Oña-Rocha and Stefany Flores-Armas and Edgar Maya-Olalla},
editor = {ASTES},
url = {https://astesj.com/v02/i03/p208/
https://www.astesj.com/publications/ASTESJ_0203208.pdf https://scholar.google.com/scholar?hl=es&as_sdt=0%2C5&q=Theoretical+developments+for+interpreting+kernel+spectral+clus-tering+from+alternative+viewpoints&btnG=},
doi = {10.25046/aj0203208},
issn = {2415-6698},
year = {2017},
date = {2017-08-27},
journal = {Advances in Science, Technology and Engineering Systems Journal},
volume = {2},
number = {3},
pages = {1670-1676},
abstract = {To perform an exploration process over complex structured data within unsupervised settings, the so-called kernel spectral clustering (KSC) is one of the most recommended and appealing approaches, given its versatility and elegant formulation. In this work, we explore the relationship between (KSC) and other well-known approaches, namely normalized cut clustering and kernel k-means. To do so, we first deduce a generic KSC model from a primal-dual formulation based on least-squares support-vector machines (LS-SVM). For experiments, KSC as well as other consider methods are assessed on image segmentation tasks to prove their usability.},
keywords = {Kernel, Spectral Clustering, Support Vector Machines},
pubstate = {published},
tppubtype = {article}
}
To perform an exploration process over complex structured data within unsupervised settings, the so-called kernel spectral clustering (KSC) is one of the most recommended and appealing approaches, given its versatility and elegant formulation. In this work, we explore the relationship between (KSC) and other well-known approaches, namely normalized cut clustering and kernel k-means. To do so, we first deduce a generic KSC model from a primal-dual formulation based on least-squares support-vector machines (LS-SVM). For experiments, KSC as well as other consider methods are assessed on image segmentation tasks to prove their usability. |