@inproceedings{
 title = {Normalized cuts clustering with prior knowledge and a pre-clustering stage},
 type = {inproceedings},
 year = {2013},
 websites = {https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2013-90.pdf},
 id = {5e979abb-ec49-3864-8b68-3a8144c3aff9},
 created = {2022-01-26T03:00:34.280Z},
 file_attached = {false},
 profile_id = {aba9653c-d139-3f95-aad8-969c487ed2f3},
 group_id = {b9022d50-068c-31b4-9174-ebfaaf9ee57b},
 last_modified = {2022-01-26T03:00:34.280Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 citation_key = {Peluffo-Ordonez2013a},
 private_publication = {false},
 abstract = {Clustering is of interest in cases when data are not labeled enough and a prior training stage is unfeasible. In particular, spectral clustering based on graph partitioning is of interest to solve problems with highly non-linearly separable classes. However, spectral methods, such as the well-known normalized cuts, involve the computation of eigenvectors that is a highly time-consuming task in case of large data. In this work, we propose an alternative to solve the normalized cuts problem for clustering, achieving same results as conventional spectral methods but spending less processing time. Our method consists of a heuristic search to find the best cluster binary indicator matrix, in such a way that each pair of nodes with greater similarity value are first grouped and the remaining nodes are clustered following a heuristic algorithm to search into the similarity-based representation space. The proposed method is tested over a public domain image data set. Results show that our method reaches comparable results with a lower computational cost.},
 bibtype = {inproceedings},
 author = {Peluffo-Ordoñez, D. and Castro-Ospina, A. E. and Chavez-Chamorro, D. and Acosta-Medina, C. D. and Castellanos-Dominguez, G.},
 booktitle = {ESANN 2013 proceedings, 21st European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning}
}

{"_id":"ZhbGbGxLTYaNqFKXQ","bibbaseid":"peluffoordoez-castroospina-chavezchamorro-acostamedina-castellanosdominguez-normalizedcutsclusteringwithpriorknowledgeandapreclusteringstage-2013","authorIDs":[],"author_short":["Peluffo-Ordoñez, D.","Castro-Ospina, A., E.","Chavez-Chamorro, D.","Acosta-Medina, C., D.","Castellanos-Dominguez, G."],"bibdata":{"title":"Normalized cuts clustering with prior knowledge and a pre-clustering stage","type":"inproceedings","year":"2013","websites":"https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2013-90.pdf","id":"5e979abb-ec49-3864-8b68-3a8144c3aff9","created":"2022-01-26T03:00:34.280Z","file_attached":false,"profile_id":"aba9653c-d139-3f95-aad8-969c487ed2f3","group_id":"b9022d50-068c-31b4-9174-ebfaaf9ee57b","last_modified":"2022-01-26T03:00:34.280Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Peluffo-Ordonez2013a","private_publication":false,"abstract":"Clustering is of interest in cases when data are not labeled enough and a prior training stage is unfeasible. In particular, spectral clustering based on graph partitioning is of interest to solve problems with highly non-linearly separable classes. However, spectral methods, such as the well-known normalized cuts, involve the computation of eigenvectors that is a highly time-consuming task in case of large data. In this work, we propose an alternative to solve the normalized cuts problem for clustering, achieving same results as conventional spectral methods but spending less processing time. Our method consists of a heuristic search to find the best cluster binary indicator matrix, in such a way that each pair of nodes with greater similarity value are first grouped and the remaining nodes are clustered following a heuristic algorithm to search into the similarity-based representation space. The proposed method is tested over a public domain image data set. Results show that our method reaches comparable results with a lower computational cost.","bibtype":"inproceedings","author":"Peluffo-Ordoñez, D. and Castro-Ospina, A. E. and Chavez-Chamorro, D. and Acosta-Medina, C. D. and Castellanos-Dominguez, G.","booktitle":"ESANN 2013 proceedings, 21st European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning","bibtex":"@inproceedings{\n title = {Normalized cuts clustering with prior knowledge and a pre-clustering stage},\n type = {inproceedings},\n year = {2013},\n websites = {https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2013-90.pdf},\n id = {5e979abb-ec49-3864-8b68-3a8144c3aff9},\n created = {2022-01-26T03:00:34.280Z},\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:34.280Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Peluffo-Ordonez2013a},\n private_publication = {false},\n abstract = {Clustering is of interest in cases when data are not labeled enough and a prior training stage is unfeasible. In particular, spectral clustering based on graph partitioning is of interest to solve problems with highly non-linearly separable classes. However, spectral methods, such as the well-known normalized cuts, involve the computation of eigenvectors that is a highly time-consuming task in case of large data. In this work, we propose an alternative to solve the normalized cuts problem for clustering, achieving same results as conventional spectral methods but spending less processing time. Our method consists of a heuristic search to find the best cluster binary indicator matrix, in such a way that each pair of nodes with greater similarity value are first grouped and the remaining nodes are clustered following a heuristic algorithm to search into the similarity-based representation space. The proposed method is tested over a public domain image data set. Results show that our method reaches comparable results with a lower computational cost.},\n bibtype = {inproceedings},\n author = {Peluffo-Ordoñez, D. and Castro-Ospina, A. E. and Chavez-Chamorro, D. and Acosta-Medina, C. D. and Castellanos-Dominguez, G.},\n booktitle = {ESANN 2013 proceedings, 21st European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning}\n}","author_short":["Peluffo-Ordoñez, D.","Castro-Ospina, A., E.","Chavez-Chamorro, D.","Acosta-Medina, C., D.","Castellanos-Dominguez, G."],"urls":{"Website":"https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2013-90.pdf"},"biburl":"https://bibbase.org/service/mendeley/aba9653c-d139-3f95-aad8-969c487ed2f3","bibbaseid":"peluffoordoez-castroospina-chavezchamorro-acostamedina-castellanosdominguez-normalizedcutsclusteringwithpriorknowledgeandapreclusteringstage-2013","role":"author","metadata":{"authorlinks":{}},"downloads":0},"bibtype":"inproceedings","biburl":"https://bibbase.org/service/mendeley/aba9653c-d139-3f95-aad8-969c487ed2f3","creationDate":"2020-04-01T06:16:23.432Z","downloads":0,"keywords":[],"search_terms":["normalized","cuts","clustering","prior","knowledge","pre","clustering","stage","peluffo-ordoñez","castro-ospina","chavez-chamorro","acosta-medina","castellanos-dominguez"],"title":"Normalized cuts clustering with prior knowledge and a pre-clustering stage","year":2013,"dataSources":["YEF3uFAbDNQXrkgNw","ya2CyA73rpZseyrZ8","ntXyXv2964fDt3myF","2252seNhipfTmjEBQ"]}