Unsupervised clustering algorithms can be combined to improve the robustness and the quality of the results, e.g. in blind source separation. Before combining the results of these clustering methods the corresponding clusters have to be aligned, but usually it is not known which clusters of the employed methods correspond to each other. In this paper, we present a method to avoid this correspondence problem using probability theory. We also present an application of our method in blind source separation. Our approach is better expandable than other state-of-the-art separation algorithms while leading to slightly better results. © 2012 Springer-Verlag.
CITATION STYLE
Becker, J. M., Spiertz, M., & Gnann, V. (2012). A probability-based combination method for unsupervised clustering with application to blind source separation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7191 LNCS, pp. 99–106). https://doi.org/10.1007/978-3-642-28551-6_13
Mendeley helps you to discover research relevant for your work.