Optimal data projection for kernel spectral clustering. Peluffo, D., Alzate, C., Suykens, J., & Castellanos-Dominguez, G. In *22nd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2014 - Proceedings*, 2014.

Website abstract bibtex

Website abstract bibtex

Spectral clustering has taken an important place in the context of pattern recognition, being a good alternative to solve problems with non-linearly separable groups. Because of its unsupervised nature, clustering methods are often parametric, requiring then some initial parameters. Thus, clustering performance is greatly dependent on the selection of those initial parameters. Furthermore, tuning such parameters is not an easy task when the initial data representation is not adequate. Here, we propose a new projection for input data to improve the cluster identification within a kernel spectral clustering framework. The proposed projection is done from a feature extraction formulation, in which a generalized distance involving the kernel matrix is used. Data projection shows to be useful for improving the performance of kernel spectral clustering.

@inproceedings{ title = {Optimal data projection for kernel spectral clustering}, type = {inproceedings}, year = {2014}, websites = {https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2014-163.pdf}, id = {de02361e-a29f-35ab-b592-9d9875512514}, created = {2022-01-26T03:01:11.775Z}, file_attached = {false}, profile_id = {aba9653c-d139-3f95-aad8-969c487ed2f3}, group_id = {b9022d50-068c-31b4-9174-ebfaaf9ee57b}, last_modified = {2022-01-26T03:01:11.775Z}, read = {false}, starred = {false}, authored = {false}, confirmed = {true}, hidden = {false}, private_publication = {false}, abstract = {Spectral clustering has taken an important place in the context of pattern recognition, being a good alternative to solve problems with non-linearly separable groups. Because of its unsupervised nature, clustering methods are often parametric, requiring then some initial parameters. Thus, clustering performance is greatly dependent on the selection of those initial parameters. Furthermore, tuning such parameters is not an easy task when the initial data representation is not adequate. Here, we propose a new projection for input data to improve the cluster identification within a kernel spectral clustering framework. The proposed projection is done from a feature extraction formulation, in which a generalized distance involving the kernel matrix is used. Data projection shows to be useful for improving the performance of kernel spectral clustering.}, bibtype = {inproceedings}, author = {Peluffo, D.H. and Alzate, C. and Suykens, J.A.K. and Castellanos-Dominguez, G.}, booktitle = {22nd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2014 - Proceedings} }

Downloads: 0

{"_id":"bD4p7yM2eXfBm6gfs","bibbaseid":"peluffo-alzate-suykens-castellanosdominguez-optimaldataprojectionforkernelspectralclustering-2014","authorIDs":[],"author_short":["Peluffo, D.","Alzate, C.","Suykens, J.","Castellanos-Dominguez, G."],"bibdata":{"title":"Optimal data projection for kernel spectral clustering","type":"inproceedings","year":"2014","websites":"https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2014-163.pdf","id":"de02361e-a29f-35ab-b592-9d9875512514","created":"2022-01-26T03:01:11.775Z","file_attached":false,"profile_id":"aba9653c-d139-3f95-aad8-969c487ed2f3","group_id":"b9022d50-068c-31b4-9174-ebfaaf9ee57b","last_modified":"2022-01-26T03:01:11.775Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"private_publication":false,"abstract":"Spectral clustering has taken an important place in the context of pattern recognition, being a good alternative to solve problems with non-linearly separable groups. Because of its unsupervised nature, clustering methods are often parametric, requiring then some initial parameters. Thus, clustering performance is greatly dependent on the selection of those initial parameters. Furthermore, tuning such parameters is not an easy task when the initial data representation is not adequate. Here, we propose a new projection for input data to improve the cluster identification within a kernel spectral clustering framework. The proposed projection is done from a feature extraction formulation, in which a generalized distance involving the kernel matrix is used. Data projection shows to be useful for improving the performance of kernel spectral clustering.","bibtype":"inproceedings","author":"Peluffo, D.H. and Alzate, C. and Suykens, J.A.K. and Castellanos-Dominguez, G.","booktitle":"22nd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2014 - Proceedings","bibtex":"@inproceedings{\n title = {Optimal data projection for kernel spectral clustering},\n type = {inproceedings},\n year = {2014},\n websites = {https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2014-163.pdf},\n id = {de02361e-a29f-35ab-b592-9d9875512514},\n created = {2022-01-26T03:01:11.775Z},\n file_attached = {false},\n profile_id = {aba9653c-d139-3f95-aad8-969c487ed2f3},\n group_id = {b9022d50-068c-31b4-9174-ebfaaf9ee57b},\n last_modified = {2022-01-26T03:01:11.775Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n private_publication = {false},\n abstract = {Spectral clustering has taken an important place in the context of pattern recognition, being a good alternative to solve problems with non-linearly separable groups. Because of its unsupervised nature, clustering methods are often parametric, requiring then some initial parameters. Thus, clustering performance is greatly dependent on the selection of those initial parameters. Furthermore, tuning such parameters is not an easy task when the initial data representation is not adequate. Here, we propose a new projection for input data to improve the cluster identification within a kernel spectral clustering framework. The proposed projection is done from a feature extraction formulation, in which a generalized distance involving the kernel matrix is used. Data projection shows to be useful for improving the performance of kernel spectral clustering.},\n bibtype = {inproceedings},\n author = {Peluffo, D.H. and Alzate, C. and Suykens, J.A.K. and Castellanos-Dominguez, G.},\n booktitle = {22nd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2014 - Proceedings}\n}","author_short":["Peluffo, D.","Alzate, C.","Suykens, J.","Castellanos-Dominguez, G."],"urls":{"Website":"https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2014-163.pdf"},"biburl":"https://bibbase.org/service/mendeley/aba9653c-d139-3f95-aad8-969c487ed2f3","bibbaseid":"peluffo-alzate-suykens-castellanosdominguez-optimaldataprojectionforkernelspectralclustering-2014","role":"author","metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://bibbase.org/service/mendeley/aba9653c-d139-3f95-aad8-969c487ed2f3","creationDate":"2020-02-26T04:21:14.511Z","downloads":0,"keywords":[],"search_terms":["optimal","data","projection","kernel","spectral","clustering","peluffo","alzate","suykens","castellanos-dominguez"],"title":"Optimal data projection for kernel spectral clustering","year":2014,"dataSources":["ntXyXv2964fDt3myF","ya2CyA73rpZseyrZ8"]}