Electrical - Electronic Engineering / Elektrik - Elektronik Mühendisliği

Permanent URI for this collectionhttps://hdl.handle.net/11147/11

Browse

Search Results

Now showing 1 - 3 of 3
  • Conference Object
    Citation - Scopus: 2
    Model-Free Expectation Maximization for Divisive Hierarchical Clustering of Multicolor Flow Cytometry Data
    (IEEE, 2014) Köktürk, Başak Esin; Karaçalı, Bilge
    This paper proposes a new 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 maximization scheme that exploits the posterior probability computation capability of the quasi-supervised learning algorithm. The divisions are carried out until a division cost exceeds an adaptively determined limit. Experiment results on synthetic as well as real multi-color flow cytometry datasets showed that the proposed method can accurately capture the prominent clusters without requiring any knowledge on the number of clusters or their distribution models.
  • Conference Object
    Citation - Scopus: 1
    Elektroensefalografi Verilerinin Yarı-güdümlü Öğrenme ile Otomatik Olarak İşaretlenmesi
    (IEEE, 2012) Köktürk, Başak Esin; Karaçalı, Bilge
    In this study, the separation of the stimulus effects from the baseline was investigated in electroencephalography data recorded under different visual stimuli using quasi-supervised learning. The data feature vectors were constructed using independent component analysis and wavelet transform, and then, these feature vectors were separated using quasi-supervised learning. Experiment results showed that the EEG data of the stimuli can be separated using quasi-supervised learning. © 2012 IEEE.
  • Article
    Citation - Scopus: 1
    Annealing-Based Model-Free Expectation Maximisation for Multi-Colour Flow Cytometry Data Clustering
    (Inderscience Enterprises Ltd., 2016) Köktürk, Başak Esin; Karaçalı, Bilge
    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 carriedout using a model-free expectation maximisation scheme that exploits the posterior probability computation capability of the quasi-supervised learningalgorithm subjected to a line-search optimisation over the reference set size parameter analogous to a simulated annealing approach. The divisions arecontinued until a division cost exceeds an adaptively determined limit. Experiment results on synthetic as well as real multi-colour flow cytometrydatasets showed that the proposed method can accurately capture the prominent clusters without requiring any prior knowledge on the number of clusters ortheir distribution models.