Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/17188
Title: | An Exploratory Study of the Inputs for Ensemble Clustering Technique as a Subset Selection Problem |
Authors: | Ayed, S Arzoky, M Swift, S Counsell, S Tucker, A |
Keywords: | ensemble clustering;consensus clustering;subset selection problem;heuristic search;machine learning |
Issue Date: | 9-Nov-2018 |
Publisher: | Springer |
Citation: | Ayed S., Arzoky M., Swift S., Counsell S. and Tucker A. (2019) An Exploratory Study of the Inputs for Ensemble Clustering Technique as a Subset Selection Problem. In: Arai K., Kapoor S., Bhatia R. (eds) Intelligent Systems and Applications. IntelliSys 2018. Advances in Intelligent Systems and Computing, vol 868. Springer, Cham. doi: 10.1007/978-3-030-01054-6_72. |
Abstract: | Ensemble and Consensus Clustering address the problem of unifying multiple clustering results into a single output to best reflect the agreement of input methods. They can be used to obtain more stable and robust clustering results in comparison with a single clustering approach. In this study, we propose a novel subset selection method that looks at controlling the number of clustering inputs and datasets in an efficient way. The authors propose a number of manual selection and heuristic search techniques to perform the selection. Our investi‐ gation and experiments demonstrate very promising results. Using these techni‐ ques can ensure better selection methods and datasets for Ensemble and Consensus Clustering and thus more efficient clustering results. |
URI: | https://bura.brunel.ac.uk/handle/2438/17188 https://ida-research.net/wp-content/uploads/sites/18/2018/02/IDA_research_talk_v7.pdf |
DOI: | https://doi.org/10.1007/978-3-030-01054-6_72 |
ISBN: | 978-3-030-01053-9 978-3-030-01054-6 |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | 1.02 MB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.