Annealing-based model-free expectation maximisation for multi-colour flow cytometry data clustering Online publication date: Mon, 30-Nov-2015
by Başak Esin Köktürk; Bilge Karaçalı
International Journal of Data Mining and Bioinformatics (IJDMB), Vol. 14, No. 1, 2016
Abstract: This paper proposes an optimised model-free expectation maximisation method for automated clustering of high-dimensional datasets. The method is based on a recursive binary division strategy that successively divides an original dataset into distinct clusters. Each binary division is carried out using a model-free expectation maximisation scheme that exploits the posterior probability computation capability of the quasi-supervised learning algorithm subjected to a line-search optimisation over the reference set size parameter analogous to a simulated annealing approach. The divisions are continued until a division cost exceeds an adaptively determined limit. Experiment results on synthetic as well as real multi-colour flow cytometry datasets showed that the proposed method can accurately capture the prominent clusters without requiring any prior knowledge on the number of clusters or their distribution models.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining and Bioinformatics (IJDMB):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook