Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

An Improved Multi-Class Spectral Clustering Based on Normalized Cuts. Peluffo-Ordóñez, D., H., Acosta-Medina, C., D., & Castellanos-Domínguez, C., G. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pages 130-137. 2012.

Website doi abstract bibtex

In this work, we present an improved multi-class spectral clustering (MCSC) that represents an alternative to the standard k-way normalized clustering, avoiding the use of an iterative algorithm for tuning the orthogonal matrix rotation. The performance of proposed method is compared with the conventional MCSC and k-means in terms of different clustering quality indicators. Results are accomplished on commonly used toy data sets with hardly separable classes, as well as on an image segmentation database. In addition, as a clustering indicator, a novel unsupervised measure is introduced to quantify the performance of the proposed method. The proposed method spends lower processing time than conventional spectral clustering approaches. © 2012 Springer-Verlag.

@inbook{
 type = {inbook},
 year = {2012},
 pages = {130-137},
 websites = {http://link.springer.com/10.1007/978-3-642-33275-3_16},
 id = {bc77c121-7a6a-3712-8537-d75e1441aba3},
 created = {2022-01-26T03:00:50.718Z},
 file_attached = {false},
 profile_id = {aba9653c-d139-3f95-aad8-969c487ed2f3},
 group_id = {b9022d50-068c-31b4-9174-ebfaaf9ee57b},
 last_modified = {2022-01-26T03:00:50.718Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 citation_key = {Peluffo-Ordonez2012a},
 private_publication = {false},
 abstract = {In this work, we present an improved multi-class spectral clustering (MCSC) that represents an alternative to the standard k-way normalized clustering, avoiding the use of an iterative algorithm for tuning the orthogonal matrix rotation. The performance of proposed method is compared with the conventional MCSC and k-means in terms of different clustering quality indicators. Results are accomplished on commonly used toy data sets with hardly separable classes, as well as on an image segmentation database. In addition, as a clustering indicator, a novel unsupervised measure is introduced to quantify the performance of the proposed method. The proposed method spends lower processing time than conventional spectral clustering approaches. © 2012 Springer-Verlag.},
 bibtype = {inbook},
 author = {Peluffo-Ordóñez, Diego Hernán and Acosta-Medina, Carlos Daniel and Castellanos-Domínguez, César Germáan},
 doi = {10.1007/978-3-642-33275-3_16},
 chapter = {An Improved Multi-Class Spectral Clustering Based on Normalized Cuts},
 title = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}
}

Downloads: 0

{"_id":"7J4XS5x4yW4NZYcxM","bibbaseid":"peluffoordez-acostamedina-castellanosdomnguez-lecturenotesincomputerscienceincludingsubserieslecturenotesinartificialintelligenceandlecturenotesinbioinformatics-2012","authorIDs":[],"author_short":["Peluffo-Ordóñez, D., H.","Acosta-Medina, C., D.","Castellanos-Domínguez, C., G."],"bibdata":{"type":"inbook","year":"2012","pages":"130-137","websites":"http://link.springer.com/10.1007/978-3-642-33275-3_16","id":"bc77c121-7a6a-3712-8537-d75e1441aba3","created":"2022-01-26T03:00:50.718Z","file_attached":false,"profile_id":"aba9653c-d139-3f95-aad8-969c487ed2f3","group_id":"b9022d50-068c-31b4-9174-ebfaaf9ee57b","last_modified":"2022-01-26T03:00:50.718Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Peluffo-Ordonez2012a","private_publication":false,"abstract":"In this work, we present an improved multi-class spectral clustering (MCSC) that represents an alternative to the standard k-way normalized clustering, avoiding the use of an iterative algorithm for tuning the orthogonal matrix rotation. The performance of proposed method is compared with the conventional MCSC and k-means in terms of different clustering quality indicators. Results are accomplished on commonly used toy data sets with hardly separable classes, as well as on an image segmentation database. In addition, as a clustering indicator, a novel unsupervised measure is introduced to quantify the performance of the proposed method. The proposed method spends lower processing time than conventional spectral clustering approaches. © 2012 Springer-Verlag.","bibtype":"inbook","author":"Peluffo-Ordóñez, Diego Hernán and Acosta-Medina, Carlos Daniel and Castellanos-Domínguez, César Germáan","doi":"10.1007/978-3-642-33275-3_16","chapter":"An Improved Multi-Class Spectral Clustering Based on Normalized Cuts","title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","bibtex":"@inbook{\n type = {inbook},\n year = {2012},\n pages = {130-137},\n websites = {http://link.springer.com/10.1007/978-3-642-33275-3_16},\n id = {bc77c121-7a6a-3712-8537-d75e1441aba3},\n created = {2022-01-26T03:00:50.718Z},\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:00:50.718Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Peluffo-Ordonez2012a},\n private_publication = {false},\n abstract = {In this work, we present an improved multi-class spectral clustering (MCSC) that represents an alternative to the standard k-way normalized clustering, avoiding the use of an iterative algorithm for tuning the orthogonal matrix rotation. The performance of proposed method is compared with the conventional MCSC and k-means in terms of different clustering quality indicators. Results are accomplished on commonly used toy data sets with hardly separable classes, as well as on an image segmentation database. In addition, as a clustering indicator, a novel unsupervised measure is introduced to quantify the performance of the proposed method. The proposed method spends lower processing time than conventional spectral clustering approaches. © 2012 Springer-Verlag.},\n bibtype = {inbook},\n author = {Peluffo-Ordóñez, Diego Hernán and Acosta-Medina, Carlos Daniel and Castellanos-Domínguez, César Germáan},\n doi = {10.1007/978-3-642-33275-3_16},\n chapter = {An Improved Multi-Class Spectral Clustering Based on Normalized Cuts},\n title = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}\n}","author_short":["Peluffo-Ordóñez, D., H.","Acosta-Medina, C., D.","Castellanos-Domínguez, C., G."],"urls":{"Website":"http://link.springer.com/10.1007/978-3-642-33275-3_16"},"biburl":"https://bibbase.org/service/mendeley/aba9653c-d139-3f95-aad8-969c487ed2f3","bibbaseid":"peluffoordez-acostamedina-castellanosdomnguez-lecturenotesincomputerscienceincludingsubserieslecturenotesinartificialintelligenceandlecturenotesinbioinformatics-2012","role":"author","metadata":{"authorlinks":{}},"downloads":0},"bibtype":"inbook","creationDate":"2020-12-30T00:49:12.194Z","downloads":0,"keywords":[],"search_terms":["lecture","notes","computer","science","including","subseries","lecture","notes","artificial","intelligence","lecture","notes","bioinformatics","peluffo-ordóñez","acosta-medina","castellanos-domínguez"],"title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","year":2012,"biburl":"https://bibbase.org/service/mendeley/aba9653c-d139-3f95-aad8-969c487ed2f3","dataSources":["YEF3uFAbDNQXrkgNw","ya2CyA73rpZseyrZ8"]}