| 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. |